Developing a Hybrid Multi Population Genetic Algorithm for the Dynamic Facility Layout Problem with Budget Constraint
|International Journal of Engineering Trends and Technology (IJETT)||
|© 2015 by IJETT Journal|
|Year of Publication : 2015|
|Authors : Dileep K S, Prof. Cijo Mathew, Prof. (Dr.) Biju B
|DOI : 10.14445/22315381/IJETT-V29P241|
Dileep K S, Prof. Cijo Mathew, Prof. (Dr.) Biju B"Developing a Hybrid Multi Population Genetic Algorithm for the Dynamic Facility Layout Problem with Budget Constraint", International Journal of Engineering Trends and Technology (IJETT), V29(5),227-231 November 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Complexity has always been a major issue to develop a solution algorithm for dynamic facility layout problem. Many researchers have proposed different algorithms for dynamic facility layout problem. From literature survey it was realized that the performance of the algorithm can be further boosted by a more intelligent search. This work develops an effective hybrid multi-population genetic algorithm to solve dynamic facility layout problem. Using a suggested heuristic procedure, to intensify the search, a powerful local search mechanism based on simulated annealing is created. The proposed algorithm helps to save the computational time by skipping infeasible space. The proposed multi population genetic simulated annealing algorithm is compared with the results from dynamic facility layout problem with budget constraint proposed by Parham Azimi, Hamid Reza Charmchi  for different benchmark problem instances from Balakrishnan and Cheng . The proposed algorithm provides good results for the problems under consideration with reduced computational time.
 M.J. Rosenblatt, The dynamics of plant layout, Manag. Sci.
32 (1) (1986) 76–86.
 T.L. Urban, A heuristic for the dynamic facility layout problem, IIE Trans. 25 (4) (1993) 57–63.
 J. Balakrishnan, C.H. Cheng, Genetic search and the dynamic layout problem, Comput. Oper. Res. 27 (6) (2000) 587–593.
 T.A. Lacksonen, E.E. Enscore, Quadratic assignment algorithms for the dynamic layout problem, Int. J. Prod. Res. 31 (3) (1993) 503–517.
 D.G. Conway, M.A. Venkataramanan, Genetic search and the dynamic facility layout problem, Comput. Oper. Res. 21 (8) (1994) 955–960.
 J. Balakrishnan, C.H. Cheng, Genetic search and the dynamic layout problem,Comput. Oper. Res. 27 (6) (2000) 587–593.
 B.K. Kaku, J.B. Mazzola, A tabu-search heuristic for the dynamic plant layout problem, INFORMS J. Comput. 9 (4) (1997) 374–384.
 A. Baykasoglu, N.N.Z. Gindy, A simulated annealing algorithm for dynamic lay-out problem, Comput. Oper. Res. 28 (2001) 1403–1426.
 E. Erel, J.B. Ghosh, J.T. Simon, New heuristic for the dynamic layout problem, J.Oper. Res. Soc. 54 (2003) 1275– 1282.
 J.M. Rodriguez, F.C. MacPhee, D.J. Bonham, 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.
 J. Balakrishnan, C.H. Cheng, The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty, Omega 37 (2009) 165–177.
 R. Sahin, O. Turkbey, A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem, Int. J. Prod. Res. 47 (24) (2009)6855–6873.
 Hani Pourvaziri, B. Naderi, A hybrid multi population genetic algorithm for the dynamic facility layout problem, Applied Soft Computing 24 (2014) 457-469.
 Goldberg D.E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishers, Massachusetts.
 Francis R. A. and White J. A. (1972) Facility layout and location: an analytical approach, Englewood Cliffs, NJ: Prentice-Hall.
 Parham Azimi, Reza Charmchi, A new optimization approach for dynamic facility layout with budget constraint, Oper. Res. 168 (2) (2012) 57–89.
 Wei Xie, Nikolaos V. Sahinidis, A branch-and-bound algorithm for the continuous facility layout problem, Computers and Chemical Engineering 32 (2008) 1016–1028
 Yavuz A. Bozer, Suk-Chul Rim, (1996). A branch and bound method for solving the bidirectional circular layout problem, Appl. Math. Modeling Res.12 (7) (1996) 342-351.
Dynamic facility layout problem, computational time, Material handling cost, Rearrangement cost, Budget constraint.