{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:50:39Z","timestamp":1767084639985},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319410081"},{"type":"electronic","value":"9783319410098"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41009-8_7","type":"book-chapter","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:49:28Z","timestamp":1465865368000},"page":"59-75","source":"Crossref","is-referenced-by-count":2,"title":["A Comparative Analysis of Genetic Algorithms and QAP Formulation for Facility Layout Problem: An Application in a Real Context"],"prefix":"10.1007","author":[{"given":"Fabricio","family":"Niebles","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Escobar","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Agudelo","sequence":"additional","affiliation":[]},{"given":"Genett","family":"Jimenez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Niebles-Atencio, F., Solano-Charris, E.L., Montoya-Torres, J.R.: Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems. In: Proceedings 2012 XXXVIII Conferencia Latinoamericana en Inform\u00e1tica (CLEI 2012), Medellin, Colombia, pp. 1\u201310, 1\u20135 October 2012. doi: 10.1109\/CLEI.2012.6427154","DOI":"10.1109\/CLEI.2012.6427154"},{"issue":"2","key":"7_CR2","first-page":"157","volume":"84","author":"F Niebles-Atencio","year":"2016","unstructured":"Niebles-Atencio, F., Dionicio, N.R.: A Sule\u2019s method initiated genetic algorithm for solving QAP formulation in facility layout design: a real world application. J. Theor. Appl. Inf. Technol. 84(2), 157\u2013169 (2016)","journal-title":"J. Theor. Appl. Inf. Technol."},{"key":"7_CR3","unstructured":"Eldrandaly, K.A., Nawara, G.M., Shouman, M.A., Reyad, A.H.: Facility layout problem and intelligent techniques: a survey. In: 7th International Conference on Production Engineering, Design and Control, PEDAC, Alex, Egypt, pp. 409\u2013422 (2001)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Sule, D.: Logistics of facility location and allocation (2001)","DOI":"10.1201\/9780203910405"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T Koopmans","year":"1957","unstructured":"Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0278-6125(96)84198-7","volume":"15","author":"RD Meller","year":"1996","unstructured":"Meller, R.D., Gau, K.Y.: The facility layout problem: recent and emerging trends and perspectives. J. Manufact. Syst. 15, 351\u2013366 (1996)","journal-title":"J. Manufact. Syst."},{"issue":"17","key":"7_CR7","doi-asserted-by":"crossref","first-page":"4369","DOI":"10.1080\/00207540050205154","volume":"38","author":"F Azadivar","year":"2000","unstructured":"Azadivar, F., Wang, J.: Facility layout optimization using simulation and genetic algorithms. Int. J. Prod. Res. 38(17), 4369\u20134383 (2000)","journal-title":"Int. J. Prod. Res."},{"key":"7_CR8","unstructured":"Coello, C.A.C., Lamont, G.B., van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-objective Problems, 2nd edn., pp. 145\u2013156 (2007)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.2298\/YJOR1102225K","volume":"21","author":"J Kratica","year":"2011","unstructured":"Kratica, J., To\u0161i\u0107, D., Filipovi\u0107, V., Dugo\u0161ija, \u0110.A.: New genetic representation for quadratic assignment problem. Yugoslav J. Oper. Res. 21(2), 225\u2013238 (2011). doi: 10.2298\/YJOR1102225K","journal-title":"Yugoslav J. Oper. Res."},{"issue":"5\u20136","key":"7_CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00170-005-0087-9","volume":"30","author":"SP Singh","year":"2006","unstructured":"Singh, S.P., Sharma, R.R.K.: A review of different approaches to the facility layout problems. Int. J. Adv. Manufact. Technol. 30(5\u20136), 425\u2013433 (2006)","journal-title":"Int. J. Adv. Manufact. Technol."},{"issue":"2","key":"7_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.arcontrol.2007.04.001","volume":"31","author":"A Drira","year":"2007","unstructured":"Drira, A., Pierreval, H., Hajri-Gabouj, S.: Facility layout problems: a survey. Ann. Rev. Control 31(2), 255\u2013267 (2007)","journal-title":"Ann. Rev. Control"},{"key":"7_CR12","first-page":"241","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., \u00c7ela, E., Pardalos, P.M., Pitsoulis, L.: The quadratic assignment problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 241\u2013337. Kluwer, Dordrecht (1998)"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176, 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-1-4757-3155-2_8","volume-title":"Nonlinear Assignment Problems","author":"S Vo\u00df","year":"2000","unstructured":"Vo\u00df, S.: Heuristics for nonlinear assignment problems. In: Pardalos, P.M., Pitsoulis, L. (eds.) Nonlinear Assignment Problems, pp. 175\u2013215. Kluwer, Boston (2000). Armour and Buffa"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.engappai.2016.02.004","volume":"52","author":"T Dakeroglu","year":"2016","unstructured":"Dakeroglu, T., Cosar, A.: A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Eng. Appl. Artif. Intell. 52, 10\u201325 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern.\u2013\u2013Part B 26, 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern.\u2013\u2013Part B"},{"key":"7_CR17","volume-title":"New Ideas in Optimization","author":"T Stutzle","year":"1999","unstructured":"Stutzle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization. McGraw-Hill Ltd., Maidenhead (1999)"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/72.265961","volume":"5","author":"V Nissen","year":"1994","unstructured":"Nissen, V.: Solving the quadratic assignment problem with clues from nature. IEEE Trans. Neural. Netw. 5, 66\u201372 (1994). Drezner 2003","journal-title":"IEEE Trans. Neural. Netw."},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4, 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.knosys.2004.03.001","volume":"17","author":"A Misevicius","year":"2004","unstructured":"Misevicius, A.: An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl. Based Syst. 17, 65\u201373 (2004)","journal-title":"Knowl. Based Syst."},{"key":"7_CR21","first-page":"190","volume":"16","author":"C Fleurent","year":"1994","unstructured":"Fleurent, C., Ferland, J.: Genetic hybrids for the quadratic assignment problem. DIMACS Ser. Math. Theor. Comput. Sci. 16, 190\u2013206 (1994)","journal-title":"DIMACS Ser. Math. Theor. Comput. Sci."},{"issue":"1","key":"7_CR22","first-page":"78","volume":"22","author":"DM Tate","year":"1995","unstructured":"Tate, D.M., Smith, A.E.: A genetic approach to the quadratic assignment problem. Comput. Oper. Res. 22(1), 78\u201383 (1995)","journal-title":"Comput. Oper. Res."},{"key":"7_CR23","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"KR Ahuja","year":"2000","unstructured":"Ahuja, K.R., Orlin, J.B., Tiwari, A.: A greedy algorithm for the quadratic assignment problem. Comput. Oper. Res. 27, 917\u2013934 (2000)","journal-title":"Comput. Oper. Res."},{"key":"7_CR24","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1145\/1068009.1068175","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference\u2014GECCO 2005","author":"JF McLoughlin III","year":"2005","unstructured":"McLoughlin III, J.F., Cede\u00f1o, W.: The enhanced evolutionary tabu search and its application to the quadratic assignment problem. In: Beyer, H.-G., O\u2019Reilly, U.-M. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference\u2014GECCO 2005, pp. 975\u2013982. ACM Press, New York (2005)"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10589-005-3069-9","volume":"34","author":"L Tseng","year":"2005","unstructured":"Tseng, L., Liang, S.: A hybrid metaheuristic for the quadratic assignment problem. Comput. Optim. Appl. 34, 85\u2013113 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"7_CR26","first-page":"599","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference-GECCO 2006","author":"Y-L Xu","year":"2006","unstructured":"Xu, Y.-L., Lim, M.H., Ong, Y.S., Tang, J.: A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem. In: Metal, K. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference-GECCO 2006, vol. 1, pp. 599\u2013605. ACM Press, New York (2006)"},{"key":"7_CR27","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174, 1519\u20131539 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0377-2217(94)00350-5","volume":"92","author":"A B\u00f6lte","year":"1996","unstructured":"B\u00f6lte, A., Thonemann, U.W.: Optimizing simulated annealing schedules with genetic programming. Eur. J. Oper. Res. 92, 402\u2013416 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"MR Wilhelm","year":"1987","unstructured":"Wilhelm, M.R., Ward, T.L.: Solving quadratic assignment problems by simulated annealing. IIE Trans. 19, 107\u2013119 (1987)","journal-title":"IIE Trans."},{"key":"7_CR30","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. Comput. 6, 126\u2013140 (1994)","journal-title":"ORSA J. Comput."},{"key":"7_CR31","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/S0377-2217(03)00438-7","volume":"160","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z.: The extended concentric tabu for the quadratic assignment problem. Eur. J. Oper. Res. 160, 416\u2013422 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR32","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"RC JamesT","year":"2009","unstructured":"JamesT, R.C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195, 810\u2013826 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR33","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A Misevicius","year":"2005","unstructured":"Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Comput. Optim. Appl. 30, 95\u2013111 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Hernandez, H., Montoya, J.R., Niebles, F.: Design of multi-product\/multi-period closed-loop reverse logistics network using a genetic algorithm. In: Proceedings 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Orlando, USA (2014)","DOI":"10.1109\/CIPLS.2014.7007159"},{"key":"7_CR35","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"2008","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments. Wiley, Hoboken (2008)"},{"key":"7_CR36","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1023\/A:1015454612213","volume":"8","author":"E Angel","year":"2002","unstructured":"Angel, E., Zissimopoulos, V.: On the hard ness of the quadratic assignment problem with metaheuristics. J. Heuristics 8, 399\u2013414 (2002)","journal-title":"J. Heuristics"},{"key":"7_CR37","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"LM Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problems. J. Oper. Res. Soc. 50, 167\u2013176 (1999)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR38","unstructured":"Maniezzo, V., Dorigo, M., Colorini, A.: The ant system applied to the quadratic assignment problem. Technical report IRIDIA\/94-28. Universite Libre de Bruxelles, Belgium (1994)"},{"key":"7_CR39","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"ED Taillard","year":"1991","unstructured":"Taillard, E.D.: Robust taboo search for the QAP. Parallel Comput. 17, 443\u2013455 (1991)","journal-title":"Parallel Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41009-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T14:10:51Z","timestamp":1568038251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41009-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319410081","9783319410098"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41009-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}