Classical Facility Layout Problems Revisited: Modern Challenges and Algorithmic Advances

Yanfang He

doi:10.54691/9c6qrj93

Authors

Yanfang He

DOI:

https://doi.org/10.54691/9c6qrj93

Keywords:

Facility Layout; Layout Configuration; Optimization Algorithms.

Abstract

Facility layout problems constitute a classical and evolving research area in engineering management. This paper provides a structured review of research progress across various layout configurations—from Single Row to Multi-floor Layouts—and their solution methodologies, including exact algorithms and heuristic/metaheuristic approaches. It also synthesizes advances in mathematical modeling and identifies future research directions in the field, At the same time, it provides some references and optimization methods for future facility layout work.

Downloads

Download data is not yet available.

References

[1] Hosseini-Nasab H, Fereidouni S, Fatemi Ghomi S M T, et al. Classification of facility layout problems: a review study[J]. The International Journal of Advanced Manufacturing Technology, 2018, 94(1-4): 957-977.

[2] Tompkins J A, White J A, Bozer Y A, et al. Facilities planning (4th ed.)[M]. New York: John Wiley & Sons, 2010.

[3] Anjos M F, Vannelli A. Computing globally optimal solutions for single-row facility layout problems using semidefinite programming and cutting planes[J]. INFORMS Journal on Computing, 2008, 20(4): 611-617.

[4] Simmons D M. One-dimensional space allocation: An ordering algorithm[J]. Operations Research, 1969, 17(5): 812-826.

[5] Heragu S S, Kusiak A. Efficient models for the facility layout problem[J]. European Journal of Operational Research, 1991, 53(1): 1-13.

[6] Amaral A R S. A new lower bound for the single-row facility layout problem[J]. Discrete Applied Mathematics, 2006, 154(14): 1965-1977.

[7] Anjos M F, Vanelli A. On the polyhedral combinatorics of the single-row equidistant facility layout problem[J]. Discrete Applied Mathematics, 2007, 155(16): 2097-2117.

[8] Love R F, Wong J Y. Solving quadratic assignment problems with rectilinear distances and integer programming[J]. Naval Research Logistics Quarterly, 1976, 23(4): 623-627.

[9] Kaku B K, Mazzola J B. A tabu-search heuristic for the dynamic plant layout problem[J]. INFORMS Journal on Computing, 1997, 9(4): 374-384.

[10] Amaral A R S. On the exact solution of a facility layout problem[J]. European Journal of Operational Research, 2009, 173(2): 508-518.

[11] Hungerländer P, Rendl F. A computational study and survey of methods for the single-row facility layout problem[J]. Computational Optimization and Applications, 2013, 55(1): 1-20.

[12] Anjos M F, Yen G. Provably near-optimal solutions for very large single-row facility layout problems[J]. Optimization Methods and Software, 2009, 24(4-5): 805-817.

[13] Anjos M F, Vanelli A. Computing globally optimal solutions for single-row facility layout problems using semidefinite programming and cutting planes[J]. INFORMS Journal on Computing, 2008, 20(4): 611-617.

[14] Anjos M F, Vannelli A, Zuo Z. A semidefinite optimization based approach for the single-row facility layout problem with unequal dimensions[J]. Discrete Optimization, 2018, 27: 131-146.

[15] Anjos M F, Fischer A, Hungerländer P. New exact approaches to row layout problems[C]// International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming. Springer, Berlin, Heidelberg, 2012: 1-12.

[16] Anjos M F, Fischer A, Hungerländer P. An improved exact algorithm for the double-row facility layout problem[J]. Journal of the Operational Research Society, 2015, 66(9): 1485-1491.

[17] Djellab H, Garaix T. A new mathematical formulation for the double-row layout problem[J]. International Journal of Production Research, 2014, 52(14): 4222-4236.

[18] Hungerländer P, Rendl F. A computational study and survey of methods for the single-row facility layout problem[J]. Computational Optimization and Applications, 2013, 55(1): 1-20.

[19] Hungerländer P, Rendl F. A computational study and survey of methods for the single-row facility layout problem[J]. Computational Optimization and Applications, 2013, 55(1): 1-20.

[20] Kothari R, Ghosh D. A scatter search algorithm for the single-row facility layout problem[J]. Journal of the Operational Research Society, 2014, 65(6): 947-963.

[21] Chung J, Tyner T. A new heuristic algorithm for the multi-row facility layout problem[J]. International Journal of Production Research, 2016, 54(13): 3911-3925.

[22] Palubeckis G. Fast simulated annealing for single-row equidistant facility layout[J]. Applied Mathematics and Computation, 2015, 263: 287-301.

[23] Murray C C, Smith A E, Zhang Z. An efficient local search heuristic for the double-row facility layout problem[J]. European Journal of Operational Research, 2013, 231(3): 775-785.

[24] Sahin R. A simulated annealing algorithm for the double-row facility layout problem[J]. Applied Mathematics and Computation, 2014, 243: 1-11.

[25] Hosseini-Nasab H, Emami L. A hybrid imperialist competitive algorithm for the single-row facility layout problem[J]. The International Journal of Advanced Manufacturing Technology, 2017, 88(9-12): 2561-2571.

[26] Samarghandi H, Taabayan P, Behroozi M. A hybrid particle swarm optimization for the single-row facility layout problem[J]. Engineering Optimization, 2019, 51(1): 170-181.

[27] Samarghandi H, Taabayan P, Behroozi M. A hybrid particle swarm optimization for the single-row facility layout problem[J]. Engineering Optimization, 2019, 51(1): 170-181.

[28] Amaral A R S. Optimal solutions for the double row layout problem[J]. Optimization Letters, 2013, 7(2): 407-413.

[29] Amaral A R S. The corridor allocation problem[J]. Computers & Operations Research, 2012, 39(12): 3325-3330.

[30] Amaral A R S. On the exact solution of a facility layout problem[J]. European Journal of Operational Research, 2009, 173(2): 508-518.

[31] Anjos M F, Yen G. Provably near-optimal solutions for very large single-row facility layout problems[J]. Optimization Methods and Software, 2009, 24(4-5): 805-817.

[32] Hungerländer P, Rendl F. A computational study and survey of methods for the single-row facility layout problem[J]. Computational Optimization and Applications, 2013, 55(1): 1-20.

[33] Kothari R, Ghosh D. A scatter search algorithm for the single-row facility layout problem[J]. Journal of the Operational Research Society, 2014, 65(6): 947-963.

[34] Palubeckis G. Fast simulated annealing for single-row equidistant facility layout[J]. Applied Mathematics and Computation, 2015, 263: 287-301.

[35] Hosseini-Nasab H, Emami L. A hybrid imperialist competitive algorithm for the single-row facility layout problem[J]. The International Journal of Advanced Manufacturing Technology, 2017, 88(9-12): 2561-2571.

[36] Samarghandi H, Taabayan P, Behroozi M. A hybrid particle swarm optimization for the single-row facility layout problem[J]. Engineering Optimization, 2019, 51(1): 170-181.

[37] Murray C C, Smith A E, Zhang Z. An efficient local search heuristic for the double-row facility layout problem[J]. European Journal of Operational Research, 2013, 231(3): 775-785.

[38] Sahin R. A simulated annealing algorithm for the double-row facility layout problem[J]. Applied Mathematics and Computation, 2014, 243: 1-11.

[39] Guan C, Zhang Z, Liu S, et al. A multi-objective particle swarm optimization for multi-floor facility layout problem with fixed inner structure and rooms[J]. Soft Computing, 2020, 24(22): 17115-17135.

[40] Guan C, Zhang Z, Liu S, et al. Multi-objective multi-floor facility layout problem with fixed inner structure and rooms[J]. Computers & Industrial Engineering, 2021, 154: 107167.

[41] Wang K, Li X, Gao L. Modeling and optimization for multi-floor facility layout problem with fixed inner structure and rooms[J]. Expert Systems with Applications, 2019, 132: 1-15.

[42] Chung J, Tyner T. A new heuristic algorithm for the multi-row facility layout problem[J]. International Journal of Production Research, 2016, 54(13): 3911-3925.

[43] Saeedi S, Solimanpur M, Mahdavi I, et al. A multi-objective multi-row layout problem with stochastic demand: A revised simulated annealing algorithm[J]. International Journal of Computer Integrated Manufacturing, 2018, 31(10): 1022-1039.

[44] Solimanpur M, Saeedi S, Mahdavi I. Solving multi-row layout problem with unequal-sized facilities and input/output points using a particle swarm optimization algorithm[J]. International Journal of Production Research, 2019, 57(7): 2135-2158.

[45] Wang L, Wang X, Zhu H, et al. A multi-objective particle swarm optimization for multi-row facility layout problem with stochastic demand[J]. Soft Computing, 2021, 25(3): 2043-2061.

[46] Guan C, Zhang Z, Liu S, et al. A multi-objective particle swarm optimization for multi-floor facility layout problem with fixed inner structure and rooms[J]. Soft Computing, 2020, 24(22): 17115-17135.

[47] Anjos M F, Fischer A, Hungerländer P. New exact approaches to row layout problems[C]// International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming. Springer, Berlin, Heidelberg, 2012: 1-12.

[48] Amaral A R S. Optimal solutions for the double row layout problem[J]. Optimization Letters, 2013, 7(2): 407-413.

[49] Amaral A R S. On the exact solution of a facility layout problem[J]. European Journal of Operational Research, 2009, 173(2): 508-518.

[50] Hungerländer P, Rendl F. A computational study and survey of methods for the single-row facility layout problem[J]. Computational Optimization and Applications, 2013, 55(1): 1-20.

[51] Anjos M F, Yen G. Provably near-optimal solutions for very large single-row facility layout problems[J]. Optimization Methods and Software, 2009, 24(4-5): 805-817.

[52] Kothari R, Ghosh D. A scatter search algorithm for the single-row facility layout problem[J]. Journal of the Operational Research Society, 2014, 65(6): 947-963.

[53] Palubeckis G. Fast simulated annealing for single-row equidistant facility layout[J]. Applied Mathematics and Computation, 2015, 263: 287-301.

[54] Hosseini-Nasab H, Emami L. A hybrid imperialist competitive algorithm for the single-row facility layout problem[J]. The International Journal of Advanced Manufacturing Technology, 2017, 88(9-12): 2561-2571.

[55] Samarghandi H, Taabayan P, Behroozi M. A hybrid particle swarm optimization for the single-row facility layout problem[J]. Engineering Optimization, 2019, 51(1): 170-181.

[56] Murray C C, Smith A E, Zhang Z. An efficient local search heuristic for the double-row facility layout problem[J]. European Journal of Operational Research, 2013, 231(3): 775-785.

[57] Solimanpur M, Saeedi S, Mahdavi I. Solving multi-row layout problem with unequal-sized facilities and input/output points using a particle swarm optimization algorithm[J]. International Journal of Production Research, 2019, 57(7): 2135-2158.

[58] Saeedi S, Solimanpur M, Mahdavi I, et al. A multi-objective multi-row layout problem with stochastic demand: A revised simulated annealing algorithm[J]. International Journal of Computer Integrated Manufacturing, 2018, 31(10): 1022-1039.

[59] Wang L, Wang X, Zhu H,et al.A multi-objective particle swarm optimization for multi-row facility layout problem with stochastic demand[J]. Soft Computing, 2021, 25(3): 2043-2061.

[60] Guan C, Zhang Z, Liu S, et al. A multi-objective particle swarm optimization for multi-floor facility layout problem with fixed inner structure and rooms[J]. Soft Computing, 2020, 24(22): 17115-17135.

[61] Mirzaei A H, Rahimi-Vahed A R, Ghodsi R. A multi-objective particle swarm optimization for a mixed-model assembly line sequencing problem[J]. The International Journal of Advanced Manufacturing Technology, 2011, 53(5-8): 741-753.

[62] Najafi A A, Niaki S T A, Shahsavar M. A parameter-tuned genetic algorithm for multi-response optimization: A case study in a plastic injection molding process[J]. The International Journal of Advanced Manufacturing Technology, 2009, 41(5-6): 576-588.

[63] Tavakkoli-Moghaddam R, Saremi A R, Ziaee M S. A memetic algorithm for a bi-objective single-machine scheduling problem with sequence-dependent setup times[J]. The International Journal of Advanced Manufacturing Technology, 2008, 38(9-10): 1006-1018.