{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:29:47Z","timestamp":1752283787745,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030597467"},{"type":"electronic","value":"9783030597474"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-59747-4_18","type":"book-chapter","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T11:02:30Z","timestamp":1601118150000},"page":"277-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cumulative VRP with Time Windows: A Trade-Off Analysis"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Fern\u00e1ndez Gil","sequence":"first","affiliation":[]},{"given":"Mariam","family":"G\u00f3mez S\u00e1nchez","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10479-009-0651-z","volume":"175","author":"A Sbihi","year":"2010","unstructured":"Sbihi, A., Eglese, R.W.: Combinatorial optimization and green logistics. Ann. Oper. Res. 175(1), 159\u2013175 (2010). \n                    https:\/\/doi.org\/10.1007\/s10479-009-0651-z","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"18_CR2","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."},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2013.12.033","volume":"237","author":"E Demir","year":"2014","unstructured":"Demir, E., Bekta\u015f, T., Laporte, G.: A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3), 775\u2013793 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"18_CR4","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":"18_CR5","doi-asserted-by":"crossref","unstructured":"Kara, \u0130., Kara, B.Y., Yeti\u015f, M.K.: Cumulative vehicle routing problems. In: Vehicle Routing Problem, pp. 85\u201398. In-Teh (2008)","DOI":"10.5772\/5812"},{"key":"18_CR6","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). \n                    https:\/\/doi.org\/10.1007\/978-3-540-73556-4_9"},{"key":"18_CR7","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-69215-9_3","volume-title":"Sustainable Logistics and Transportation","author":"RR Singh","year":"2017","unstructured":"Singh, R.R., Gaur, D.R.: Cumulative VRP: a simplified model of green vehicle routing. In: Cinar, D., Gakis, K., Pardalos, P.M. (eds.) Sustainable Logistics and Transportation. SOIA, vol. 129, pp. 39\u201355. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-69215-9_3"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Madsen, O.B.G., Ropke, S.: The vehicle routing problem with time windows (chap. 5). In: Vehicle Routing: Problems, Methods, and Applications, 2nd edn., pp. 119\u2013159. SIAM (2014)","DOI":"10.1137\/1.9781611973594.ch5"},{"issue":"7","key":"18_CR10","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.cor.2006.11.006","volume":"35","author":"B Kallehauge","year":"2008","unstructured":"Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7), 2307\u20132330 (2008). Part Special Issue: Includes selected papers presented at the ECCO 2004 European Conference on combinatorial Optimization","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","volume":"131","author":"K Fagerholt","year":"2001","unstructured":"Fagerholt, K.: Ship scheduling with soft time windows: an optimisation based approach. Eur. J. Oper. Res. 131(3), 559\u2013571 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2018.06.001","volume":"274","author":"T Bekta\u015f","year":"2019","unstructured":"Bekta\u015f, T., Ehmke, J.F., Psaraftis, H.N., Puchinger, J.: The role of operational research in green freight transportation. Eur. J. Oper. Res. 274(3), 807\u2013823 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Lin, C., Choy, K.L., Ho, G.T.S., Chung, S.H., Lam, H.Y.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4, Part 1), 1118\u20131138 (2014)","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-14974-5_25","volume-title":"Algorithms and Discrete Applied Mathematics","author":"DR Gaur","year":"2015","unstructured":"Gaur, D.R., Singh, R.R.: Cumulative vehicle routing problem: a column generation approach. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 262\u2013274. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-14974-5_25"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.-Y., et al.: Handbook of Metaheuristics, vol. 2. Springer, Cham (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-319-91086-4"},{"key":"18_CR17","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-69215-9_4","volume-title":"Sustainable Logistics and Transportation","author":"D Cinar","year":"2017","unstructured":"Cinar, D., Cayir Ervural, B., Gakis, K., Pardalos, P.M.: Constructive algorithms for the cumulative vehicle routing problem with limited duration. In: Cinar, D., Gakis, K., Pardalos, P.M. (eds.) Sustainable Logistics and Transportation. SOIA, vol. 129, pp. 57\u201386. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-69215-9_4"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10666-014-9434-2","volume":"20","author":"D Cinar","year":"2015","unstructured":"Cinar, D., Gakis, K., Pardalos, P.M.: Reduction of co2 emissions in cumulative multi-trip vehicle routing problems with limited duration. Environ. Model. Assess. 20(4), 273\u2013284 (2015). \n                    https:\/\/doi.org\/10.1007\/s10666-014-9434-2","journal-title":"Environ. Model. Assess."},{"issue":"11","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11), 1877\u20131885 (2010). Metaheuristics for Logistics and Vehicle Routing","journal-title":"Comput. Oper. Res."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.eswa.2018.07.025","volume":"113","author":"S Nucamendi-Guill\u00e9n","year":"2018","unstructured":"Nucamendi-Guill\u00e9n, S., Angel-Bello, F., Mart\u00ednez-Salazar, I., Cordero-Franco, A.E.: The cumulative capacitated vehicle routing problem: new formulations and iterated greedy algorithms. Expert Syst. Appl. 113, 315\u2013327 (2018)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optimiz. 2(4), 223\u2013246 (2014). \n                    https:\/\/doi.org\/10.1007\/s13675-014-0030-7","journal-title":"EURO J. Comput. Optimiz."},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-00898-7_16","volume-title":"Computational Logistics","author":"CS Sartori","year":"2018","unstructured":"Sartori, C.S., Buriol, L.S.: A matheuristic approach to the pickup and delivery problem with time windows. In: Cerulli, R., Raiconi, A., Vo\u00df, S. (eds.) ICCL 2018. LNCS, vol. 11184, pp. 253\u2013267. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-00898-7_16"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11590-018-1376-1","volume":"14","author":"E Lalla-Ruiz","year":"2019","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem. Optimiz. Lett. 14, 671\u2013691 (2019). \n                    https:\/\/doi.org\/10.1007\/s11590-018-1376-1","journal-title":"Optimiz. Lett."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2018.06.019","volume":"100","author":"M Keskin","year":"2018","unstructured":"Keskin, M., \u00c7atay, B.: A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100, 172\u2013188 (2018)","journal-title":"Comput. Oper. Res."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.cor.2017.03.004","volume":"84","author":"P Grangier","year":"2017","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.-M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116\u2013126 (2017)","journal-title":"Comput. Oper. Res."},{"key":"18_CR26","unstructured":"Kramer, R., Subramanian, A., Vidal, T., Luc\u00eddio dos Anjos, F.C.: A matheuristic approach for the pollution-routing problem. Eur. J. Oper. Res. 243(2), 523\u2013539 (2015)"},{"issue":"1\u20132","key":"18_CR27","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10472-014-9444-4","volume":"76","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: POPMUSIC as a matheuristic for the berth allocation problem. Ann. Math. Artif. Intell. 76(1\u20132), 173\u2013189 (2016). \n                    https:\/\/doi.org\/10.1007\/s10472-014-9444-4","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optimiz. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optimiz."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, M.G., Gil, A.F., Castro, C.: Integrating a SMT solver based local search in ant colony optimization for solving RCMPSP. In: 2019 IEEE Latin American Conference on Computational Intelligence, LA-CCI, pp. 1\u20136 (2019)","DOI":"10.1109\/LA-CCI47412.2019.9036765"},{"issue":"2","key":"18_CR30","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.ejor.2012.06.044","volume":"223","author":"E Demir","year":"2012","unstructured":"Demir, E., Bekta\u015f, T., Laporte, G.: An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2), 346\u2013359 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR31","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: Proceedings of the 22nd National Conference on Artificial Intelligence - Volume 2, AAAI 2007, pp. 1152\u20131157. AAAI Press (2007)"},{"key":"18_CR32","unstructured":"Food Statistics Pocketbook Defra and Ecosystems Evidence Plan. Department for environment. Food and Rural Affairs (2010)"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59747-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T10:10:57Z","timestamp":1604571057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59747-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597467","9783030597474"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59747-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","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":"iccl22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2020.nl\/","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":"73","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":"49","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":"67% - 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":"2,5","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)"}}]}}