{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:40:06Z","timestamp":1654119606288},"reference-count":24,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>This paper introduces a new path relinking algorithm for the well-known quadratic assignment problem (QAP) in combinatorial optimization. The QAP has attracted considerable attention in research because of its complexity and its applicability to many domains. The algorithm presented in this study employs path relinking as a solution combination method incorporating a multistart tabu search algorithm as an improvement method. The resulting algorithm has interesting similarities and contrasts with particle swarm optimization methods. Computational testing indicates that this algorithm produces results that rival the best QAP algorithms. The authors additionally conduct an analysis disclosing how different strategies prove more or less effective depending on the landscapes of the problems to which they are applied. This analysis lays a foundation for developing more effective future QAP algorithms, both for methods based on path relinking and tabu search, and for hybrids of such methods with related processes found in particle swarm optimization.<\/p>","DOI":"10.4018\/jsir.2011040104","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T16:51:03Z","timestamp":1319043063000},"page":"52-70","source":"Crossref","is-referenced-by-count":0,"title":["Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem"],"prefix":"10.4018","volume":"2","author":[{"given":"Tabitha","family":"James","sequence":"first","affiliation":[{"name":"Virginia Tech, USA"}]},{"given":"Cesar","family":"Rego","sequence":"additional","affiliation":[{"name":"University of Mississippi, USA"}]}],"member":"2432","reference":[{"key":"jsir.2011040104-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00067-2"},{"key":"jsir.2011040104-1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"jsir.2011040104-2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90231-5"},{"key":"jsir.2011040104-3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","author":"E.Cela","year":"1998","journal-title":"The quadratic assignment problem: Theory and algorithms"},{"key":"jsir.2011040104-4","unstructured":"Cung, V.-D., Mautor, T., Michelon, P., & Tavares, A. (1996). Scatter search for the quadratic assignment problem. In Proceedings of the IEEE International Conference on Evolutionary Computation (pp. 165-169)."},{"key":"jsir.2011040104-5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.320.16076"},{"key":"jsir.2011040104-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00438-7"},{"key":"jsir.2011040104-7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","article-title":"Genetic hybrids for the quadratic assignment problem","volume":"Vol. 16","author":"C.Fleurent","year":"1994","journal-title":"Quadratic assignment and related problems (DIMACS series in discrete mathematics and theoretical computer science)"},{"key":"jsir.2011040104-8","doi-asserted-by":"crossref","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao, E. Lutton, E. M. A. Ronald, M. Schoenauer, & D. Snyers (Eds.), Proceedings of the International Conference on Artificial Evolution (LNCS 1363, pp. 3-54).","DOI":"10.1007\/BFb0026589"},{"key":"jsir.2011040104-9","doi-asserted-by":"crossref","unstructured":"Hussin, M. S., & Stutzle, T. (2009). Hierarchical iterated local search for the quadratic assignment problem. In Proceedings of the 6th International Workshop on Hybrid Metaheuristics (pp. 115-129).","DOI":"10.1007\/978-3-642-04918-7_9"},{"key":"jsir.2011040104-10","doi-asserted-by":"crossref","unstructured":"Iordache, S. (2010). Consultant-guided search algorithms for the quadratic assignment problem. In Proceedings of the 7th International Conference on Hybrid Metaheuristics (pp. 148-159).","DOI":"10.1007\/978-3-642-16054-7_11"},{"key":"jsir.2011040104-11","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2005.74"},{"key":"jsir.2011040104-12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2014556"},{"key":"jsir.2011040104-13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","article-title":"A greedy randomized adaptive search procedure for the quadratic assignment problem","volume":"Vol. 16","author":"Y.Li","year":"1994","journal-title":"Quadratic assignment and related problems (DIMACS series on discrete mathematics and theoretical computer science)"},{"key":"jsir.2011040104-14","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"jsir.2011040104-15","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-7051(03)00027-3"},{"key":"jsir.2011040104-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2004.03.001"},{"key":"jsir.2011040104-17","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-4562-x"},{"key":"jsir.2011040104-18","doi-asserted-by":"crossref","unstructured":"Oliveira, C. A., Pardalos, P. M., & Resende, M. G. C. (2004). GRASP with path-relinking for the quadratic assignment problem. In C. C. Ribeiro & S. L. Martins (Eds.), Proceedings of the Third International Conference on Experimental and Efficient Algorithms (LNCS 3059, pp. 356-368).","DOI":"10.1007\/978-3-540-24838-5_27"},{"key":"jsir.2011040104-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2008.03.022"},{"key":"jsir.2011040104-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.066"},{"key":"jsir.2011040104-21","first-page":"33","article-title":"ACO algorithms for the quadratic assignment problem","author":"T.St[UNKNOWN ENTITY &udie;]tzle","year":"1999","journal-title":"New ideas for optimization"},{"key":"jsir.2011040104-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"jsir.2011040104-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3069-9"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:06:51Z","timestamp":1654117611000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jsir.2011040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jsir.2011040104","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}