{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:21:20Z","timestamp":1776334880640,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642049170","type":"print"},{"value":"9783642049187","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04918-7_9","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T02:08:27Z","timestamp":1254794907000},"page":"115-129","source":"Crossref","is-referenced-by-count":15,"title":["Hierarchical Iterated Local Search for the Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Mohamed Saifullah","family":"Hussin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Stochastic Local Search\u2014Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search\u2014Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)"},{"key":"9_CR2","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"key":"9_CR3","unstructured":"Call for Papers: HM2009: 6th International Workshop on Hybrid Metaheuristics (2009), http:\/\/www.diegm.uniud.it\/hm2009\/"},{"key":"9_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44886-1_12","volume-title":"Advances in Artificial Intelligence","author":"K. Smyth","year":"2003","unstructured":"Smyth, K., Hoos, H.H., St\u00fctzle, T.: Iterated robust tabu search for MAX-SAT. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol.\u00a02671, pp. 129\u2013144. Springer, Heidelberg (2003)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ejor.2007.04.048","volume":"191","author":"J.-F. Cordeau","year":"2008","unstructured":"Cordeau, J.-F., Laporte, G., Pasin, F.: Iterated tabu search for the car sequencing problem. European Journal of Operational Research\u00a0191(3), 945\u2013956 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9_CR6","first-page":"29","volume":"32","author":"A. Misevicius","year":"2004","unstructured":"Misevicius, A.: Using iterated tabu search for the traveling salesman problem. Information Technology and Control\u00a032(3), 29\u201340 (2004)","journal-title":"Information Technology and Control"},{"issue":"3","key":"9_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.5755\/j01.itc.35.3.11770","volume":"35","author":"A. Misevicius","year":"2006","unstructured":"Misevicius, A., Lenkevicius, A., Rubliauskas, D.: Iterated tabu search: an improvement to standard tabu search. Information Technology and Control\u00a035(3), 187\u2013197 (2006)","journal-title":"Information Technology and Control"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88439-2_1","volume-title":"Hybrid Metaheuristics","author":"M. Lozano","year":"2008","unstructured":"Lozano, M., Garc\u00eda-Mart\u00ednez, C.: An evolutionary ILS-perturbation technique. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol.\u00a05296, pp. 1\u201315. Springer, Heidelberg (2008)"},{"issue":"8","key":"9_CR9","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I. Essafi","year":"2008","unstructured":"Essafi, I., Mati, Y., Dauz\u00e8re-P\u00e8r\u00e9z, S.: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Computers & Operations Research\u00a035(8), 2599\u20132616 (2008)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"9_CR10","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. Journal of the ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"Journal of the ACM"},{"key":"9_CR11","first-page":"241","volume-title":"Handbook of Combinatorial Optimization","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., \u00c7ela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Pardalos, P.M., Du, D.Z. (eds.) Handbook of Combinatorial Optimization, vol.\u00a02, pp. 241\u2013338. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0174(1), 1519\u20131539 (2006)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-24652-7_20","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"T. St\u00fctzle","year":"2004","unstructured":"St\u00fctzle, T., Fernandes, S.: New benchmark instances for the QAP and the experimental analysis of algorithms. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2004. LNCS, vol.\u00a03004, pp. 199\u2013209. Springer, Heidelberg (2004)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9.D. Taillard","year":"1995","unstructured":"Taillard, \u00c9.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science\u00a03(2), 87\u2013105 (1995)","journal-title":"Location Science"},{"issue":"4\u20135","key":"9_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9.D. Taillard","year":"1991","unstructured":"Taillard, \u00c9.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"9_CR18","first-page":"11","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002)","author":"M. Birattari","year":"2002","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 11\u201318. Morgan Kaufmann Publishers, San Francisco (2002)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"174","author":"Z. Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P., Taillard, \u00c9.D.: A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Annals of Operations Research\u00a0174, 65\u201394 (2005)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04918-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T17:34:07Z","timestamp":1633973647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04918-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049170","9783642049187"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04918-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}