IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v249y2016i1p93-104.html
   My bibliography  Save this article

Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem

Author

Listed:
  • Rivera, Juan Carlos
  • Murat Afsar, H.
  • Prins, Christian

Abstract

This paper addresses the multitrip Cumulative Capacitated Single-Vehicle Routing Problem (mt-CCSVRP). In this problem inspired by disaster logistics, a single vehicle can perform successive trips to serve a set of affected sites and minimize an emergency criterion, the sum of arrival times. Two mixed integer linear programs, a flow-based model and a set partitioning model, are proposed for small instances with 20 sites. An exact algorithm for larger cases transforms the mt-CCSVRP into a resource-constrained shortest path problem where each node corresponds to one trip and the sites to visit become resources. The resulting problem can be solved via an adaptation of Bellman–Ford algorithm to a directed acyclic graph with resource constraints and a cumulative objective function. Seven dominance rules, two upper bounds and five lower bounds speed up the procedure. Computational results on instances derived from classical benchmark problems for the capacitated VRP indicate that the exact algorithm outperforms a commercial MIP solver on small instances and can solve cases with 40 sites to optimality.

Suggested Citation

  • Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    • Handle: RePEc:eee:ejores:v:249:y:2016:i:1:p:93-104
    DOI: 10.1016/j.ejor.2015.08.067
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715008267
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.08.067?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Boland, N. L. & Clarke, L. W. & Nemhauser, G. L., 2000. "The asymmetric traveling salesman problem with replenishment arcs," European Journal of Operational Research, Elsevier, vol. 123(2), pages 408-427, June.
    2. Lysgaard, Jens & Wøhlk, Sanne, 2014. "A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 800-810.
    3. Gouveia, Luis & Vo[ss], Stefan, 1995. "A classification of formulations for the (time-dependent) traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 69-82, May.
    4. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    5. SALEHIPOUR, Amir & SÖRENSEN, Kenneth & GOOS, Peter & BRÄYSY, Olli, 2008. "An efficient GRASP+VND metaheuristic for the traveling repairman problem," Working Papers 2008008, University of Antwerp, Faculty of Business and Economics.
    6. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2007. "An exact algorithm for a single-vehicle routing problem with time windows and multiple routes," European Journal of Operational Research, Elsevier, vol. 178(3), pages 755-766, May.
    7. Jean-Claude Picard & Maurice Queyranne, 1978. "The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling," Operations Research, INFORMS, vol. 26(1), pages 86-110, February.
    8. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    9. Juan Rivera & H. Afsar & Christian Prins, 2015. "A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem," Computational Optimization and Applications, Springer, vol. 61(1), pages 159-187, May.
    10. Robert F. Dell & Rajan Batta & Mark H. Karwan, 1996. "The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon," Transportation Science, INFORMS, vol. 30(2), pages 120-133, May.
    11. Ann Melissa Campbell & Dieter Vandenbussche & William Hermann, 2008. "Routing for Relief Efforts," Transportation Science, INFORMS, vol. 42(2), pages 127-145, May.
    12. Galindo, Gina & Batta, Rajan, 2013. "Review of recent developments in OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 230(2), pages 201-211.
    13. Matteo Fischetti & Gilbert Laporte & Silvano Martello, 1993. "The Delivery Man Problem and Cumulative Matroids," Operations Research, INFORMS, vol. 41(6), pages 1055-1064, December.
    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. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    2. Ajam, Meraj & Akbari, Vahid & Salman, F. Sibel, 2022. "Routing multiple work teams to minimize latency in post-disaster road network restoration," European Journal of Operational Research, Elsevier, vol. 300(1), pages 237-254.
    3. J. Molina & A. D. López-Sánchez & A. G. Hernández-Díaz & I. Martínez-Salazar, 2018. "A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems," Journal of Heuristics, Springer, vol. 24(2), pages 111-133, April.
    4. Wang, Li & Yang, Lixing & Gao, Ziyou, 2016. "The constrained shortest path problem with stochastic correlated link travel times," European Journal of Operational Research, Elsevier, vol. 255(1), pages 43-57.
    5. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    6. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
    7. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    8. Maliheh Khorsi & Seyed Kamal Chaharsooghi & Ali Husseinzadeh Kashan & Ali Bozorgi-Amiri, 2022. "Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm," Annals of Operations Research, Springer, vol. 319(1), pages 173-210, December.
    9. Sze, Jeeu Fong & Salhi, Said & Wassan, Niaz, 2017. "The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 162-184.

    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. Juan Rivera & H. Afsar & Christian Prins, 2015. "A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem," Computational Optimization and Applications, Springer, vol. 61(1), pages 159-187, May.
    2. Roberto Roberti & Aristide Mingozzi, 2014. "Dynamic ng-Path Relaxation for the Delivery Man Problem," Transportation Science, INFORMS, vol. 48(3), pages 413-424, August.
    3. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    4. F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    5. Jan Mikula & Miroslav Kulich, 2022. "Solving the traveling delivery person problem with limited computational time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1451-1481, December.
    6. David A. Flores-Garza & M. Angélica Salazar-Aguilar & Sandra Ulrich Ngueveu & Gilbert Laporte, 2017. "The multi-vehicle cumulative covering tour problem," Annals of Operations Research, Springer, vol. 258(2), pages 761-780, November.
    7. Sze, Jeeu Fong & Salhi, Said & Wassan, Niaz, 2017. "The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 162-184.
    8. Diaz, Rafael & Behr, Joshua G. & Acero, Beatriz, 2022. "Coastal housing recovery in a postdisaster environment: A supply chain perspective," International Journal of Production Economics, Elsevier, vol. 247(C).
    9. Ricardo Fukasawa & Qie He & Yongjia Song, 2016. "A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(1), pages 23-34, February.
    10. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    11. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    12. Arslan, Okan & Kumcu, Gül Çulhan & Kara, Bahar Yetiş & Laporte, Gilbert, 2021. "The location and location-routing problem for the refugee camp network design," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 201-220.
    13. Özdamar, Linet & Ertem, Mustafa Alp, 2015. "Models, solutions and enabling technologies in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 55-65.
    14. Gutjahr, Walter J. & Nolz, Pamela C., 2016. "Multicriteria optimization in humanitarian aid," European Journal of Operational Research, Elsevier, vol. 252(2), pages 351-366.
    15. Ling Liu & Wenli Li & Kunpeng Li & Xuxia Zou, 2020. "A coordinated production and transportation scheduling problem with minimum sum of order delivery times," Journal of Heuristics, Springer, vol. 26(1), pages 33-58, February.
    16. Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.
    17. Albert Einstein Fernandes Muritiba & Tibérius O. Bonates & Stênio Oliveira Da Silva & Manuel Iori, 2021. "Branch-and-Cut and Iterated Local Search for the Weighted k -Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras," Transportation Science, INFORMS, vol. 55(1), pages 139-159, 1-2.
    18. Miranda-Bront, Juan José & Méndez-Díaz, Isabel & Zabala, Paula, 2014. "Facets and valid inequalities for the time-dependent travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 891-902.
    19. Caio Marinho Damião & João Marcos Pereira Silva & Eduardo Uchoa, 2023. "A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem," 4OR, Springer, vol. 21(1), pages 47-71, March.
    20. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.

    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:eee:ejores:v:249:y:2016:i:1:p:93-104. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.