{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:50:55Z","timestamp":1743065455538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39636-1_4","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T10:36:37Z","timestamp":1464086197000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hybridization as Cooperative Parallelism for\u00a0the\u00a0Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Danny","family":"Munera","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"4_CR2","first-page":"1","volume":"4","author":"CW Commander","year":"2005","unstructured":"Commander, C.W.: A survey of the quadratic assignment problem, with applications. Morehead Electron. J. Appl. Math. 4, 1\u201315 (2005). MATH-2005-01","journal-title":"Morehead Electron. J. Appl. Math."},{"issue":"9","key":"4_CR3","first-page":"42","volume":"96","author":"RK Bhati","year":"2014","unstructured":"Bhati, R.K., Rasool, A.: Quadratic assignment problem and its relevance to the real world: a survey. Int. J. Comput. Appl. 96(9), 42\u201347 (2014)","journal-title":"Int. J. Comput. Appl."},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","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":"9","key":"4_CR5","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 assignment problem. Appl. Math. Comput. 219(9), 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","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(2), 416\u2013422 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","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."},{"key":"4_CR8","doi-asserted-by":"publisher","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, 810\u2013826 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.engappai.2014.12.011","volume":"39","author":"U Tosun","year":"2015","unstructured":"Tosun, U.: On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem. Eng. Appl. Artif. Intell. 39, 267\u2013278 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-30698-8_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"D Munera","year":"2016","unstructured":"Munera, D., Diaz, D., Abreu, S.: Solving the quadratic assignment problem with cooperative parallel extremal optimization. In: Chicano, F., et al. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 251\u2013266. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-30698-8_17"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-662-44320-0_2","volume-title":"Evolutionary Computation in Combinatorial Optimisation","author":"D Munera","year":"2014","unstructured":"Munera, D., Diaz, D., Abreu, S., Codognet, P.: A parametric framework for cooperative parallel local search. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol. 8600, pp. 13\u201324. Springer, Heidelberg (2014)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Munera, D., Diaz, D., Abreu, S., Codognet, P.: Flexible cooperation in parallel local search. In: Symposium on Applied Computing (SAC), pp. 1360\u20131361. ACM Press, New York (2014)","DOI":"10.1145\/2554850.2555140"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., Von Praun, C., Sarkar, V.: X10: an object-oriented approach to non-uniform cluster computing. In: SIGPLAN Conference on Object-oriented Programming, Systems, Languages, and Applications, pp. 519\u2013538. ACM, San Diego (2005)","DOI":"10.1145\/1103845.1094852"},{"key":"4_CR14","unstructured":"Saraswat, V., Tardieu, O., Grove, D., Cunningham, D., Takeuchi, M., Herta, B.: A Brief Introduction to X10 (for the High Performance Programmer). Technical report (2012)"},{"issue":"4\u20135","key":"4_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard, \u00c9.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1007\/978-1-4419-7997-1_22","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"2013","unstructured":"Burkard, R.E.: Quadratic assignment problems. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, 2nd edn, pp. 2741\u20132814. Springer, New York (2013)","edition":"2"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","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.M.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"4_CR18","first-page":"28","volume":"101","author":"ANH Zaied","year":"2014","unstructured":"Zaied, A.N.H., Shawky, L.A.E.F.: A survey of quadratic assignment problems. Int. J. Comput. Appl. 101(6), 28\u201336 (2014)","journal-title":"Int. J. Comput. Appl."},{"issue":"3","key":"4_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"issue":"1","key":"4_CR20","first-page":"1","volume":"5","author":"G Said","year":"2014","unstructured":"Said, G., Mahmoud, A.M., El-Horbaty, E.S.M.: A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. Int. J. Adv. Comput. Sci. Appl. (IJACSA) 5(1), 1\u20136 (2014)","journal-title":"Int. J. Adv. Comput. Sci. Appl. (IJACSA)"},{"key":"4_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"issue":"2","key":"4_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9D Taillard","year":"1995","unstructured":"Taillard, \u00c9.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3(2), 87\u2013105 (1995)","journal-title":"Location Sci."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","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(1), 95\u2013111 (2005)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"4_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0004-3702(00)00007-2","volume":"119","author":"S Boettcher","year":"2000","unstructured":"Boettcher, S., Percus, A.: Nature\u2019s way of optimizing. Artif. Intell. 119(1\u20132), 275\u2013286 (2000)","journal-title":"Artif. Intell."},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1043-7_3","volume-title":"Computational Modeling and Problem Solving in the Networked World","author":"S Boettcher","year":"2003","unstructured":"Boettcher, S., Percus, A.G.: Extremal optimization: an evolutionary local-search algorithm. In: Bhargava, H.K., Ye, N. (eds.) Computational Modeling and Problem Solving in the Networked World, vol. 21. Springer, New York (2003)"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/3527603794.ch11","volume-title":"New Optimization Algorithms to Physics","author":"S Boettcher","year":"2004","unstructured":"Boettcher, S.: Extremal Optimization. In: Hartmann, A.K., Rieger, H. (eds.) New Optimization Algorithms to Physics, pp. 227\u2013251. Wiley-VCH Verlag, Berlin (2004)"},{"issue":"24","key":"4_CR27","doi-asserted-by":"publisher","first-page":"4083","DOI":"10.1103\/PhysRevLett.71.4083","volume":"71","author":"P Bak","year":"1993","unstructured":"Bak, P., Sneppen, K.: Punctuated equilibrium and criticality in a simple model of evolution. Phy. Rev. Lett. 71(24), 4083\u20134086 (1993)","journal-title":"Phy. Rev. Lett."},{"key":"4_CR28","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383","volume-title":"Parallel Metaheuristics: A New Class of Algorithms","author":"E Alba","year":"2005","unstructured":"Alba, E.: Parallel Metaheuristics: A New Class of Algorithms. Wiley-Interscience, New York (2005)"},{"issue":"1","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2012.00862.x","volume":"20","author":"E Alba","year":"2013","unstructured":"Alba, E., Luque, G., Nesmachnow, S.: Parallel metaheuristics: recent advances and new trends. Int. Trans. Oper. Res. 20(1), 1\u201348 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"4_CR30","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-15211-5_28","volume-title":"Intelligent Distributed Computing IV","author":"D Diaz","year":"2010","unstructured":"Diaz, D., Abreu, S., Codognet, P.: Parallel constraint-based local search on the cell\/be multicore architecture. In: Essaaidi, M., Malgeri, M., Badica, C. (eds.) Intelligent Distributed Computing IV. SCI, vol. 315, pp. 265\u2013274. Springer, Heidelberg (2010)"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M Verhoeven","year":"1995","unstructured":"Verhoeven, M., Aarts, E.: Parallel local search. J. Heuristics 1(1), 43\u201365 (1995)","journal-title":"J. Heuristics"},{"issue":"1","key":"4_CR32","first-page":"1","volume":"20","author":"Y Caniou","year":"2014","unstructured":"Caniou, Y., Codognet, P., Richoux, F., Diaz, D., Abreu, S.: Large-scale parallelism for constraint-based local search: the costas array case study. Constraints 20(1), 1\u201327 (2014)","journal-title":"Constraints"},{"key":"4_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.parco.2002.07.001","volume":"30","author":"M Toulouse","year":"2004","unstructured":"Toulouse, M., Crainic, T., Sans\u00f3, B.: Systemic behavior of cooperative search algorithms. Parallel Comput. 30, 57\u201379 (2004)","journal-title":"Parallel Comput."},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Talukdar, S., Baerentzen, L., Gove, A., De Souza, P.: Asynchronous teams: cooperation schemes for autonomous agents. J. Heuristics 4(4), 295\u2013321","DOI":"10.1023\/A:1009669824615"},{"issue":"1\u20132","key":"4_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1\u20132), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR36","first-page":"281","volume":"11","author":"G Palubeckis","year":"2000","unstructured":"Palubeckis, G.: An algorithm for construction of test cases for the quadratic assignment problem. Informatica Lith. Acad. Sci. 11(3), 281\u2013296 (2000)","journal-title":"Informatica Lith. Acad. Sci."},{"key":"4_CR37","unstructured":"Wu, K.C., Ting, C.J., Gonzalez, L.C.: An ant colony optimization algorithm for quadratic assignment problem. In: Asia-Pacific Conference on Industrial Engineering and Management Systems (2011)"},{"issue":"1","key":"4_CR38","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P., Taillard, \u00c9.: 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":"C","key":"4_CR39","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.asoc.2015.06.061","volume":"36","author":"A Acan","year":"2015","unstructured":"Acan, A., \u00dcnveren, A.: A great deluge and tabu search hybrid with two-stage memory support for quadratic assignment problem. Appl. Soft Comput. 36(C), 185\u2013203 (2015)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T02:30:42Z","timestamp":1718591442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}