{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T04:01:18Z","timestamp":1749355278888,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819665754","type":"print"},{"value":"9789819665761","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-6576-1_28","type":"book-chapter","created":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T05:38:52Z","timestamp":1749274732000},"page":"410-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximation Algorithms for\u00a0the\u00a0Cumulative Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-750X","authenticated-orcid":false,"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,8]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K Altinkemer","year":"1987","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6(4), 149\u2013158 (1987)","journal-title":"Oper. Res. Lett."},{"key":"28_CR2","unstructured":"Augerat, P., Naddef, D., Belenguer, J., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem (1995)"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"DJ Bertsimas","year":"1992","unstructured":"Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574\u2013585 (1992)","journal-title":"Oper. Res."},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"DJ Bertsimas","year":"1996","unstructured":"Bertsimas, D.J., Simchi-Levi, D.: A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper. Res. 44(2), 286\u2013304 (1996)","journal-title":"Oper. Res."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Blauth, J., Traub, V., Vygen, J.: Improving the approximation ratio for capacitated vehicle routing. In: Mathematical Programming, pp. 1\u201347 (2022)","DOI":"10.1007\/978-3-030-73879-2_1"},{"key":"28_CR6","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report. Carnegie-Mellon University (1976)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. J. Oper. Res. Soc. 20, 309\u2013318 (1969)","journal-title":"J. Oper. Res. Soc."},{"key":"28_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108054","volume":"169","author":"K Corona-Guti\u00e9rrez","year":"2022","unstructured":"Corona-Guti\u00e9rrez, K., Nucamendi-Guill\u00e9n, S., Lalla-Ruiz, E.: Vehicle routing with cumulative objectives: a state of the art and analysis. Comput. Ind. Eng. 169, 108054 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"28_CR9","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. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez\u00a0Gil, A., Lalla-Ruiz, E., G\u00f3mez\u00a0S\u00e1nchez, M., Castro, C.: The cumulative vehicle routing problem with time windows: models and algorithm. Ann. Oper. Res. 1\u201329 (2023)","DOI":"10.1007\/s10479-022-05102-7"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Mousavi, R., Rahgoshay, M., Salavatipour, M.R.: Improved approximations for capacitated vehicle routing with unsplittable client demands. In: IPCO 2022. LNCS, vol. 13265, pp. 251\u2013261. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-06901-7_19"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1287\/trsc.2015.0593","volume":"50","author":"R Fukasawa","year":"2016","unstructured":"Fukasawa, R., He, Q., Song, Y.: A branch-cut-and-price algorithm for the energy minimization vehicle routing problem. Transp. Sci. 50(1), 23\u201334 (2016)","journal-title":"Transp. Sci."},{"issue":"6","key":"28_CR13","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1016\/j.orl.2013.07.007","volume":"41","author":"DR Gaur","year":"2013","unstructured":"Gaur, D.R., Mudgal, A., Singh, R.R.: Routing vehicles to minimize fuel consumption. Oper. Res. Lett. 41(6), 576\u2013580 (2013)","journal-title":"Oper. Res. Lett."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-29221-2_15","volume-title":"Algorithms and Discrete Applied Mathematics","author":"DR Gaur","year":"2016","unstructured":"Gaur, D.R., Mudgal, A., Singh, R.R.: Approximation algorithms for cumulative VRP with stochastic demands. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 176\u2013189. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_15"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.dam.2018.01.012","volume":"280","author":"DR Gaur","year":"2020","unstructured":"Gaur, D.R., Mudgal, A., Singh, R.R.: Improved approximation algorithms for cumulative VRP with stochastic demands. Discret. Appl. Math. 280, 133\u2013143 (2020)","journal-title":"Discret. Appl. Math."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.dam.2016.05.030","volume":"228","author":"DR Gaur","year":"2017","unstructured":"Gaur, D.R., Singh, R.R.: A heuristic for cumulative vehicle routing using column generation. Discret. Appl. Math. 228, 140\u2013157 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: Stochastic vehicle routing. Eur. J. Oper. Res. 88(1), 3\u201312 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"28_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/opre.1110.0967","volume":"60","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Technical note - approximation algorithms for VRP with stochastic demands. Oper. Res. 60(1), 123\u2013127 (2012)","journal-title":"Oper. Res."},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Kan, A.: Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"28_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-73556-4_9","volume-title":"Combinatorial Optimization and Applications","author":"\u0130 Kara","year":"2007","unstructured":"Kara, \u0130, Kara, B.Y., Yetis, M.K.: Energy minimizing vehicle routing problem. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 62\u201371. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_9"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Kara, \u0130, Kara, B.Y., Yetis, M.K.: Cumulative vehicle routing problems. IntechOpen Rijeka, HR (2008)","DOI":"10.5772\/5812"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP. In: STOC 2021, pp. 32\u201345. ACM (2021)","DOI":"10.1145\/3406325.3451009"},{"key":"28_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2022.100710","volume":"45","author":"MH Mulati","year":"2022","unstructured":"Mulati, M.H., Fukasawa, R., Miyazawa, F.K.: The arc-item-load and related formulations for the cumulative vehicle routing problem. Discret. Optim. 45, 100710 (2022)","journal-title":"Discret. Optim."},{"issue":"1","key":"28_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/trsc.23.1.46","volume":"23","author":"P Newman","year":"1989","unstructured":"Newman, P., Alimoradian, B., Lyons, T.: Estimating fleet fuel consumption for vans and small trucks. Transp. Sci. 23(1), 46\u201350 (1989)","journal-title":"Transp. Sci."},{"key":"28_CR26","unstructured":"Rinaldi, G., Yarrow, L.A.: Optimizing a 48-city traveling salesman problem: a case study in combinatorial problem solving. New York University, Graduate School of Business Administration (1985)"},{"issue":"1","key":"28_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.10.030","volume":"193","author":"B Sahin","year":"2009","unstructured":"Sahin, B., Yilmaz, H., Ust, Y., Guneri, A.F., Gulsun, B.: An approach for analysing transportation costs and a case study. Eur. J. Oper. Res. 193(1), 1\u201311 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR28","first-page":"76","volume":"17","author":"AI Serdyukov","year":"1978","unstructured":"Serdyukov, A.I.: Some extremal bypasses in graphs. Upravlyaemye Sistemy 17, 76\u201379 (1978)","journal-title":"Upravlyaemye Sistemy"},{"issue":"4","key":"28_CR29","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TSMC.2016.2606440","volume":"48","author":"X Wang","year":"2016","unstructured":"Wang, X., Choi, T.M., Liu, H., Yue, X.: A novel hybrid ant colony optimization algorithm for emergency transportation problems during post-disaster scenarios. IEEE Trans. Syst. Man Cybern. Syst. 48(4), 545\u2013556 (2016)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"7","key":"28_CR30","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.cor.2011.08.013","volume":"39","author":"Y Xiao","year":"2012","unstructured":"Xiao, Y., Zhao, Q., Kaku, I., Xu, Y.: Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput. Oper. Res. 39(7), 1419\u20131431 (2012)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-6576-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T05:38:57Z","timestamp":1749274737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-6576-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819665754","9789819665761"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-6576-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"8 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2024.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}