An efficient algorithm for unequal area facilities layout planning with input and output points

References

• Ahuja RK, Orlin JB, Tiwari A. 2000. A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res. 27(10):917–934.
   Web of Science ®Google Scholar
• Alizon F, Dallery Y, Feillet D, Michelon P. 2007. Solution of a facility layout problem in a final assembly workshop using constraint programming. Inf Syst Oper Res. 45(2):65–73.
   Web of Science ®Google Scholar
• Allahyari MZ, Azab A. 2015. A novel Bi-level continuous formulation for the cellular manufacturing system facility layout problem. Procedia CIRP. 33:87–92.
   Google Scholar
• Armour GC, Buffa ES. 1963. A heuristic algorithm and simulation approach to relative location of facilities. Manag Sci. 9(2):294–309.
   Web of Science ®Google Scholar
• Asl AD, Wong KY. 2015. Solving unequal area static facility layout problems by using a modified genetic algorithm. Proceedings of the 10th IEEE Conference on Industrial Electronics and Applications (ICIEA); 2015 Jun 15–17; Auckland: IEEE. p. 302–305.
   Google Scholar
• Asl AD, Wong KY. 2017. Solving unequal-area static and dynamic facility layout problems using modified particle swarm optimization. J Intell Manuf. 28(6):1317–1336.
   Web of Science ®Google Scholar
• Barbosa-Povoa AP, Mateus R, Novais AQ. 2001. Optimal two-dimensional layout of industrial facilities. Int J Prod Res. 39(12):2567–2593.
   Web of Science ®Google Scholar
• Benjaafar S. 2002. Modeling and analysis of congestion in the design of facility layouts. Manag Sci. 48(5):679–704.
   Web of Science ®Google Scholar
• Bent D. 1972. Branch-and-bound for facility location. Inf Syst Oper Res. 10(1):1–7.
   Google Scholar
• Chae J, Regan AC. 2016. Layout design problems with heterogeneous area constraints. Comput Ind Eng. 102:198–207.
   Web of Science ®Google Scholar
• Christofides N, Benavent E. 1989. An exact algorithm for the quadratic assignment problem on a tree. Oper Res. 37(5):760–768.
   Web of Science ®Google Scholar
• Chwif L, Barretto MRP, Moscato LA. 1998. A solution to the facility layout problem using simulated annealing. Comput Ind. 36(1):125–132.
   Web of Science ®Google Scholar
• Das SK. 1993. A facility layout method for flexible manufacturing systems∗. Int J Prod Res. 31(2):279–297.
   Web of Science ®Google Scholar
• Dunker T, Radons G, Westkämper E. 2003. A coevolutionary algorithm for a facility layout problem. Int J Prod Res. 41(15):3479–3500.
   Web of Science ®Google Scholar
• Gonçalves JF, Resende MGC. 2015. A biased random-key genetic algorithm for the unequal area facility layout problem. Eur J Oper Res. 246(1):86–107.
   Web of Science ®Google Scholar
• Hasda RK, Bhattacharjya RK, Bennis F. 2017. Modified genetic algorithms for solving facility layout problems. Int J Interact Des Manuf. 11(3):713–725.
   Web of Science ®Google Scholar
• Heragu SS. 2008. Facilities design. Boca Raton (FL): CRC Press.
   Google Scholar
• Hu GH, Chen YP, Zhou ZD, Fang HC. 2007. A genetic algorithm for the inter-cell layout and material handling system design. Int J Adv Manuf Technol. 34(11):1153–1163.
   Web of Science ®Google Scholar
• Huchette J, Dey SS, Vielma JP. 2017. Strong mixed-integer formulations for the floor layout problem. Inf Syst Oper Res. [ accessed 2017 Jul 13]; [1–42 p]. http://dx.doi.org/10.1080/03155986.2017.1346916.
   Google Scholar
• Hungerländer P. 2014. Single-row equidistant facility layout as a special case of single-row facility layout. Int J Prod Res. 52(5):1257–1268.
   Web of Science ®Google Scholar
• Imam MH, Mir M. 1998. Cluster boundary search algorithm for building-block layout optimization. Adv Eng Softw. 29(2):165–173.
   Web of Science ®Google Scholar
• Kim J-G, Kim Y-D. 2000. Layout planning for facilities with fixed shapes and input and output points. Int J Prod Res. 38(18):4635–4653.
   Web of Science ®Google Scholar
• Kirkpatrick S, Gelatt CD, Vecchi MP. 1983. Optimization by simulated annealing. Science. 220(4598):671–680.
   PubMed Web of Science ®Google Scholar
• Klausnitzer A, Lasch R. 2016. Extended model formulation of the facility layout problem with aisle structure. Logistics Management. Cham: Springer.
   Google Scholar
• Koopmans TC, Beckmann M. 1957. Assignment problems and the location of economic activities. Econom J Econom Soc. 25(1):53–76.
   Web of Science ®Google Scholar
• Kusiak A, Heragu SS. 1987. The facility layout problem. Eur J Oper Res. 29(3):229–251.
   Web of Science ®Google Scholar
• Lee YH, Lee MH. 2002. A shape-based block layout approach to facility layout problems using hybrid genetic algorithm. Comput Ind Eng. 42(2):237–248.
   Web of Science ®Google Scholar
• Leno IJ, Sankar SS, Ponnambalam SG. 2016. An elitist strategy genetic algorithm using simulated annealing algorithm as local search for facility layout design. Int J Adv Manuf Technol. 84(5–8):787–799.
   Web of Science ®Google Scholar
• Leno IJ, Saravanasankar S, Ponnambalam SG. 2012. Layout design for efficient material flow path. Procedia Eng. 38:872–879.
   Google Scholar
• Liu Q, Meller RD. 2007. A sequence-pair representation and MIP-model-based heuristic for the facility layout problem with rectangular departments. IIE Trans. 39(4):377–394.
   Web of Science ®Google Scholar
• Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T. 2007. A survey for the quadratic assignment problem. Eur J Oper Res. 176(2):657–690.
   Web of Science ®Google Scholar
• Meller RD, Chen W, Sherali HD. 2007. Applying the sequence-pair representation to optimal facility layout designs. Oper Res Lett. 35(5):651–659.
   Web of Science ®Google Scholar
• Meller RD, Gau K-Y. 1996. The facility layout problem: recent and emerging trends and perspectives. J Manuf Syst. 15(5):351–366.
   Web of Science ®Google Scholar
• Meller RD, Narayanan V, Vance PH. 1998. Optimal facility layout design. Oper Res Lett. 23(3):117–127.
   Web of Science ®Google Scholar
• Mir M, Hassanin A, Al-Saleh MA. 2016. Identification of promising infant clusters to obtain improved block layout designs. World Acad Sci Eng Technol Int J Mech Aerosp Ind Mechatron Manuf Eng. 10(3):488–493.
   Google Scholar
• Mir M, Imam MH. 1996. Analytic annealing for macrocell placement optimization. Comput Electr Eng. 22(2):169–177.
   Web of Science ®Google Scholar
• Montreuil B. 1991. A modelling framework for integrating layout design and flow network design. Material handling'90. Heidelberg: Springer.
   Google Scholar
• Murata H, Fujiyoshi K, Nakatake S, Kajitani Y. 1995. Rectangle-packing-based module placement. Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design; 1995 Nov 5–9; San Jose (CA): IEEE Computer Society. p. 472–479.
   Google Scholar
• Nordin NN, Zainuddin ZM, Salim S, Ponnusamy RR. 2014. Mathematical modeling and hybrid heuristic for unequal size facility layout problem. Malaysian J Fundam Appl Sci. 5(1):87–89.
   Google Scholar
• Paes FG, Pessoa AA, Vidal T. 2017. A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem. Eur J Oper Res. 256(3):742–756.
   Web of Science ®Google Scholar
• Rajasekharan M, Peters BA, Yang T. 1998. A genetic algorithm for facility layout design in flexible manufacturing systems. Int J Prod Res. 36(1):95–110.
   Web of Science ®Google Scholar
• Sahni S, Gonzalez T. 1976. P-complete approximation problems. J ACM. 23(3):555–565.
   Web of Science ®Google Scholar
• Sherali HD, Fraticelli BMP, Meller RD. 2003. Enhanced model formulations for optimal facility layout. Oper Res. 51(4):629–644.
   Web of Science ®Google Scholar
• Smith M, Macleod R. 1988. A relaxed assignment algorithm for the quadratic assignment problem. Inf Syst Oper Res. 26(3):170–190.
   Web of Science ®Google Scholar
• Srinivasan A. 2014. Integrating block layout design and location of input and output points in facility layout problems [master's thesis]. Montreal: Concordia University.
   Google Scholar
• Suman B, Kumar P. 2006. A survey of simulated annealing as a tool for single and multiobjective optimization. J Oper Res Soc. 57(10):1143–1160.
   Web of Science ®Google Scholar
• Tam KY. 1992. A simulated annealing algorithm for allocating space to manufacturing cells. Int J Prod Res. 30(1):63–87.
   Web of Science ®Google Scholar
• Tam KY, Li SG. 1991. A hierarchical approach to the facility layout problem. Int J Prod Res. 29(1):165–184.
   Web of Science ®Google Scholar
• Tasadduq IA, Imam MH, Ahmad A. 2015. A hybrid algorithm for optimising facility layout. S Afr J Ind Eng. 26(1):120–134.
   Web of Science ®Google Scholar
• Tompkins JA, White JA, Bozer YA, Tanchoco JMA. 2010. Facilities planning. Hoboken (NJ): Wiley.
   Google Scholar
• Ulutas BH, Kulturel-Konak S. 2012. An artificial immune system based algorithm to solve unequal area facility layout problem. Expert Syst Appl. 39(5):5384–5395.
   Web of Science ®Google Scholar
• Weber TO, Noije WAMV. 2012. Multi-objective design of analog integrated circuits using simulated annealing with crossover operator and weight adjusting. J Integr Circuit Syst. 7(1):7–15.
   Google Scholar
• Welgama PS, Gibson PR. 1993. A construction algorithm for the machine layout problem with fixed pick-up and drop-off points. Int J Prod Res. 31(11):2575–2589.
   Web of Science ®Google Scholar
• Xiao Y, Seo Y, Seo M. 2013. A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points. Int J Prod Res. 51(14):4200–4222.
   Web of Science ®Google Scholar
• Xiao Y, Zheng Y, Zhang L, Kuo Y. 2016. A combined zone-LP and simulated annealing algorithm for unequal-area facility layout problem. Adv Prod Eng Manag. 11(4):259–270.
   Web of Science ®Google Scholar