A hybrid multi-population genetic algorithm for the dynamic facility layout problem

Applied Soft Computing Journal

Volumn 24, Issue , 2014, Pages 457-469

  Pourvaziri, Hani ^a   Naderi, B ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b KHARAZMI UNIVERSITY   (Iran)

Author keywords

Dynamic facility layout problem; Heuristics; Multi population genetic algorithm

Indexed keywords

BENCHMARKING; GENETIC ALGORITHMS; HEURISTIC METHODS; PLANT LAYOUT; SIMULATED ANNEALING; TAGUCHI METHODS;

COMPUTATIONAL TIME; DYNAMIC FACILITY LAYOUT PROBLEM; HEURISTIC PROCEDURES; HEURISTICS; INHERENT COMPLEXITY; INTELLIGENT SEARCH; MULTI-POPULATION GENETIC ALGORITHM; SOLUTION ALGORITHMS;

ALGORITHMS;

EID: 84907313221     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.06.051     Document Type: Article

References (38)

1. J.A. Tompkins, J.A. White, Y.A. Bozer, E.H. Frazelle, J.M.A. Tanchoco, and J. Trevino Facilities Planning 1996 Wiley New York
2. R.D. Meller, and K.Y. Gau The facility layout problem: recent and emerging trends and perspectives J. Manuf. Syst. 15 5 1996 351 366
3. R.L. Francis, L.F. McGinnis, and J.A. White Facility Layout and Location: An Analytical Approach 1992 Prentice Hall New Jersey
4. P. Afentakis, R. Millen, and M.M. Solomon Dynamic layout strategies for flexible manufacturing systems Int. J. Prod. Res. 28 1990 311 323
5. A.R. McKendall, and J. Shang Hybrid ant systems for the dynamic facility layout problem Comput. Oper. Res. 33 3 2006 790 803 (Pubitemid 41101125)
6. J. Balakrishnan, and C.H. Cheng Genetic search and the dynamic layout problem Comput. Oper. Res. 27 6 2000 587 593 (Pubitemid 30218486)
7. M.J. Rosenblatt The dynamics of plant layout Manag. Sci. 32 1 1986 76 86
8. T.L. Urban A heuristic for the dynamic facility layout problem IIE Trans. 25 4 1993 57 63
9. T.A. Lacksonen, and E.E. Enscore Quadratic assignment algorithms for the dynamic layout problem Int. J. Prod. Res. 31 3 1993 503 517 (Pubitemid 23628047)
10. D.G. Conway, and M.A. Venkataramanan Genetic search and the dynamic facility layout problem Comput. Oper. Res. 21 8 1994 955 960
11. B.K. Kaku, and J.B. Mazzola A tabu-search heuristic for the dynamic plant layout problem INFORMS J. Comput. 9 4 1997 374 384 (Pubitemid 127697782)
12. J. Balakrishnan, C.H. Cheng, and D.G. Conway An improved pair-wise exchange heuristic for the dynamic plant layout problem Int. J. Prod. Res. 38 13 2000 3067 3077 (Pubitemid 35401978)
13. J. Balakrishnan, C.H. Cheng, D.G. Conway, and C.M. Lau A hybrid genetic algorithm for the dynamic plant layout problem Int. J. Prod. Econ. 86 2003 107 120
14. E. Erel, J.B. Ghosh, and J.T. Simon New heuristic for the dynamic layout problem J. Oper. Res. Soc. 54 2003 1275 1282
15. A.R. McKendall, J. Shang, and S. Kuppusamy Simulated annealing heuristics for the dynamic facility layout problem Comput. Oper. Res. 33 8 2006 2431 2444 (Pubitemid 41802297)
16. J.M. Rodriguez, F.C. MacPhee, D.J. Bonham, and V.C. Bhavsar Solving the dynamic plant layout problem using a new hybrid meta-heuristic algorithm Int. J. High Perform. Comput. Netw. 4 5/6 2006 286 294
17. A. Baykasoglu, T. Dereli, and I. Sabuncu An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems Omega 34 2006 385 396 (Pubitemid 41644498)
18. J. Balakrishnan, and C.H. Cheng The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty Omega 37 2009 165 177
19. R. Sahin, and O. Turkbey A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem Int. J. Prod. Res. 47 24 2009 6855 6873
20. A.R. McKendall, and W.H. Liu New Tabu search heuristics for the dynamic facility layout problem Int. J. Prod. Res. 50 3 2011 867 878
21. W. Chiang, and P. Kouvelis An improved tabu search heuristic for solving facility layout design problems Int. J. Prod. Res. 34 1996 2565 2585 (Pubitemid 126519793)
22. A. Baykasoglu, and N.N.Z. Gindy A simulated annealing algorithm for dynamic layout problem Comput. Oper. Res. 28 2001 1403 1426 (Pubitemid 32787399)
23. J. Balakrishnan, and C.H. Cheng Dynamic layout algorithms: a state-of-the-art survey Omega 26 4 1998 507 521 (Pubitemid 128180594)
24. T. Dunker, G. Radons, and E. Westkamper Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem Eur. J. Oper. Res. 165 1 2005 55 69 (Pubitemid 40135593)
25. A.R. McKendall, and A. Hakobyan Heuristics for the dynamic facility layout problem with unequal-area departments Eur. J. Oper. Res. 201 2010 171 182
26. C.F.M. Toledo, R.R.R. Oliveira, and P.M. França A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging Comput. Oper. Res. 40 4 2013 910 919
27. C.F.M. Toledo, M.S. Arantes, R.R.R. Oliveira, and B. Almada-Lobo Glass container production scheduling through hybrid multi-population based evolutionary algorithm Appl. Soft Comput. 13 2013 1352 1364
28. P.C. Chang, and S.H. Chen The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems Appl. Soft Comput. 9 2009 173 181
29. D.T. Pham, and D. Karaboga Intelligent Optimisation Techniques. Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks 2000 SpringerVerlag London 302
30. A.S. Drud CONOPT - a large-scale GRG code ORSA J. Comput. 6 2 1992 207 216
31. J.J. Grefenstette Incorporating problem specific knowledge into genetic algorithms L. Davis, Genetic Algorithms and Simulated Annealing 1987 42 60
32. C.L. Huntley, and D.E. Brown Parallel genetic algorithms with local search Comput. Oper. Res. 18 3 1991 275 289
33. S. Kirkpatrick, C.D.J.R. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
34. B. Naderi, M. Khalili, and R. Tavakkoli-Moghaddam A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time Comput. Ind. Eng. 56 4 2009 1494 1501
35. D.C. Montgomery Design and Analysis of Experiments 5th ed. 2000 Wiley New York
36. S.M. Phadke Quality Engineering Using Robust Design 1989 Prentice Hall Englewood Cliffs, NJ
37. C.M. Hsu Improving the lighting performance of a 3535 packaged hi-power LED using genetic programming, quality loss functions and particle swarm optimization Appl. Soft Comput. 12 2012 2933 2947
38. C.Y. Tanga, Y.L. Wub, and C.C. Peng Fundamental matrix estimation by multiobjective genetic algorithm with Taguchi's method Appl. Soft Comput. 12 2012 553 558