A simulated annealing algorithm for solving the bi-objective facility layout problem

2011 ◽  
Vol 38 (4) ◽  
pp. 4460-4465 ◽  
Author(s):  
Ramazan Şahin
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Facility Layout ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Annealing Algorithm

scholarly journals Multi Objective Simulated Annealing Approach for Facility Layout Design

2018 ◽  
Vol 3 (4) ◽  
pp. 365-380 ◽  
Author(s):  
Safiye Turgay
Keyword(s):  
Simulated Annealing ◽  
Objective Function ◽  
Material Handling ◽  
Simulated Annealing Algorithm ◽  
Facility Layout ◽  
Layout Design ◽  
Local Optima ◽  
Facility Layout Design ◽  
Multi Objective ◽  
Annealing Algorithm

Facility layout design problem considers the departments’ physcial layout design with area requirements in some restrictions such as material handling costs, remoteness and distance requests. Briefly, facility layout problem related to optimization of the layout costs and working conditions. This paper proposes a new multi objective simulated annealing algorithm for solving of the unequal area in layout design. Using of the different objective weights are generated with entropy approach and used in the alternative layout design. Multi objective function takes into the objective function and constraints. The suggested heuristic algorithm used the multi-objective parameters for initialization. Then prefered the entropy approach determines the weight of the objective functions. After the suggested improved simulated annealing approach applied to whole developed model. A multi-objective simulated annealing algorithm is implemented to increase the diversity and reduce the chance of getting layout conditions in local optima.

scholarly journals A new soft computing algorithm based on cloud theory for dynamic facility layout problem

2020 ◽  
Author(s):  
Mostafa Zandieh ◽  
Seyed Shamsodin Hosseini ◽  
parham azimi ◽  
Mani Sharifi
Keyword(s):  
Material Handling ◽  
Simulated Annealing Algorithm ◽  
Facility Layout ◽  
Planning Horizon ◽  
Test Problems ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Material Handling Costs ◽  
Cloud Theory

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.

Sign in / Sign up

Export Citation Format

Share Document