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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.