{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:39:49Z","timestamp":1775054389124,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319711461","type":"print"},{"value":"9783319711478","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_31","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"449-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Euclidean Vehicle Routing Problem with Multiple Depots and Time Windows"],"prefix":"10.1007","author":[{"given":"Liang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"31_CR2","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-014-9906-4","volume":"73","author":"A Das","year":"2015","unstructured":"Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115\u2013142 (2015)","journal-title":"Algorithmica"},{"key":"31_CR4","unstructured":"Das, A.: (Dissertation) Approximation Schemes for Euclidean Vehicle Routing Problems. Brown University, Providence, Rhode Island, USA (2011)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Martin, C., Salavatipour, M.: Minimizing latency of capacitated k-tours. Algorithmica (2017). Online First Article","DOI":"10.1007\/s00453-017-0337-x"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159\u2013185 (2004)","journal-title":"Ann. Oper. Res."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/opre.1120.1153","volume":"61","author":"R Baldacci","year":"2013","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R., Calvo, R.W.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61, 298\u2013314 (2013)","journal-title":"Oper. Res."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.12720\/jtle.2.1.52-58","volume":"2","author":"NE Toklu","year":"2014","unstructured":"Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logistics Eng. 2, 52\u201358 (2014)","journal-title":"J. Traffic Logistics Eng."},{"key":"31_CR9","first-page":"1","volume":"28","author":"JC Sousaa","year":"2011","unstructured":"Sousaa, J.C., Biswasa, H.A., Britob, R., Silveirab, A.: A multi objective approach to solve capacitated vehicle routing problems with time windows using mixed integer linear programming. Int. J. Adv. Sci. Technol. 28, 1\u20138 (2011)","journal-title":"Int. J. Adv. Sci. Technol."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica (2017). Online First Article","DOI":"10.1007\/s00453-017-0298-0"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97, 43\u201369 (2003)","journal-title":"Math. Program."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"A.Das and C.Mathieu. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 390\u2013403 (2010)","DOI":"10.1137\/1.9781611973075.33"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Song, L., Huang, H., Du, H.: A quasi-polynomial time approximation scheme for Euclidean CVRPTW. In: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2014, pp. 66\u201373 (2014)","DOI":"10.1007\/978-3-319-12691-3_6"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s10878-015-9931-5","volume":"32","author":"L Song","year":"2016","unstructured":"Song, L., Huang, H., Du, H.: Approximation schemes for Euclidean vehicle routing problems with time windows. J. Comb. Optim. 32, 1217\u20131231 (2016)","journal-title":"J. Comb. Optim."},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"Bounds and heuristic for capacitated routing problems","year":"1985","unstructured":"Bounds and heuristic for capacitated routing problems: Haimovich, M., Rinnooy Kan, A.H.G. Math. Oper. Res. 10, 527\u2013542 (1985)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:13:30Z","timestamp":1709810010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}