IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v350y2025i1d10.1007_s10479-022-05102-7.html
   My bibliography  Save this article

The cumulative vehicle routing problem with time windows: models and algorithm

Author

Listed:
  • Alejandro Fernández Gil

    (Universidad Técnica Federico Santa María)

  • Eduardo Lalla-Ruiz

    (University of Twente)

  • Mariam Gómez Sánchez

    (Universidad Técnica Federico Santa María)

  • Carlos Castro

    (Universidad Técnica Federico Santa María)

Abstract

The cumulative vehicle routing problem with time windows (CumVRP-TW) is a vehicle routing variant that aims at minimizing a cumulative cost function while respecting customers’ time windows constraints. Mathematical formulations are proposed for soft and hard time windows constraints, where for the soft case, violations are permitted subject to penalization. By means of the cumulative objective and the time windows consideration, routing decisions incorporate the environmental impact related to CO $$_2$$ 2 emissions and permit obtaining a trade-off between emissions and time windows fulfillment. To solve this problem, we propose a matheuristic approach that combines the features of the Greedy Randomized Adaptive Search Procedure (GRASP) with the exact solution of the optimization model. The solution approaches are tested on instances proposed in the literature as well as on a new benchmark suite proposed for assessing the soft time windows variant. The computational results show that the mathematical formulations provide optimal solutions for scenarios of 10, 20, and several of 50 customers within suitable computational times. Nevertheless, the same performance is not observed for several medium as well as for all large scenarios. In those cases, the proposed matheuristic algorithm is able to report feasible and improved routes for those instances where the exact solver does not report good results. Finally, we verify that the fuel consumption and carbon emissions are reduced when the violation of the time windows is allowed in the case of soft time windows.

Suggested Citation

  • Alejandro Fernández Gil & Eduardo Lalla-Ruiz & Mariam Gómez Sánchez & Carlos Castro, 2025. "The cumulative vehicle routing problem with time windows: models and algorithm," Annals of Operations Research, Springer, vol. 350(1), pages 325-353, July.
    • Handle: RePEc:spr:annopr:v:350:y:2025:i:1:d:10.1007_s10479-022-05102-7
    DOI: 10.1007/s10479-022-05102-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05102-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-022-05102-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Iris Martínez-Salazar & Francisco Angel-Bello & Ada Alvarez, 2015. "A customer-centric routing problem with multiple trips of a single vehicle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(8), pages 1312-1323, August.
    2. Bektas, Tolga & Laporte, Gilbert, 2011. "The Pollution-Routing Problem," Transportation Research Part B: Methodological, Elsevier, vol. 45(8), pages 1232-1250, September.
    3. Hossain, Md Shahriar J. & Ohaiba, Mohamed M. & Sarker, Bhaba R., 2017. "An optimal vendor-buyer cooperative policy under generalized lead-time distribution with penalty cost for delivery lateness," International Journal of Production Economics, Elsevier, vol. 188(C), pages 50-62.
    4. Sahin, Bahri & Yilmaz, Huseyin & Ust, Yasin & Guneri, Ali Fuat & Gulsun, BahadIr, 2009. "An approach for analysing transportation costs and a case study," European Journal of Operational Research, Elsevier, vol. 193(1), pages 1-11, February.
    5. Leonard Heilig & Eduardo Lalla-Ruiz & Stefan Voß, 2017. "port-IO: an integrative mobile cloud platform for real-time inter-terminal truck routing optimization," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 504-534, December.
    6. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2014. "A review of recent research on green road freight transportation," European Journal of Operational Research, Elsevier, vol. 237(3), pages 775-793.
    7. Kramer, Raphael & Subramanian, Anand & Vidal, Thibaut & Cabral, Lucídio dos Anjos F., 2015. "A matheuristic approach for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 243(2), pages 523-539.
    8. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    9. Abbas Tarhini & Kassem Danach & Antoine Harfouche, 2022. "Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers," Annals of Operations Research, Springer, vol. 308(1), pages 549-570, January.
    10. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    11. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.
    12. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    13. Weiheng Zhang & Yuvraj Gajpal & Srimantoorao. S. Appadoo & Qi Wei, 2020. "Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions," Sustainability, MDPI, vol. 12(8), pages 1-19, April.
    14. Macrina, Giusy & Laporte, Gilbert & Guerriero, Francesca & Di Puglia Pugliese, Luigi, 2019. "An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows," European Journal of Operational Research, Elsevier, vol. 276(3), pages 971-982.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iouri Semenov & Marianna Jacyna & Izabela Auguściak & Mariusz Wasiak, 2025. "Hybrid Human–AI Collaboration for Optimized Fuel Delivery Management," Energies, MDPI, vol. 18(19), pages 1-25, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    2. Emna Marrekchi & Walid Besbes & Diala Dhouib & Emrah Demir, 2021. "A review of recent advances in the operations research literature on the green routing problem and its variants," Annals of Operations Research, Springer, vol. 304(1), pages 529-574, September.
    3. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    4. Goeke, Dominik & Schneider, Michael, 2015. "Routing a mixed fleet of electric and conventional vehicles," European Journal of Operational Research, Elsevier, vol. 245(1), pages 81-99.
    5. Behnke, Martin & Kirschstein, Thomas & Bierwirth, Christian, 2021. "A column generation approach for an emission-oriented vehicle routing problem on a multigraph," European Journal of Operational Research, Elsevier, vol. 288(3), pages 794-809.
    6. Ehmke, Jan Fabian & Campbell, Ann Melissa & Thomas, Barrett W., 2016. "Vehicle routing to minimize time-dependent emissions in urban areas," European Journal of Operational Research, Elsevier, vol. 251(2), pages 478-494.
    7. Goeke, D. & Schneider, M., 2015. "Routing a Mixed Fleet of Electric and Conventional Vehicles," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65939, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Franceschetti, Anna & Demir, Emrah & Honhon, Dorothée & Van Woensel, Tom & Laporte, Gilbert & Stobbe, Mark, 2017. "A metaheuristic for the time-dependent pollution-routing problem," European Journal of Operational Research, Elsevier, vol. 259(3), pages 972-991.
    9. Qiu, Rui & Xu, Jiuping & Ke, Ruimin & Zeng, Ziqiang & Wang, Yinhai, 2020. "Carbon pricing initiatives-based bi-level pollution routing problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 203-217.
    10. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    11. Liu, Yiming & Yu, Yang & Baldacci, Roberto & Tang, Jiafu & Sun, Wei, 2025. "Optimizing carbon emissions in green logistics for time-dependent routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    12. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    13. Kramer, Raphael & Subramanian, Anand & Vidal, Thibaut & Cabral, Lucídio dos Anjos F., 2015. "A matheuristic approach for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 243(2), pages 523-539.
    14. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).
    15. Brunner, Carlos & Giesen, Ricardo & Klapp, Mathias A. & Flórez-Calderón, Luz, 2021. "Vehicle routing problem with steep roads," Transportation Research Part A: Policy and Practice, Elsevier, vol. 151(C), pages 1-17.
    16. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    17. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    18. Jose Carlos Molina & Ignacio Eguia & Jesus Racero, 2019. "Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 253-287, July.
    19. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The impact of depot location, fleet composition and routing on emissions in city logistics," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 81-102.
    20. Erfan Ghorbani & Mahdi Alinaghian & Gevork. B. Gharehpetian & Sajad Mohammadi & Guido Perboli, 2020. "A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification," Sustainability, MDPI, vol. 12(21), pages 1-71, October.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:350:y:2025:i:1:d:10.1007_s10479-022-05102-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.