{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:10Z","timestamp":1740099610093,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030373337"},{"type":"electronic","value":"9783030373344"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-37334-4_35","type":"book-chapter","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T07:05:52Z","timestamp":1576307152000},"page":"388-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,15]]},"reference":[{"issue":"06","key":"35_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 for moderately large values of $$k$$. Int. J. Found. Comput. Sci. 21(06), 893\u2013904 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"35_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"Sanjeev 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":"Journal of the ACM"},{"key":"35_CR3","doi-asserted-by":"crossref","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)","DOI":"10.1145\/258533.258602"},{"key":"35_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1109\/3PGCIC.2013.28"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.17535\/crorr.2017.0029","volume":"8","author":"Z Bor\u010dinova","year":"2017","unstructured":"Bor\u010dinova, Z.: Two models of the capacitated vehicle routing problem. Croatian Oper. Res. Rev. 8, 463\u2013469 (2017)","journal-title":"Croatian Oper. Res. Rev."},{"issue":"12","key":"35_CR6","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.ifacol.2016.07.691","volume":"49","author":"Gustavo Alfredo Bula","year":"2016","unstructured":"Bula, G.A., Gonzalez, F.A., Prodhon, C., Afsar, H.M., Velasco, N.M.: Mixed integer linear programming model for vehicle routing problem for hazardous materials transportation**universidad nacional de colombia. universite de technologie de troyes. IFAC-PapersOnLine 49(12), 538\u2013543 (2016). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S2405896316309673\n\n. 8th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2016","journal-title":"IFAC-PapersOnLine"},{"key":"35_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. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Das, A., Mathieu, C.: 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. Society for Industrial and Applied Mathematics, Philadelphia (2010)","DOI":"10.1137\/1.9781611973075.33"},{"key":"35_CR9","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":"35_CR10","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Bidimensionality and EPTAS. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 748\u2013759. Society for Industrial and Applied Mathematics, Philadelphia (2011). \nhttp:\/\/dl.acm.org\/citation.cfm?id=2133036.2133095"},{"key":"35_CR11","unstructured":"Gonz\u00e1lez, O., Segura, C., Valdez Pe\u00f1a, S.: A parallel memetic algorithm to solve the capacitated vehicle routing problem with time windows. Int. J. Comb. Optim. Probl. Inform. 9(1), 35\u201345 (2018). \nhttps:\/\/ijcopi.org\/index.php\/ojs\/article\/view\/77"},{"issue":"4","key":"35_CR12","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)","journal-title":"Mathematics of Operations Research"},{"key":"35_CR13","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"},{"key":"35_CR14","unstructured":"van Hoorn, J.J.: A note on the worst case complexity for the capacitated vehicle routing problem. In: Research Memorandum, vol. 5. Faculteit der Economische Wetenschappen en Bedrijfskunde (2010)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Kara, I.: Arc based integer programming formulations for the distance constrained vehicle routing problem. In: Proceedings of LINDI 2011\u20133rd IEEE International Symposium on Logistics and Industrial Informatics (2011)","DOI":"10.1109\/LINDI.2011.6031159"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-44914-2_16","volume":"297","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Dubinin, R.D.: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces. Proc. Steklov Inst. Math. 297(1), 117\u2013128 (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44914-2_16","journal-title":"Proc. Steklov Inst. Math."},{"issue":"3","key":"35_CR17","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(3), 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":"35_CR18","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":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-22629-9_22","volume-title":"Mathematical Optimization Theory and Operations Research","author":"M Khachay","year":"2019","unstructured":"Khachay, M., Ogorodnikov, Y.: Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand. In: Khachay, M., Kochetov, Y., Pardalos, P. (eds.) MOTOR 2019. LNCS, vol. 11548, pp. 309\u2013327. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-22629-9_22"},{"key":"35_CR20","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":"35_CR21","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":"35_CR22","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"},{"issue":"6","key":"35_CR23","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)","journal-title":"Soft Comput."},{"key":"35_CR24","doi-asserted-by":"crossref","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)","DOI":"10.1109\/CEC.2017.7969606"},{"key":"35_CR25","unstructured":"Ng, K., Lee, C., Zhang, S., Wu, K., Ho, W.: A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion 109, 151\u2013168 (2017). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835217301948"},{"key":"35_CR26","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. Theoret. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR27","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":"35_CR28","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)","journal-title":"J. Comb. Optim."},{"key":"35_CR29","series-title":"MOS-Siam Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing: Problems, Methods, and Applications","author":"P Toth","year":"2014","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. MOS-Siam Series on Optimization, 2nd edn. SIAM, Philadelphia (2014)","edition":"2"},{"issue":"1","key":"35_CR30","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)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37334-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T07:16:16Z","timestamp":1576307776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37334-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030373337","9783030373344"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37334-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"113","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":"27","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":"8","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":"24% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21 of 134 submissions were automatically rejected and not reviewed.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}