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

A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem

Author

Listed:
  • Jiefeng Xu

    (Graduate School of Business, University of Colorado at Boulder, Boulder, Colorado 80309-0419)

  • James P. Kelly

    (Graduate School of Business, University of Colorado at Boulder, Boulder, Colorado 80309-0419)

Abstract

We develop a new local search approach based on a network flow model that is used to simultaneously evaluate several customer ejection and insertion moves. We use this approach and a direct customer swap procedure to solve the well-known Vehicle Routing Problem. The capacity constraints are relaxed using penalty terms whose parameter values are adjusted according to time and search feedback. Tabu Search is incorporated into the procedure to overcome local optimality. More advanced issues such as intensification and diversification strategies are developed to provide effective enhancements to the basic tabu search algorithm. Computational experience on standard test problems is discussed and comparisons with best-known solutions are provided.

Suggested Citation

  • Jiefeng Xu & James P. Kelly, 1996. "A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem," Transportation Science, INFORMS, vol. 30(4), pages 379-393, November.
    • Handle: RePEc:inm:ortrsc:v:30:y:1996:i:4:p:379-393
    DOI: 10.1287/trsc.30.4.379
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2004. "A decision support system for a real vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 153(3), pages 593-606, March.
    2. Lucio Martins, Carlos & Vaz Pato, Margarida, 1998. "Search strategies for the feeder bus network design problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 425-440, April.
    3. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    4. Xu, Jiefeng & Sohoni, Milind & McCleery, Mike & Bailey, T. Glenn, 2006. "A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems," European Journal of Operational Research, Elsevier, vol. 169(3), pages 978-993, March.
    5. Eric Angel & Evripidis Bampis & Fanny Pascual, 2008. "An exponential (matching based) neighborhood for the vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 179-190, February.
    6. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
    7. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    8. James P. Kelly & Jiefeng Xu, 1999. "A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 161-172, May.
    9. Guido Perboli & Ferdinando Pezzella & Roberto Tadei, 2008. "EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 361-382, October.
    10. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    11. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    12. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.
    13. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 313-336, September.
    14. N A Wassan, 2006. "A reactive tabu search for the vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 111-116, January.
    15. Jiefeng Xu & Steve Y. Chiu & Fred Glover, 1999. "Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search," Management Science, INFORMS, vol. 45(3), pages 330-345, March.

    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:inm:ortrsc:v:30:y:1996:i:4:p:379-393. 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.