{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:53Z","timestamp":1770994073050,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030386283","type":"print"},{"value":"9783030386290","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_18","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"224-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"06","key":"18_CR1","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1142\/S0129054110007623","volume":"21","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane rof moderately large values of $$k$$. Int. J. Found. Comput. Sci. 21(06), 893\u2013904 (2010). \nhttps:\/\/doi.org\/10.1142\/S0129054110007623","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR2","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":"18_CR3","doi-asserted-by":"publisher","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 275\u2013283. ACM, New York (1997). \nhttps:\/\/doi.org\/10.1145\/258533.258602","DOI":"10.1145\/258533.258602"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Becker, A., Klein, P.N., Saulpic, D.: A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4\u20136 September 2017, LIPIcs, vol. 87, pp. 12:1\u201312:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.12\n\n, \nhttp:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-049-1","DOI":"10.4230\/LIPIcs.ESA.2017.12"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Becker, A., Klein, P.N., Saulpic, D.: Polynomial-time approximation schemes for k-center, k-median, and capacitated vehicle routing in bounded highway dimension. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms, ESA 2018, August 20\u201322, 2018, Helsinki, Finland. LIPIcs, vol. 112, pp. 8:1\u20138:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.8\n\n, \nhttp:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-081-1","DOI":"10.4230\/LIPIcs.ESA.2018.8"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Blocho, M., Czech, Z.: A parallel memetic algorithm for the vehicle routing problem with time windows. In: 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, pp. 144\u2013151 (2013). \nhttps:\/\/doi.org\/10.1109\/3PGCIC.2013.28","DOI":"10.1109\/3PGCIC.2013.28"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Manage. Sci. 6, 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"18_CR8","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). \nhttps:\/\/doi.org\/10.1007\/s00453-014-9906-4","journal-title":"Algorithmica"},{"key":"18_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1287\/trsc.2014.0531","volume":"49","author":"T Gschwind","year":"2015","unstructured":"Gschwind, T., Irnich, S.: Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transp. Sci. 49(2), 335\u2013354 (2015)","journal-title":"Transp. Sci."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985). \nhttps:\/\/doi.org\/10.1287\/moor.10.4.527","journal-title":"Math. Oper. Res."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-78604-7_22","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"H Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiura, M.: A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 254\u2013265. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78604-7_22"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1134\/S0081543817050133","volume":"297","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Dubinin, R.D.: Approximability of the vehicle routing problem infinite-dimensional Euclidean spaces. Proc. Steklov Inst. Math. 297(1), 117\u2013128 (2017). \nhttps:\/\/doi.org\/10.1134\/S0081543817050133","journal-title":"Proc. Steklov Inst. Math."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.21538\/0134-4889-2018-24-3-233-246","volume":"24","author":"M Khachai","year":"2018","unstructured":"Khachai, M., Ogorodnikov, Y.: Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows. Trudy instituta matematiki i mekhaniki UrO RAN 24, 233\u2013246 (2018). \nhttps:\/\/doi.org\/10.21538\/0134-4889-2018-24-3-233-246","journal-title":"Trudy instituta matematiki i mekhaniki UrO RAN"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-030-11027-7_30","volume-title":"Analysis of Images, Social Networks and Texts","author":"M Khachay","year":"2018","unstructured":"Khachay, M., Ogorodnikov, Y.: Efficient PTAS for the Euclidean CVRP with time windows. In: van der Aalst, W.M.P., et al. (eds.) AIST 2018. LNCS, vol. 11179, pp. 318\u2013328. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-11027-7_30"},{"key":"18_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-10934-9_12","volume-title":"Optimization and Applications","author":"M Khachay","year":"2019","unstructured":"Khachay, M., Ogorodnikov, Y.: Improved polynomial time approximation scheme for capacitated vehicle routing problem with time windows. In: Evtushenko, Y., Ja\u0107imovi\u0107, M., Khachay, M., Kochetov, Y., Malkova, V., Posypkin, M. (eds.) OPTIMA 2018. CCIS, vol. 974, pp. 155\u2013169. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-10934-9_12"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-44914-2_16","volume-title":"Discrete Optimization and Operations Research","author":"M Khachay","year":"2016","unstructured":"Khachay, M., Dubinin, R.: PTAS for the Euclidean capacitated vehicle routing problem in $$R^d$$. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 193\u2013205. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_16"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-26626-8_14","volume-title":"Combinatorial Optimization and Applications","author":"M Khachay","year":"2015","unstructured":"Khachay, M., Zaytseva, H.: Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 178\u2013190. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_14"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.4236\/iim.2012.43010","volume":"4","author":"S Kumar","year":"2012","unstructured":"Kumar, S., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manage. 4, 66\u201374 (2012). \nhttps:\/\/doi.org\/10.4236\/iim.2012.43010","journal-title":"Intell. Inf. Manage."},{"issue":"6","key":"18_CR20","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"J Nalepa","year":"2016","unstructured":"Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 20(6), 2309\u20132327 (2016). \nhttps:\/\/doi.org\/10.1007\/s00500-015-1642-4","journal-title":"Soft Comput."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Necula, R., Breaban, M., Raschip, M.: Tackling dynamic vehicle routing problem with time windows by means of ant colony system. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2480\u20132487 (2017). \nhttps:\/\/doi.org\/10.1109\/CEC.2017.7969606","DOI":"10.1109\/CEC.2017.7969606"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.procs.2015.05.382","volume":"51","author":"Shannon Pace","year":"2015","unstructured":"Pace, S., Turky, A., Moser, I., Aleti, A.: Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Comput. Sci. 51, 2257\u20132266 (2015). \nhttps:\/\/doi.org\/10.1016\/j.procs.2015.05.382\n\n. International Conference on Computational Science, ICCS 2015","journal-title":"Procedia Computer Science"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theor. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/trsc.2016.0675","volume":"50","author":"M Savelsbergh","year":"2016","unstructured":"Savelsbergh, M., van Woensel, T.: 50th anniversary invited article - city logistics: challenges and opportunities. Transp. Sci. 50(2), 579\u2013590 (2016). \nhttps:\/\/doi.org\/10.1287\/trsc.2016.0675","journal-title":"Transp. Sci."},{"issue":"9","key":"18_CR25","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.3390\/ijerph15092025","volume":"15","author":"L Shen","year":"2018","unstructured":"Shen, L., Tao, F., Wang, S.: Multi-depot open vehicle routing problem with time windows based on carbon trading. Int. J. Environ. Res. Public Health 15(9), 2025 (2018). \nhttps:\/\/doi.org\/10.3390\/ijerph15092025","journal-title":"Int. J. Environ. Res. Public Health"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-71147-8_31","volume-title":"Combinatorial Optimization and Applications","author":"L Song","year":"2017","unstructured":"Song, L., Huang, H.: The Euclidean vehicle routing problem with multiple depots and time windows. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 449\u2013456. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-71147-8_31"},{"issue":"4","key":"18_CR27","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(4), 1217\u20131231 (2016). \nhttps:\/\/doi.org\/10.1007\/s10878-015-9931-5","journal-title":"J. Comb. Optim."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, 2nd edn. MOS-SIAM Series on Optimization, SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"issue":"1","key":"18_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013). \nhttps:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:15Z","timestamp":1579598475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}