{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:25:09Z","timestamp":1743150309142,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_36","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"227-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Sparsification for the Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Christian","family":"Doppstadt","sequence":"first","affiliation":[]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Stenger","sequence":"additional","affiliation":[]},{"given":"Bastian","family":"Sand","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Vigo","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schwind","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"key":"36_CR1_36","unstructured":"R. Baldacci. Personal Communication, 2010."},{"issue":"3","key":"36_CR2_36","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10287-009-0118-3","volume":"7","author":"R. Baldacci","year":"2010","unstructured":"R. Baldacci, E. Bartolini, A. Mingozzi, and R. Roberti. An exact solution framework for a broad class of vehicle routing problems. Computational Management Science, 7(3): 229\u2013268, 2010.","journal-title":"Computational Management Science"},{"issue":"1","key":"36_CR3_36","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"Olli Br\u00e4ysy","year":"2005","unstructured":"Olli Br\u00e4ysy and Michel Gendreau. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1): 119\u2013139, 2005.","journal-title":"Transportation Science"},{"key":"36_CR4_36","volume-title":"The VRP with time windows. In Paolo Toth and Daniele Vigo, editors, The vehicle routing problem","author":"J.F. Cordeau.","year":"2001","unstructured":"J. F. Cordeau, G. Desaulnier, J. Desrosiers, M. Solomon, and F. Soumis. The VRP with time windows. In Paolo Toth and Daniele Vigo, editors, The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001."},{"key":"36_CR5_36","doi-asserted-by":"crossref","unstructured":"Michel Gendreau, Jean-Yves Potvin, Olli Br\u00e4ysy, Geir Hasle, and Arne L\u00f8kketangen. Meta-heuristics for the vehicle routing problem and its extensions: A categorized bibliography. In Bruce L. Golden, editor, The Vehicle Routing Problem: Latest Advances and New Challenges, chapter 1, pages 143\u2013169. Springer, 2008.","DOI":"10.1007\/978-0-387-77778-8_7"},{"key":"36_CR6_36","doi-asserted-by":"crossref","unstructured":"Fred Glover and Fred Laguna. Tabu Search. Kluwer, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"1","key":"36_CR7_36","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"M. W. P. Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research, 4(1): 285\u2013305, 1985.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"36_CR8_36","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","volume":"47","author":"M.W.P. Savelsbergh","year":"1990","unstructured":"M.W.P. Savelsbergh. An efficient implementation of local search algorithms for constrained routing problems. European Journal of Operational Research, 47(1): 75\u201385, 1990.","journal-title":"European Journal of Operational Research"},{"key":"36_CR9_36","volume-title":"Seventh Triennial Symposium on Transportation Analysis","author":"Michael Schneider","year":"2010","unstructured":"Michael Schneider, Christian Doppstadt, Bastian Sand, Andreas Stenger, and Michael Schwind. A vehicle routing problem with time windows and driver familiarity. In Seventh Triennial Symposium on Transportation Analysis, Tromso, Norway, 2010."},{"key":"36_CR10_36","doi-asserted-by":"crossref","unstructured":"Michael Schneider, Christian Doppstadt, Andreas Stenger, and Michael Schwind. Ant colony optimization for a stochastic vehicle routing problem with driver learning. In IEEE Congress on Evolutionary Computation, Barcelona, Spain, 2010.","DOI":"10.1109\/CEC.2010.5585999"},{"volume-title":"The vehicle routing problem","year":"2001","key":"36_CR11_36","unstructured":"Paolo Toth and Daniele Vigo, editors. The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001."},{"issue":"4","key":"36_CR12_36","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"Paolo Tot","year":"2003","unstructured":"Toth, Paolo and Vigo, Daniele. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing, 15(4): 333\u2013346, 2003.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T02:16:17Z","timestamp":1675908977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_36","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}