dynamic facility layout problem
Recently Published Documents


TOTAL DOCUMENTS

71
(FIVE YEARS 2)

H-INDEX

21
(FIVE YEARS 0)

Author(s):  
Mostafa Zandieh ◽  
Seyed Shamsodin Hosseini ◽  
parham azimi ◽  
Mani Sharifi

This paper deals with dynamic facility layout problem (DFLP) in a plant which is concerned with determining the best position of machines in the plant during a multi-period planning horizon. The material handling costs and machines rearrangement costs are used to determine the best layout. In addition to positions of machines, the details of transportation such as type of transporters and sequence of transportation operations have a direct effect on MHC. Therefore, it is more realistic to consider the transportation details during DFLP optimization. This paper proposes a new mathematical model to simultaneously determine the best position of machines in each period and to plan the transportation operations. Minimizing sum of MHC and MRC is considered as the objective function. A new hybrid meta-heuristic approach has been developed by combining modified genetic algorithm and cloud-based simulated annealing algorithm to solve the model. Finally, the proposed methodology is compared with two meta-heuristics on a set of test problems.





2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Yunfang Peng ◽  
Tian Zeng ◽  
Lingzhi Fan ◽  
Yajuan Han ◽  
Beixin Xia

This paper deals with stochastic dynamic facility layout problem under demand uncertainty in terms of material flow between facilities. A robust approach suggests a robust layout in each period as the most frequent one falling within a prespecified percentage of the optimal solution for multiple scenarios. Mont Carlo simulation method is used to randomly generate different scenarios. A mathematical model is established to describe the dynamic facility layout problem with the consideration of transport device assignment. As a solution procedure for the proposed model, an improved adaptive genetic algorithm with population initialization strategy is developed to reduce the search space and improve the solving efficiency. Different sized instances are compared with Particle Swarm Optimization (PSO) algorithm to verify the effectiveness of the proposed genetic algorithm. The experiments calculating the cost deviation ratio under different fluctuation level show the good performance of the robust layout compared to the expected layout.



Sign in / Sign up

Export Citation Format

Share Document