{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T12:35:41Z","timestamp":1725971741595},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319781327"},{"type":"electronic","value":"9783319781334"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78133-4_10","type":"book-chapter","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T06:42:59Z","timestamp":1521441779000},"page":"129-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Hybrid Iterative Tabu Search for QAP Using Distance Cooperation"],"prefix":"10.1007","author":[{"given":"Omar","family":"Abdelkafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhassane","family":"Idoumghar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Lepagnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,20]]},"reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"crossref","first-page":"4800","DOI":"10.1016\/j.amc.2012.10.106","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.K.: Breakout local search for the quadratic assignement problem. Appl. Math. Comput. 219(9), 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.eswa.2014.08.011","volume":"42","author":"U Benlic","year":"2015","unstructured":"Benlic, U., Hao, J.K.: Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42, 584\u2013595 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"10_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.cor.2006.05.004","volume":"35","author":"Z Drezner","year":"2008","unstructured":"Drezner, Z.: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem. Comput. Oper. Res. 35(3), 717\u2013736 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P.M., Taillard, E.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139(1), 65\u201394 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.cor.2005.05.004","volume":"34","author":"E Duman","year":"2007","unstructured":"Duman, E., Or, I.: The quadratic assignement problem in the context of the printed circuit board assembly process. Comput. Oper. Res. 34(1), 163\u2013179 (2007)","journal-title":"Comput. Oper. Res."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0026589","volume-title":"Artificial Evolution","author":"F Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 1\u201351. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026589"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T James","year":"2009","unstructured":"James, T., Rego, C., Glover, F.: A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur. J. Oper. Res. 195(3), 810\u2013826 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/TSMCA.2009.2014556","volume":"39","author":"T James","year":"2009","unstructured":"James, T., Rego, C., Glover, F.: Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39(3), 579\u2013596 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."},{"issue":"1","key":"10_CR10","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(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"issue":"2","key":"10_CR11","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., Netto, P.O.B., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10_CR12","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(4), 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2\u20134","key":"10_CR13","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(2\u20134), 65\u201373 (2004)","journal-title":"Knowl. Based Syst."},{"issue":"3","key":"10_CR14","first-page":"187","volume":"35","author":"A Misevicius","year":"2006","unstructured":"Misevicius, A., Kilda, B.: Iterated tabu search: an improvement to standard tabu search. Inf. Technol. Control 35(3), 187\u2013197 (2006)","journal-title":"Inf. Technol. Control"},{"issue":"3","key":"10_CR15","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(3), 1519\u20131539 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4\u20135","key":"10_CR16","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignement problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"10_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: from Design to Implementation. Wiley, University of Lille - CNRS - INRIA, Hoboken (2009)"},{"issue":"5","key":"10_CR18","doi-asserted-by":"crossref","first-page":"5384","DOI":"10.1016\/j.eswa.2011.11.046","volume":"39","author":"BH Ulutas","year":"2012","unstructured":"Ulutas, B.H., Konak, S.K.: An artificial immune system based algorithm to solve unequal area facility layout problem. Expert Syst. Appl. 39(5), 5384\u20135395 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10_CR19","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.eswa.2014.07.027","volume":"42","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42(1), 355\u2013365 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10_CR20","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"Q Zhang","year":"2005","unstructured":"Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9(2), 192\u2013200 (2005)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78133-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T14:18:31Z","timestamp":1603981111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78133-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319781327","9783319781334"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78133-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}