IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v63y2012i2p232-244.html
   My bibliography  Save this article

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows

Author

Listed:
  • L Moccia

    (ICAR−Consiglio Nazionale delle Ricerche, Rende, Cosenza, Italy)

  • J-F Cordeau

    (HEC Montréal, Montréal, Canada)

  • G Laporte

    (HEC Montréal, Montréal, Canada)

Abstract

This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach.

Suggested Citation

  • L Moccia & J-F Cordeau & G Laporte, 2012. "An incremental tabu search heuristic for the generalized vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 232-244, February.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:2:p:232-244
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n2/pdf/jors201125a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v63/n2/full/jors201125a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Jian Li & Yang Li & Panos M. Pardalos, 2016. "Multi-depot vehicle routing problem with time windows under shared depot resources," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 515-532, February.
    2. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    3. Michael Drexl, 2014. "A Generic Heuristic for Vehicle Routing Problems with Multiple Synchronization Constraints," Working Papers 1412, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 04 Nov 2014.
    4. Christian Tilk & Katharina Olkis & Stefan Irnich, 2020. "The Last-mile Vehicle Routing Problem with Delivery Options," Working Papers 2017, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    5. L. Di Puglia Pugliese & D. Ferone & P. Festa & F. Guerriero, 2022. "A generalized shortest path tour problem with time windows," Computational Optimization and Applications, Springer, vol. 83(2), pages 593-614, November.
    6. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    7. Di Puglia Pugliese, Luigi & Ferone, Daniele & Festa, Paola & Guerriero, Francesca, 2020. "Shortest path tour problem with time windows," European Journal of Operational Research, Elsevier, vol. 282(1), pages 334-344.
    8. Frey, Christian M.M. & Jungwirth, Alexander & Frey, Markus & Kolisch, Rainer, 2023. "The vehicle routing problem with time windows and flexible delivery locations," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1142-1159.
    9. Zelda B. Zabinsky & Pattamon Dulyakupt & Shabnam Zangeneh-Khamooshi & Cao Xiao & Pengbo Zhang & Seksan Kiatsupaibul & Joseph A. Heim, 2020. "Optimal collection of medical specimens and delivery to central laboratory," Annals of Operations Research, Springer, vol. 287(1), pages 537-564, April.
    10. Christian Tilk & Katharina Olkis & Stefan Irnich, 2021. "The last-mile vehicle routing problem with delivery options," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 877-904, December.
    11. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
    12. Chane-Haï Timothée & Vercraene Samuel & Monteiro Thibaud, 2023. "The assignment-dial-a-ride-problem," Health Care Management Science, Springer, vol. 26(4), pages 770-784, December.
    13. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    14. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    15. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
    16. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    17. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric, 2020. "A branch-and-cut algorithm for the generalized traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 286(3), pages 849-866.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:63:y:2012:i:2:p:232-244. 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.palgrave-journals.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.