IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v29y2017i3p489-502.html
   My bibliography  Save this article

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows

Author

Listed:
  • Diego Pecin

    (Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal QC H3T 1J4, Canada; and Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, QC H3T 2A7, Canada)

  • Claudio Contardo

    (Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, QC H3T 2A7, Canada; and Département de management et technologie, ESG UQÀM, Montréal, QC H2X 3X2, Canada)

  • Guy Desaulniers

    (Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal QC H3T 1J4, Canada; and Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, QC H3T 2A7, Canada)

  • Eduardo Uchoa

    (Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, QC H3T 2A7, Canada; and Département de management et technologie, ESG UQÀM, Montréal, QC H2X 3X2, Canada)

Abstract

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited within specific time windows. We introduce two enhancements for the exact solution of the VRPTW by branch-price-and-cut (BPC). First, we develop a sharper form of the limited-memory subset-row inequalities by representing the memory as an arc subset rather than a node subset. Second, from the elementary inequalities introduced by Balas in 1977, we derive a family of inequalities that dominate them. These enhancements are embedded into an exact BPC algorithm that includes state-of-the-art features such as bidirectional labeling, decremental state-space relaxation, completion bounds, variable fixing, and route enumeration. Computational results show that these enhancements are particularly effective for the most difficult instances and that our BPC algorithm can solve all 56 Solomon instances with 100 customers and 51 of 60 Gehring and Homberger instances with 200 customers.

Suggested Citation

  • Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    • Handle: RePEc:inm:orijoc:v:29:y:2017:i:3:p:489-502
    DOI: 10.1287/ijoc.2016.0744
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2016.0744
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2016.0744?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
    ---><---

    References listed on IDEAS

    as
    1. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    2. Martinelli, Rafael & Pecin, Diego & Poggi, Marcus, 2014. "Efficient elementary and restricted non-elementary route pricing," European Journal of Operational Research, Elsevier, vol. 239(1), pages 102-111.
    3. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    4. 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.
    5. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    6. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    7. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    8. Roberto Baldacci & Aristide Mingozzi & Roberto Roberti, 2011. "New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1269-1283, October.
    9. Haroldo G. Santos & Túlio A. M. Toffolo & Rafael A. M. Gomes & Sabir Ribas, 2016. "Integer programming techniques for the nurse rostering problem," Annals of Operations Research, Springer, vol. 239(1), pages 225-251, April.
    10. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    11. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    12. Moshe Dror, 1994. "Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW," Operations Research, INFORMS, vol. 42(5), pages 977-978, October.
    13. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    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. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    2. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    3. Asvin Goel & Stefan Irnich, 2017. "An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems," Transportation Science, INFORMS, vol. 51(2), pages 737-754, May.
    4. Qie He & Stefan Irnich & Yongjia Song, 2018. "Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Working Papers 1804, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    6. Christian Tilk & Ann-Kathrin Rothenbächer & Timo Gschwind & Stefan Irnich, 2016. "Asymmetry Helps: Dynamic Half-Way Points for Solving Shortest Path Problems with Resource Constraints Faster," Working Papers 1615, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    7. Tilk, Christian & Rothenbächer, Ann-Kathrin & Gschwind, Timo & Irnich, Stefan, 2017. "Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster," European Journal of Operational Research, Elsevier, vol. 261(2), pages 530-539.
    8. Yiming Liu & Yang Yu & Yu Zhang & Roberto Baldacci & Jiafu Tang & Xinggang Luo & Wei Sun, 2023. "Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 14-30, January.
    9. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    10. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    11. Qie He & Stefan Irnich & Yongjia Song, 2019. "Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs," Transportation Science, INFORMS, vol. 53(5), pages 1409-1426, September.
    12. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
    13. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    14. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    15. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.
    16. Christian Tilk, 2016. "Branch-and-Price-and-Cut for the Vehicle Routing and Truck Driver Scheduling Problem," Working Papers 1616, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. Miao Yu & Viswanath Nagarajan & Siqian Shen, 2022. "Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 953-973, March.
    18. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
    19. Stefan Faldum & Sarah Machate & Timo Gschwind & Stefan Irnich, 2024. "Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(4), pages 1063-1097, December.
    20. Borzou Rostami & Guy Desaulniers & Fausto Errico & Andrea Lodi, 2021. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times," Operations Research, INFORMS, vol. 69(2), pages 436-455, 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:inm:orijoc:v:29:y:2017:i:3:p:489-502. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.