Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology – ISAT 2015 – Part I pp 159-169 | Cite as
Experimental Examination of Facilities Layout Problems in Logistics Systems Including Objects with Diverse Sizes and Shapes
Abstract
This study demonstrates a simulation experiment results regarding a flexible approach to solving facilities layout problem on a regular grid. In this paper approach we model objects with different dimensions and various shapes. We have implemented our version of the simulated annealing algorithm [5] and analyzed how the number of cycles (100, 200, 300), objects types (uniform, diverse) affect average goal function values, mean concentration degrees, and the number of disintegrated objects. The formal statistical analysis was conducted separately for two sizes of regular grids, i.e. 6 × 6 and 10 × 10. The outcomes generally showed a significant influence of the studied effects on the analyzed dependent variables.
Keywords
Logistics Facilities layout problem Simulated annealing Flexible approach Simulation experimentNotes
Acknowledgments
The work was partially financially supported by the Polish National Science Center grant no. 2011/03/B/HS4/04532.
References
- 1.Armour, G.C., Buffa, E.S.: A heuristic algorithm and simulation approach to relative location of facilities. Manage. Sci. 9(2), 294–309 (1963). doi: 10.1287/mnsc.9.2.294 CrossRefGoogle Scholar
- 2.Bazaraa, M.S.: Computerized layout design: a branch and bound approach. AIIE Trans. 7(4), 432–438 (1975). doi: 10.1080/05695557508975028 CrossRefMathSciNetGoogle Scholar
- 3.Buffa, E.S., Armour, G.C., Vollmann, T.E.: Allocating facilities with CRAFT. Harvard Bus. Rev. 42(2), 136–158 (1964)Google Scholar
- 4.Kim, J.-Y., Kim, Y.-D.: Graph theoretic heuristics for unequal-sized facility layout problems. Omega 23(4), 391–401 (1995). doi: 10.1016/0305-0483(95)00016-H CrossRefGoogle Scholar
- 5.Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983). doi: 10.1126/science.220.4598.671 CrossRefMathSciNetMATHGoogle Scholar
- 6.Kulturel-Konak, S., Konak, A.: A large-scale hybrid simulated annealing algorithm for cyclic facility layout problems. Eng. Optim. 47(7), 963–978 (2015). doi: 10.1080/0305215X.2014.933825 CrossRefMathSciNetGoogle Scholar
- 7.Kusiak, A., Heragu, S.S.: The facility layout problem. Eur. J. Oper. Res. 29(3), 229–251 (1987). doi: 10.1016/0377-2217(87)90238-4 CrossRefMathSciNetMATHGoogle Scholar
- 8.Liu, X., Sun, X.: A multi-improved genetic algorithm for facility layout optimisation based on slicing tree. Int. J. Prod. Res. 50(18), 5173–5180 (2012). doi: 10.1080/00207543.2011.654011 CrossRefGoogle Scholar
- 9.Meller, R.D., Bozer, Y.A.: A new simulated annealing algorithm for the facility layout problem. Int. J. Prod. Res. 34(6), 1675–1692 (1996). doi: 10.1080/00207549608904990 CrossRefMATHGoogle Scholar
- 10.Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555–565 (1976). doi: 10.1145/321958.321975 CrossRefMathSciNetMATHGoogle Scholar
- 11.Singh, S.P., Sharma, R.R.K.: A review of different approaches to the facility layout problems. Int. J. Adv. Manuf. Technol. 30(5–6), 425–433 (2006). doi: 10.1007/s00170-005-0087-9 CrossRefGoogle Scholar
- 12.Tam, K.Y.: A simulated annealing algorithm for allocating space to manufacturing cells. Int. J. Prod. Res. 30(1), 63–87 (1992). doi: 10.1080/00207549208942878 CrossRefMATHGoogle Scholar
- 13.Tate, D.M., Smith, A.E.: Unequal-area facility layout by genetic search. IIE Trans. 27(4), 465–472 (1995). doi: 10.1080/07408179508936763 CrossRefGoogle Scholar
- 14.Tong, X.: SECOT: a sequential construction technique for facility design. Unpublished Doctoral Dissertation, Department of Industrial Engineering, University of Pittsburgh (1991)Google Scholar