{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:39:45Z","timestamp":1775054385143,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,7,18]],"date-time":"2015-07-18T00:00:00Z","timestamp":1437177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11071271; 11371004"],"award-info":[{"award-number":["11071271; 11371004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61370216"],"award-info":[{"award-number":["61370216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Strategic Emerging Industries Program (CN)","award":["ZDSY20120613125016389; JCYJ20130329153215152"],"award-info":[{"award-number":["ZDSY20120613125016389; JCYJ20130329153215152"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9931-5","type":"journal-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T00:29:46Z","timestamp":1437092986000},"page":"1217-1231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Approximation schemes for Euclidean vehicle routing problems with time windows"],"prefix":"10.1007","volume":"32","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"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"9931_CR1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM 45:753\u2013782","journal-title":"J ACM"},{"key":"9931_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora S (2003) Approximation schemes for np-hard geometric optimization problems: a survey. Math Program 97:43\u201369","journal-title":"Math Program"},{"key":"9931_CR3","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 59:1269\u20131283","journal-title":"Oper Res"},{"key":"9931_CR4","doi-asserted-by":"crossref","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 (2013) New route relaxation and pricing strategies for the vehicle routing problem. Oper Res 61:298\u2013314","journal-title":"Oper Res"},{"key":"9931_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.046","volume":"434","author":"X Bao","year":"2012","unstructured":"Bao X, Liu Z (2012) Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor Comput Sci 434:1\u201310","journal-title":"Theor Comput Sci"},{"key":"9931_CR6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig G, Ramser J (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"9931_CR7","unstructured":"Das A (2011) Approximation schemes for Euclidean vehicle routing problems. PhD Thesis, Dissertation, Brown University, Providence, Rhode Island, USA"},{"key":"9931_CR8","doi-asserted-by":"crossref","unstructured":"Das A, Mathieu C (2009) A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: Proceedings of the twenty first annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA","DOI":"10.1137\/1.9781611973075.33"},{"issue":"4","key":"9931_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W Fernandez","year":"1981","unstructured":"Fernandez W, Lueker G (1981) Bin packing can be solved within 1+ $$\\epsilon $$ \u03f5 in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"issue":"3","key":"9931_CR10","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M Garey","year":"1978","unstructured":"Garey M, Johnson D (1978) \u201cStrong\u201d NP-completeness results: motivation, examples and implications. J ACM 25(3):499\u2013508","journal-title":"J ACM"},{"key":"9931_CR11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/s10878-012-9564-x","volume":"28","author":"S Ghannadpour","year":"2014","unstructured":"Ghannadpour S, Noori S, Tavakkoli-Moghaddam R (2014) A multi-objective vehicle routing and scheduling problem with uncertainty in customers\u2019 request and priority. J Comb Optim 28:414\u2013446","journal-title":"J Comb Optim"},{"key":"9931_CR12","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich M, Rinnooy A (1985) Bounds and heuristic for capacitated routing problems. Math Oper Res 10:527\u2013542","journal-title":"Math Oper Res"},{"key":"9931_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.tcs.2003.09.010","volume":"312","author":"Y Karuno","year":"2004","unstructured":"Karuno Y, Nagamochi H (2004) An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor Comput Sci 312:267\u2013280","journal-title":"Theor Comput Sci"},{"key":"9931_CR14","doi-asserted-by":"crossref","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 (2004) Competitive memetic algorithms for arc routing problems. Ann Oper Res 131:159\u2013185","journal-title":"Ann Oper Res"},{"key":"9931_CR15","doi-asserted-by":"publisher","unstructured":"Li J, Li Y, Pardalos P (2014) Multi-depot vehicle routing problem with time windows under shared depot resources. J Comb Optim. doi: 10.1007\/s10878-014-9767-4","DOI":"10.1007\/s10878-014-9767-4"},{"key":"9931_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.tcs.2007.12.001","volume":"393","author":"H Nagamochi","year":"2008","unstructured":"Nagamochi H, Ohnishi T (2008) Approximating a vehicle scheduling problem with time windows and handling times. Theor Comput Sci 393:133\u2013146","journal-title":"Theor Comput Sci"},{"key":"9931_CR17","first-page":"1","volume":"28","author":"J Sousaa","year":"2011","unstructured":"Sousaa J, Biswasa H, Britob R, Silveirab A (2011) 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","journal-title":"Int J Adv Sci Technol"},{"key":"9931_CR18","doi-asserted-by":"crossref","first-page":"52","DOI":"10.12720\/jtle.2.1.52-58","volume":"2","author":"N Toklu","year":"2014","unstructured":"Toklu N, Gambardella L, Montemanni R (2014) A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J Traffic Logist Eng 2:52\u201358","journal-title":"J Traffic Logist Eng"},{"key":"9931_CR19","volume-title":"The vehicle routing problem","author":"P Toth","year":"2001","unstructured":"Toth P, Vigo D (2001) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"key":"9931_CR20","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/s10878-014-9741-1","volume":"28","author":"T Zhang","year":"2014","unstructured":"Zhang T, Chaovalitwongse W, Zhang Y (2014) Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. J Comb Optim 28:288\u2013309","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9931-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9931-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9931-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T05:52:21Z","timestamp":1566971541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9931-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,18]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9931"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9931-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,18]]}}}