IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v58y2024i5p1101-1120.html
   My bibliography  Save this article

The Vehicle Routing Problem with Access Restrictions

Author

Listed:
  • Munise Kübra Şahin

    (ORSTAT, Faculty of Economics and Business, KU Leuven, 3000 Leuven, Belgium)

  • Hande Yaman

    (ORSTAT, Faculty of Economics and Business, KU Leuven, 3000 Leuven, Belgium)

Abstract

To mitigate the negative effects of freight vehicles on urban areas, many cities have implemented road accessibility restrictions, including limited traffic zones, which restrict access to specific areas during certain times of the day. Implementing these zones creates a tradeoff between the delivery cost and time, even under the assumption of equal traversal time and travel cost. Consequently, the planners in charge of vehicle routing need to work with graphs containing information on all Pareto-optimal paths. Inspired by these changes in city logistics and the resulting computational challenges, we study the vehicle routing problem with access restrictions, where some streets are closed to traffic within a given time period. We formulate this problem using workday variables and propose two branch and price algorithms based on the underlying road network and multigraph. The results of our computational experiments demonstrate the effectiveness of the proposed algorithms, solving instances with up to 100 nodes and 33 customers, and underline the importance of considering alternative paths in reducing costs.

Suggested Citation

  • Munise Kübra Şahin & Hande Yaman, 2024. "The Vehicle Routing Problem with Access Restrictions," Transportation Science, INFORMS, vol. 58(5), pages 1101-1120, September.
    • Handle: RePEc:inm:ortrsc:v:58:y:2024:i:5:p:1101-1120
    DOI: 10.1287/trsc.2023.0261
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2023.0261
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2023.0261?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
    ---><---

    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:ortrsc:v:58:y:2024:i:5:p:1101-1120. 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: 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.