IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-20430-7_10.html
   My bibliography  Save this book chapter

A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows

In: Computational Management Science

Author

Listed:
  • Vincent Huart

    (GERAD and HEC Montréal)

  • Sylvain Perron

    (GERAD and HEC Montréal)

  • Gilles Caporossi

    (GERAD and HEC Montréal)

  • Christophe Duhamel

    (LIMOS, Université Blaise Pascal)

Abstract

We consider the Time-Dependent Vehicle Routing Problem (tdvrptw), a generalization of the Vehicle Routing Problem with Time Windows (vrptw) where the travel time between any pair of clients can vary over the time. Its purpose is to better handle the dynamic nature of the travel time, especially in urban areas where traffic congestion can have a significant impact on the transportation. We propose a heuristic based on column generation and on Variable Neighborhood Descent (vnd) for solving the tdvrptw. Several neighborhoods are used to identify improving columns at each iteration of the column generation process. Those columns are then stored in a shared pool. In the same time, the integer master problem is solved and its solution is then improved by the vnd. Both total distance and number of vehicle criteria are considered. Numerical results are then presented to show the interest of our approach.

Suggested Citation

  • Vincent Huart & Sylvain Perron & Gilles Caporossi & Christophe Duhamel, 2016. "A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 73-78, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-20430-7_10
    DOI: 10.1007/978-3-319-20430-7_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aarabi, Fatemeh & Batta, Rajan, 2020. "Scheduling spatially distributed jobs with degradation: Application to pothole repair," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).
    2. Guo, Feng & Wei, Qu & Wang, Miao & Guo, Zhaoxia & Wallace, Stein W., 2023. "Deep attention models with dimension-reduction and gate mechanisms for solving practical time-dependent vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).

    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:spr:lnechp:978-3-319-20430-7_10. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.