Using pareto-optimality for solving multi-objective unequal area facility layout problem

ABSTRACT

A lot of optimal and heuristic algorithms for solving facility layout problem (FLP) have been developed in the past few decades. The majority of these approaches adopt a problem formulation known as the quadratic assignment problem (QAP) that is particularly suitable for equal area facilities. Unequal area FLP comprises a class of extremely difficult and widely applicable optimization problems arising in many diverse areas to meet the requirements for real-world applications. Unfortunately, most of these approaches are based on a single objective. While, the real-world FLPs are multi-objective by nature. Only very recently have meta-heuristics been designed and used in multi-objective FLP. They most often use the weighted sum method to combine the different objectives and thus, inherit the well-known problems of this method. As of now, there is no formal approach published for the unequal area multi-objective FLP to consider several objectives simultaneously. This paper presents an evolutionary approach for solving multi-objective unequal area FLP using multi-objective genetic algorithm that presents the layout as a set of Pareto-optimal solutions optimizing multiple objectives simultaneously. The experimental results show that the proposed approach performs well in dealing with multi-objective unequal area FLPs which better reflects the real-world scenario.

References

1. Arikaran, P., Jayabalan, V., and Senthilkumar, R. 2010. Analysis of unequal areas facility layout problems. Int. J. Eng. 4, 1, 44--51.
2. Armour, G. C., and Buffa, E. S. 1963. A heuristic algorithm and simulation approach to relative location of facilities. Manage. Sci. 9, 2, 294--309.
3. Balamurugan, K., Selladuari, V., and Ilamathi, B. 2006. Solving unequal area facility layout problems using genetic algorithm. Int. J. Log. Sys. Manage. 2, 3, 281--301.
4. Castillo, I., Westerlund, J., Emet, S., and Westerlund, T. 2005. Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54--69.
5. Deb, K. 2001. Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester.
6. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T. Evolut. Comput. 6, 2, 182--197.
7. Drira, A., Pierreval, H., and Hajri-Gabouj, S. 2007. Facility layout problem: A survey. Annu. Rev. Control. 31, 255--267.
8. Heng, L., and Love, P. E. D. 2000. Genetic search for solving construction site-level unequal-area facility layout problems. Automat. Constr. 9, 2, 217--226.
9. Heragu, S. S. 1997. Facilities Design. BWS, Boston.
10. Hu, M. H., and Wang, M. --J. 2004. Using genetic algorithms on facilities layout problems. Int. J. Adv Manuf. Tech. 23, 301--310.
11. Islier, A. A. 1998. A genetic algorithm approach for multiple criteria facility layout design. Int. J. Prod. Res. 36, 1549--1569.
12. Komarudin, K. Y. W. 2010. Applying ant system for solving unequal area facility layout problems. Eur. J. Oper. Res. 202, 730--746.
13. Lacksonen, T. A. 1994. Static and dynamic layout problems with varying areas. J. Oper. Res. Soc. 45, 1, 59--69.
14. Liu, Q., and Meller, R. D. 2007. A sequence-pair representation and MIP model based heuristic for the facility layout problem with rectangular departments. IIE Trans. 39, 4, 377--394.
15. Nordin, N. N., Zainuddin, Z. M., Salim, S., and Ponnusamy, R. R. 2009. Mathematical modeling and hybrid heuristic for unequal size facility layout problem. J. Fund. Sci. 5, 79--87.
16. Pareto Efficiency, http://en.wikipedia.org/wiki/Pareto_efficiency
17. Ripon, K. S. N., Glette, K., Høvin, M., and Tørresen, J. 2010. A genetic algorithm to find pareto-optimal solutions for the dynamic facility layout problem with multiple objectives. In Wong, K.W. et al. (eds.). Neural Information Processing. Theory and Algorithms, Lecture Notes in Computer Science (LNCS). 6443, 642--651, (Nov. 2010). Springer Berlin/Heidelberg.
18. Ripon, K. S. N., Glette, K., Høvin, M., and Tørresen, J. 2010. An adaptive local search based genetic algorithm for solving multi-objective facility layout problem. In Wong, K.W. et al. (eds.). Neural Information Processing. Theory and Algorithms, Lecture Notes in Computer Science (LNCS). 6443, 540--550, (Nov. 2010). Springer Berlin/Heidelberg.
19. Ripon, K. S. N., Glette, K., Mirmotahari, O., Høvin, M., and Tørresen, J. 2009. Pareto optimal based evolutionary approach for solving multi-objective facility layout problem. In Leung, C. S., Lee, M., and Chan, J. H. (eds.). Neural Information Processing, Lecture Notes in Computer Science (LNCS). 5864, 159--168, (Dec. 2009). Springer Berlin/Heidelberg.
20. Scholz, D., Petrick, A., and Domschke, W. 2009. STaTS: A slicing tree and tabu search based heuristic for the unequal area facility layout problem. Eur. J. Oper. Res. 197, 1, 166--178.
21. Singh, S. P., and Sharma, R. R. K. 2006. A review of different approaches to the facility layout problems. Int. J. Adv. Manuf. Tech. 30, 425--433.
22. Singh, S. P., and Singh, V. K. 2010. An improved heuristic approach for multi-objective facility layout problem. Int. J. Prod. Res. 48, 4, 1171--1194.
23. Tam, K. Y., and Li, S. G. 1991. A Hierarchical Approach to the Facility Layout Problem. Int. J. Prod. Res. 29, 1, 165--184.
24. Tate, D. M., and Smith A. E. 1995. Unequal-area facility layout by genetic search. IIE Trans. 27, (April. 1994), 465--472.
25. Tompkins, A. 2003. Facilities Planning. 3rd Ed. John Wiley & Sons, New York.
26. Wang, M. --J., Hu, M. H., and Ku, M. --Y. 2005. A solution to the unequal area facilities layout problem by genetic algorithm. Comput. Ind. 56, 207--220.

Index Terms

• Computing methodologies

  • Artificial intelligence

    • Search methodologies

      • Heuristic function construction