Management Science
A simulated annealing algorithm for dynamic layout problem
Computers and Operations Research
Simulated annealing heuristics for the dynamic facility layout problem
Computers and Operations Research
Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm
International Journal of High Performance Computing and Networking
Expert Systems with Applications: An International Journal
Hybrid ant systems for the dynamic facility layout problem
Computers and Operations Research
A simulated annealing heuristic for the dynamic layout problem with budget constraint
Computers and Industrial Engineering
| Hi-index | 0.00 |
A new efficient heuristic algorithm has been developed for the dynamic facility layout problem with budget constraint (DFLPB) using optimization via simulation technique. The heuristic integrates integer programming and discrete event simulation to address DFLPB. In the proposed algorithm, the nonlinear model of the DFLP has been changed to a pure integer programming (PIP) model. Then, the optimal solution of the PIP model has been used in a simulation model that has been designed in a similar manner as the DFLP for determining the probability of assigning a facility to a location. After a sufficient number of runs, the simulation model obtains near optimum solutions. Finally, to test the performance of the algorithm, several test problems have been taken from the literature and solved. The results show that the proposed algorithm is more efficient in terms of speed and accuracy than other heuristic algorithms presented in previous works.