{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:21:06Z","timestamp":1776334866752,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540288978","type":"print"},{"value":"9783540319979","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554028_12","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T22:55:47Z","timestamp":1285714547000},"page":"81-88","source":"Crossref","is-referenced-by-count":8,"title":["Variable Neighborhood Search with Permutation Distance for QAP"],"prefix":"10.1007","author":[{"given":"Chong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuoquan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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, 555\u2013565 (1976)","journal-title":"Journal of the ACM"},{"key":"12_CR2","unstructured":"Taillard, E., Gambardella, L.M.: Adaptive memories for the quadratic assignment problems. Technical Report IDSIA-87-97, Dalle Molle Institute for Artificial Intelligence (1997)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E., Karisch, S., Rendl, F.: Qaplib - a quadratic assignment problem library. European Journal of Operational Research\u00a055, 115\u2013119 (1991)","journal-title":"European Journal of Operational Research"},{"key":"12_CR4","series-title":"Combinatorial Optimizaiton","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem","author":"E. Cela","year":"1998","unstructured":"Cela, E.: The Quadratic Assignment Problem. Combinatorial Optimizaiton, vol.\u00a01. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"12_CR5","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. Computational Optimization And Applications\u00a030, 95\u2013111 (2005)","journal-title":"Computational Optimization And Applications"},{"key":"12_CR6","doi-asserted-by":"publisher","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 assignment problem. Parallel Computing\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L. Gambardella","year":"1999","unstructured":"Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society\u00a050, 167\u2013176 (1999)","journal-title":"Journal of the Operational Research Society"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"E. Talbi","year":"2001","unstructured":"Talbi, E., Roux, O., Fonlupt, C., Robillard, D.: Parallel ant colonies for the quadratic assignment problem. Future Generation Computer Systems\u00a017, 441\u2013449 (2001)","journal-title":"Future Generation Computer Systems"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V., Colorni, A., Dorigo, M.: The ant system applied to the quadratic assignment. IEEE Transactions On Knowledge And Data Engineering\u00a011, 769\u2013778 (1999)","journal-title":"IEEE Transactions On Knowledge And Data Engineering"},{"key":"12_CR10","doi-asserted-by":"publisher","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. Knowledge-Based Systems\u00a017, 65\u201373 (2004)","journal-title":"Knowledge-Based Systems"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-24838-5_27","volume-title":"Experimental and Efficient Algorithms","author":"C.A. Oliveira","year":"2004","unstructured":"Oliveira, C.A., Pardalos, P.M., Resende, M.: Grasp with path-relinking for the quadratic assignment problem. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 356\u2013368. Springer, Heidelberg (2004)"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.15388\/Informatica.2003.037","volume":"14","author":"A. Misevicius","year":"2003","unstructured":"Misevicius, A.: A modified simulated annealing algorithm for the quadratic assignment problem. Informatica\u00a014, 497\u2013514 (2003)","journal-title":"Informatica"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1021857607524","volume":"118","author":"P. Mills","year":"2003","unstructured":"Mills, P., Tsang, E., Ford, J.: Applying an extended guided local search to the quadratic assignment problem. Annals Of Operations Research\u00a0118, 121\u2013135 (2003)","journal-title":"Annals Of Operations Research"},{"key":"12_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, 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"12_CR16","first-page":"621","volume-title":"Variable Neighborhood Search","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Handbook of Metaheuristics. In: Variable Neighborhood Search, pp. 621\u2013757. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F. Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n-Batista, B., Moreno-P\u00e9rez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. Journal of Heuristics\u00a08, 375\u2013388 (2002)","journal-title":"Journal of Heuristics"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"N. Mladenovic","year":"2003","unstructured":"Mladenovic, N., Labb\u00e9, M., Hansen, P.: Solving the p-center problem with tabu search and variable neighborhood search. Networks\u00a042, 48\u201364 (2003)","journal-title":"Networks"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C. Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. European Journal Of Operational Research\u00a0151, 379\u2013388 (2003)","journal-title":"European Journal Of Operational Research"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O. Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. Informs Journal On Computing\u00a015, 347\u2013368 (2003)","journal-title":"Informs Journal On Computing"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A.L. Bouthillier","year":"2005","unstructured":"Bouthillier, A.L., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers And Operations Research\u00a032, 1685\u20131708 (2005)","journal-title":"Computers And Operations Research"},{"key":"12_CR22","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. European Journal Of Operational Research\u00a0160, 416\u2013422 (2005)","journal-title":"European Journal Of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554028_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:06:13Z","timestamp":1619492773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554028_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540288978","9783540319979"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11554028_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}