Search published articles

Showing 2 results for Khosravi

J. Salajegheh, S. Khosravi,
Volume 1, Issue 4 (12-2011)

A hybrid meta-heuristic optimization method is introduced to efficiently find the optimal shape of concrete gravity dams including dam-water-foundation rock interaction subjected to earthquake loading. The hybrid meta-heuristic optimization method is based on a hybrid of gravitational search algorithm (GSA) and particle swarm optimization (PSO), which is called GSA-PSO. The operation of GSA-PSO includes three phases. In the first phase, a preliminary optimization is accomplished using GSA as local search. In the second phase, an optimal initial swarm is produced using the optimum result of GSA. Finally, PSO is employed to find the optimum design using the optimal initial swarm. In order to reduce the computational cost of dam analysis subject to earthquake loading, weighted least squares support vector machine (WLS-SVM) is employed to accurately predict dynamic responses of gravity dams. Numerical results demonstrate the high performance of the hybrid meta-heuristic optimization for optimal shape design of concrete gravity dams. The solutions obtained by GSA-PSO are compared with those of GSA and PSO. It is revealed that GSA-PSO converges to a superior solution compared to GSA and PSO, and has a lower computation cost.
S. Khosravi, S. H. Mirmohammadi,
Volume 6, Issue 2 (6-2016)

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In 
this paper, stochastic dynamic lot sizing problem with considering the quantity discount is defined  and  formulated.  Since  the  considered  model  is  mixed  integer  non-linear programming,  a  piecewise  linear  approximation  is  also  presented.  In  order  to  solve  the mixed integer non-linear programming, a branch and bound algorithm are presented. Each node in the branch and bound algorithm is also MINLP which is solved based on dynamic programming framework. In each stage in this dynamic programming algorithm, there  is a sub-problem which can be solved with lagrangian relaxation method. The numeric results found in this  study indicate that the proposed algorithm solve the problem faster than the mathematical  solution  using  the  commercial  software  GAMS.  Moreover,  the  proposed algorithm for  the  two  discount  levels  are  also  compared  with  the  approximate  solution  in mentioned software. The results indicate that our algorithm up to 12 periods not only can reach to the exact solution, it consumes less time in contrast to the approximate model.

Page 1 from 1     

© 2021 CC BY-NC 4.0 | Iran University of Science & Technology

Designed & Developed by : Yektaweb