Zoning constrained machine layout problem with mutual clearances

Document Type : Research Article

Authors

Department of Industrial Engineering, Sakarya University, Sakarya, Turkey.

Abstract

In this paper, a single row machine layout problem is considered with zoning constraints and mutual clearances under an enhanced objective of minimizing material flow cost and machine installation cost. The problem is restricted by positive and negative zoning constraints to represent real-life problems. Moreover, the clearances needed between machine pairs are divided into two types, which are must and extra clearances. Extra clearances are reduced through mutual use between adjacent machines to decrease material flow costs. Objective function also considers fixed costs of locating machines which usually neglected in machine layout problems in literature but a necessity in real-life problems. Two mathematical models, namely nonlinear and linear mixed integer programs, are formulated to solve the problem optimally and to compare the effect of linearity and nonlinearity in mathematical programming formulations in terms of solution quality and time. The mathematical models are not effective in terms of time for large problem instances; therefore, a genetic algorithm is proposed to generate high-quality solutions within a reasonable time. It is shown that the genetic algorithm outperforms both the nonlinear and linear mathematical models with lower cost and shorter time.

Keywords

Main Subjects


References
1. Singh, N. and Rajamani, D. Cellular Manufacturing Systems, Design, Planning and Control, London: Chapman & Hall (1996). https://doi.org/10.1007/978-1-4613-1187-4
2. Braglia, M. “Optimisation of a simulated-annealing-based heuristic for single row machine layout problem by genetic algorithm”, International Transactions in Operational Research, 3(1), pp. 37-49 (1996). https://doi.org/10.1111/j.1475-3995.1996.tb00034.x
3. Braglia, M. “Heuristics for single-row layout problems in flexible manufacturing systems”, Production Planning & Control: The Management of Operations, 8(6), pp. 558-567 (1997). https://doi.org/10.1080/095372897234894
4. Ramkumar, A.S. and Ponnambalam, S.G. “Design of single-row layouts for Flexible Manufacturing Systems using genetic algorithm and simulated annealing Algorithm”, Proceedings of the 2004 IEEE Conference on Cybernetics and Intelligent Systems, Singapore (2004). https://doi.org/10.1109/ICCIS.2004.1460751
5. Ficko, M., Brezocnik, M., and Balic J. “Designing the layout of single- and multiple-rows flexible manufacturing system by genetic algorithms”, Journal of Materials Processing Technology, 157-158, pp. 150-158 (2004). https://doi.org/10.1016/j.jmatprotec.2004.09.012
6. Solimanpur, M., Vrat P., and Shankar R. “An ant algorithm for the single row layout problem in flexible manufacturing systems”, Computers and Operations Research, 32, pp. 583-598 (2005). https://doi.org/10.1016/j.cor.2003.08.005
7. Ozcelik, F. “A hybrid genetic algorithm for the single row layout problem”, International Journal of Production Research, 50(20), pp. 5872-5886 (2012). https://doi.org/10.1080/00207543.2011.636386
8. Jahromi, M.H.M.A., Tavakkoli-Moghaddam, R., Makui A., et al. “A novel mathematical model for a scheduling problem of dynamic machine-tool selection and operation allocation in a flexible manufacturing system: A modified evolutionary algorithm”, Scientia Iranica, E, 24(2), pp. 765-777 (2017). https://doi.org/10.24200/sci.2017.4060
9. Tubaileh, A. and Siam, J. “Single and multi-row layout design for flexible manufacturing systems”, International Journal of Computer Integrated Manufacturing, 30(12), pp. 1316-1330 (2017). https://doi.org/10.1080/0951192X.2017.1314013
10. Rai, R.S. and Jayswal, S.C. “Design and optimization of loop layout in flexible manufacturing system using particle swarm optimization”, Int. J. Adv. Technol., 9(2), pp. 1-5 (2018). https://doi.org/10.4172/0976-4860.1000202
11. Aghajani-Delavar, N., Mehdizadeh, E., Tavakkoli-Moghaddam, R., et al. “A multi-objective vibration damping optimization algorithm for solving a cellular manufacturing system with manpower and tool allocation”, Scientia Iranica, E, 29(4), pp. 2041-2068 (2020). https://doi.org/10.24200/sci.2020.52419.2706
12. Yadav, A. and Jayswal, S.C. “Evaluation of batching and layout on the performance of flexible manufacturing system”, Int. J. Ad.v Manuf. Technol., 101, pp. 1435-1449 (2019). https://doi.org/10.1007/s00170-018-2999-1
13. Hafiz, Z.N., Tauseef, A., and Fahid, R. “Modelling, analysis and optimization of carousel-based flexible manufacturing system”, Journal of Industrial and Production Engineering, 39(6), pp. 479-493 (2022). https://doi.org/10.1080/21681015.2022.2031323
14. Ponnambalam, S.G. and Ramkumar, V.A “Genetic algorithm for the design of a single-row layout in automated manufacturing systems”, The International Journal of Advanced Manufacturing Technology, 18, pp. 512–519 (2001). https://doi.org/10.1007/s0017010180512
15. Lin M.T. “The single-row machine layout problem in apparel manufacturing by hierarchical order-based genetic algorithm”, International Journal of Clothing Science and Technology, 20(5), pp. 258-270 (2008). https://doi.org/10.1108/09556220810898872
16. Datta, D., Amaral, A.R.S., and Figueira, R. “Single row facility layout problem using a permutation-based genetic algorithm”, European Journal of Operational Research, 213, pp. 388-394 (2011). https://doi.org/10.1016/j.ejor.2011.03.034
17. Lenin, N., Kumar, M.S., Islam, M.N., et al. “Multi-objective optimization in single-row layout design using a genetic algorithm”, The International Journal of Advanced Manufacturing Technology, 67, pp. 1777-1790 (2013). https://doi.org/10.1007/s00170-012-4608-z
18. Kothari, R. and Ghosh, D. “An efficient genetic algorithm for single row facility layout”, Optim. Lett., 8, pp. 679-690 (2014). https://doi.org/10.1007/s11590-012-0605-2
19. Ghadirpour, M., Rahmani, D., and Moslemipour, G. “Routing flexibility for unequal–area stochastic dynamic facility layout problem in flexible manufacturing systems”, IJIEPR, 31(2), pp. 269-285 (2020). http://dx.doi.org/10.22068/ijiepr.31.2.269
20. Kouvelis, P., Chiang, W.C., and Fitzsimmons J. “Simulated annealing for machine layout problems in the presence of zoning constraints”, European Journal of Operational Research, 57, pp. 203-223 (1992). https://doi.org/10.1016/0377-2217(92)90043-9
21. Wang, T.Y., Lin, H.C., and Wu, K.B. “An improved simulated annealing for facility layout problems in cellular manufacturing systems”, Computers Ind. Engng, 34(2), pp. 309-319 (1998). https://doi.org/10.1016/S0360-8352(97)00318-5
22. Brunese, P.A. and Tanchoco, J.M.A. “On implied within-building constraints for machine layout”, International Journal of Production Research, 51(6), pp. 1937-1952 (2013). https://doi.org/10.1080/00207543.2012.721571
23. Kalita, Z. and Datta, D. “A constrained single row facility layout problem”, The International Journal of Advanced Manufacturing Technology, 98, pp. 2173-2184 (2018). https://doi.org/10.1007/s00170-018-2370-6
24. Li, S., Zhang, Z., Guan, C., et al. “An improved fireworks algorithm for the constrained single-row facility layout problem”, International Journal of Production Research, 59(8), pp. 2309-2327 (2021). https://doi.org/10.1080/00207543.2020.1730465
25. Yang, C.O. and Utamima, A. “Hybrid estimation of distribution algorithm for solving single row facility layout problem”, Computers & Industrial Engineering, 66, pp. 95-103 (2013). https://doi.org/10.1016/j.cie.2013.05.018
26. Maier, K. and Taferner, V. “Solving the constrained single-row facility layout problem with integer linear programming”, International Journal of Production Research, 61(6), pp. 1882-1897 (2022). https://doi.org/10.1080/00207543.2022.2051090
27. Kalita, Z. and Datta, D. “The constrained single-row facility layout problem with repairing mechanisms”, In Nature- Inspired Methods for Metaheuristics Optimization. Modeling and Optimization, in Science and Technologies, Bennis, F., Bhattacharjya, R. (Eds.) Springer International Publishing, Cham, 16, pp. 359-383 (2020). https://doi.org/10.1007/978-3-030-26458-1_20
28. Coppé, V., Gillard, X., and Schaus, P. “Solving the constrained single-row facility layout problem with decision diagrams”, 28th International Conference on Principles and Practice of Constraint Programming, 235, pp. 14-18 (2022). https://doi.org/10.4230/LIPIcs.CP.2022.14
29. Manzke, L., Keller, B., and Buscher, U. “An artificial bee colony algorithm to solve the single row layout problem with clearances”, International Conference on Information Systems Architecture and Technology-ISAT 2017, 657 (2018). https://doi.org/10.1007/978-3-319-67223-6_27
30. Safarzadeh, S. and Koosha, H. “Solving an extended multi-row facility layout problem with fuzzy clearances using GA”, Applied Soft Computing, 61, pp. 819-831 (2017). https://doi.org/10.1016/j.asoc.2017.09.003
31. Keller, B. “Construction heuristics for the single row layout problem with machine-spanning clearances”, INFOR: Information Systems and Operational Research, 57(1), pp. 32-55 (2019). https://doi.org/10.1080/03155986.2017.1393729
32. Yu, M., Zuo, X., and Murray, C.C. “A tabu search heuristic for the single row layout problem with shared clearances”, IEEE Congress on Evolutionary Computation (CEC), Beijing, China (2014). https://doi.org/10.1109/CEC.2014.6900353
33. Zuo, X.Q., Murray, C.C., and Smith, A.E. “Sharing clearances to improve machine layout”, International Journal of Production Research, 54(14), pp. 4272-4285 (2016). https://doi.org/10.1080/00207543.2016.1142134
34. Akbilek, N. “Safety-integrated single-row machine layout problem optimization using GA and TS with a novel heuristic rule support”, Soft Comput, 25, pp. 13533-13547 (2021). https://doi.org/10.1007/s00500-021-06031-6
35. Sule R.D. Manufacturing Facilities Location, Planning, and Design (3rd Ed.). CRC Press, Taylor & Francis Group 2008.
36. Goldberg, D.E. “Genetic algorithms in search, optimization, and machine learning”, Addison-Wesley, New Jersey, USA (1989). https://doi.org/10.1023/A:1022602019183
Volume 32, Issue 12
Transactions on Industrial Engineering
May and June 2025 Article ID:5453
  • Receive Date: 16 March 2021
  • Revise Date: 03 August 2022
  • Accept Date: 31 October 2022