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

Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem

Author

Listed:
  • Rist, Yannik
  • Tilk, Christian
  • Forbes, Michael

Abstract

We investigate a new exact solution approach for the Active Passive Vehicle Routing Problem, a vehicle routing problem with complicated temporal synchronisation requirements between vehicles. A key contribution is the introduction of a new principle, Delayed Disaggregation, for Benders Decomposition to produce disaggregated optimality cuts when traditional block-diagonality fails. The technique is applied to a new Mixed Integer Programming formulation of the Active Passive Vehicle Routing Problem. The formulation is built on coupled movements between active and passive vehicles, and solved using Combinatorial Benders Decomposition. The synchronisation constraints result in an interesting subproblem for which we present a tailored algorithm. The new method outperformed the existing Branch-and-Price method by two orders of magnitude and solves 74 instances to optimality for the first time. We investigate the performance impact of route enumeration, a heuristic and valid inequalities on the base Benders algorithm.

Suggested Citation

  • Rist, Yannik & Tilk, Christian & Forbes, Michael, 2024. "Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 836-850.
    • Handle: RePEc:eee:ejores:v:318:y:2024:i:3:p:836-850
    DOI: 10.1016/j.ejor.2024.05.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172400420X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.05.041?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. Grangier, Philippe & Gendreau, Michel & Lehuédé, Fabien & Rousseau, Louis-Martin, 2016. "An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization," European Journal of Operational Research, Elsevier, vol. 254(1), pages 80-91.
    2. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2018. "Scheduled service network design with resource acquisition and management," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 277-309, September.
    3. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.
    4. Cheung, Raymond K. & Shi, Ning & Powell, Warren B. & Simao, Hugo P., 2008. "An attribute-decision model for cross-border drayage problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(2), pages 217-234, March.
    5. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    6. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    7. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2016. "Service Network Design with Resource Constraints," Transportation Science, INFORMS, vol. 50(4), pages 1380-1393, November.
    8. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
    9. Matteo Fischetti & Ivana Ljubić & Markus Sinnl, 2017. "Redesigning Benders Decomposition for Large-Scale Facility Location," Management Science, INFORMS, vol. 63(7), pages 2146-2162, July.
    10. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Rasinmäki, Jussi, 2019. "Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: A case-study in the biomass supply chain," European Journal of Operational Research, Elsevier, vol. 277(1), pages 174-194.
    11. Seyed Mostafa Mirhedayatian & Teodor Gabriel Crainic & Mario Guajardo & Stein W. Wallace, 2021. "A two-echelon location-routing problem with synchronisation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(1), pages 145-160, January.
    12. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    13. Ilke Bakir & Alan Erera & Martin Savelsbergh, 2021. "Motor Carrier Service Network Design," Springer Books, in: Teodor Gabriel Crainic & Michel Gendreau & Bernard Gendron (ed.), Network Design with Applications to Transportation and Logistics, chapter 0, pages 427-467, Springer.
    14. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    15. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    16. Christian Tilk & Nicola Bianchessi & Michael Drexl & Stefan Irnich & Frank Meisel, 2018. "Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 52(2), pages 300-319, March.
    17. Lawrence Bodin & Aristide Mingozzi & Roberto Baldacci & Michael Ball, 2000. "The Rollon–Rolloff Vehicle Routing Problem," Transportation Science, INFORMS, vol. 34(3), pages 271-288, August.
    Full references (including those not matched with items on IDEAS)

    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. Christian Tilk & Michael Forbes, 2019. "Branch-and-Cut for the Active-Passive Vehicle Routing Problem," Working Papers 1915, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    3. Michael Drexl, 2021. "On the one-to-one pickup-and-delivery problem with time windows and trailers," 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. 29(3), pages 1115-1162, September.
    4. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Nieto-Isaza, Santiago & Fontaine, Pirmin & Minner, Stefan, 2022. "The value of stochastic crowd resources and strategic location of mini-depots for last-mile delivery: A Benders decomposition approach," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 62-79.
    6. Michael Drexl, 2021. "On efficient testing of capacity constraints in pickup-and-delivery problems with trailers," 4OR, Springer, vol. 19(2), pages 289-307, June.
    7. Michael Drexl, 2018. "On Testing Capacity Constraints in Pickup-and-Delivery Problems with Trailers in Amortized Constant Time," Working Papers 1823, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    9. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    10. Christian Tilk & Nicola Bianchessi & Michael Drexl & Stefan Irnich & Frank Meisel, 2015. "Branch-and-Price for the Active-Passive Vehicle-Routing Problem," Working Papers 1513, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    12. Tilk, Christian & Drexl, Michael & Irnich, Stefan, 2019. "Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies," European Journal of Operational Research, Elsevier, vol. 276(2), pages 549-565.
    13. Guo, Penghui & Zhu, Jianjun, 2023. "Capacity reservation for humanitarian relief: A logic-based Benders decomposition method with subgradient cut," European Journal of Operational Research, Elsevier, vol. 311(3), pages 942-970.
    14. Alvo, Matías & Angulo, Gustavo & Klapp, Mathias A., 2021. "An exact solution approach for an electric bus dispatch problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    15. Grigorios D. Konstantakopoulos & Sotiris P. Gayialis & Evripidis P. Kechagias, 2022. "Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification," Operational Research, Springer, vol. 22(3), pages 2033-2062, July.
    16. Pashapour, Amirreza & Günneç, Dilek & Salman, F. Sibel & Yücel, Eda, 2024. "Capacitated Mobile Facility Location Problem with Mobile Demand: Efficient Relief Aid Provision to En Route Refugees," Omega, Elsevier, vol. 129(C).
    17. Wang, Naiyu & Meng, Qiang & Zhang, Canrong, 2023. "A branch-price-and-cut algorithm for the local container drayage problem with controllable vehicle interference," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    18. Yu, Shaohua & Puchinger, Jakob & Sun, Shudong, 2022. "Van-based robot hybrid pickup and delivery routing problem," European Journal of Operational Research, Elsevier, vol. 298(3), pages 894-914.
    19. Li, Hongqi & Chen, Jun & Wang, Feilong & Bai, Ming, 2021. "Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: A review," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1078-1095.
    20. Christian Tilk & Nicola Bianchessi & Michael Drexl & Stefan Irnich & Frank Meisel, 2018. "Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 52(2), pages 300-319, March.

    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:318:y:2024:i:3:p:836-850. 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.