{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T13:05:34Z","timestamp":1745413534677},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540794370"},{"type":"electronic","value":"9783540794387"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79438-7_12","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T09:20:59Z","timestamp":1218446459000},"page":"239-253","source":"Crossref","is-referenced-by-count":15,"title":["\u201cMultiple Neighbourhood\u201d Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods"],"prefix":"10.1007","author":[{"given":"Kenneth","family":"S\u00f6rensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Schittekat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science\u00a039, 119\u2013139 (2005)","journal-title":"Transportation Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clark","year":"1964","unstructured":"Clark, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012, 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1011301019184","volume":"7","author":"R. Cordone","year":"2001","unstructured":"Cordone, R., Wolfer-Calvo, R.: A heuristic for the vehicle routing problem with time windows. Journal of Heuristics\u00a07, 107\u2013129 (2001)","journal-title":"Journal of Heuristics"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling PATAT 2000","author":"P. Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling PATAT 2000. LNCS, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A parameter-free hyperheuristic for scheduling a sales summit. In: MIC 2001 \u2013 Proceedings of the Metaheuristics International Conference, Porto, pp. 127\u2013131 (2001)","DOI":"10.1007\/3-540-44629-X_11"},{"key":"12_CR6","unstructured":"CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg, 802, Incline Village, NV 89451-9436. Using the CPLEX Callable Library (1995)"},{"key":"12_CR7","unstructured":"Crispim, J., Brandao, J.: Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In: MIC 2001 \u2013 Proceedings of the Metaheuristics International Conference, Porto, pp. 631\u2013636 (2001)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for solving the vrp. Networks\u00a011, 109\u2013124 (1981)","journal-title":"Networks"},{"key":"12_CR9","unstructured":"Hall, R.: The 2006 vehicle routing survey. ORMS Today\u00a033(3) (June 2006)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search for the p-median. Location Science\u00a05, 207\u2013226 (1997)","journal-title":"Location Science"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433\u2013458. Kluwer, Boston (1999)"},{"key":"12_CR12","first-page":"261","volume-title":"Decisions and Control in Management Science","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Industrial applications of the variable neighbourhood search metaheuristic. In: Decisions and Control in Management Science, pp. 261\u2013274. Kluwer, Boston (2001)"},{"key":"12_CR13","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 neighbourhood search: Principles and applications. European Journal of Operational Research\u00a0130, 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"12_CR14","unstructured":"Mladenovi\u0107, N.: A variable neighborhood algorithm \u2013 a new metaheuristic for combinatorial optimization. In: Optimization Days, p. 112 (1995)"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C. Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research\u00a031, 1985\u20132002 (2004)","journal-title":"Computers and Operations Research"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1016\/j.cor.2005.07.016","volume":"33","author":"J.P. Watson","year":"2006","unstructured":"Watson, J.P., Howe, A.E., Whitley, L.D.: Deconstructing Nowicki and Smutnicki\u2019s i-TSAB tabu search algorithm for the job-shop scheduling problem. Computers and Operations Research\u00a033, 2623\u20132644 (2006)","journal-title":"Computers and Operations Research"}],"container-title":["Studies in Computational Intelligence","Adaptive and Multilevel Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79438-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:36:30Z","timestamp":1558121790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79438-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540794370","9783540794387"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79438-7_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2008]]}}}