Journal of the Operational Research Society

, Volume 63, Issue 2, pp 232–244 | Cite as

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

General Paper

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.

Keywords

generalized vehicle routing problem time windows tabu search large neighbourhood search 

References

  1. Ahuja RK, Magnanti TL and Orlin J (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall: Englewood Cliffs, NJ.Google Scholar
  2. Baldacci R, Bartolini E and Laporte G (2010). Some applications of the generalized vehicle routing problem. J Opl Res Soc 61 (7): 1072–1077.CrossRefGoogle Scholar
  3. Bektaş T and Elmastaş S (2007). Solving school bus routing problems through integer programming. J Opl Res Soc 58 (12): 1599–1604.CrossRefGoogle Scholar
  4. Bektaş T, Erdoğan G and Ropke S (2011). Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transport Sci, published online before print 18 February, Doi: 10.1287/trsc.1100.0352.Google Scholar
  5. Bontoux B, Artigues C and Feillet D (2010). A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Comput Opns Res 37 (11): 1844–1852.CrossRefGoogle Scholar
  6. Corberán A, Fernández E, Laguna M and Martí R (2002). Heuristic solutions to the problem of routing school buses with multiple objectives. J Opl Res Soc 53 (4): 427–435.CrossRefGoogle Scholar
  7. Cordeau J-F and Laporte G (2001). A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39 (3): 292–298.Google Scholar
  8. Cordeau J-F, Laporte G, Legato P and Moccia L (2005). Models and tabu search heuristics for the berth-allocation problem. Transport Sci 39 (4): 526–538.CrossRefGoogle Scholar
  9. Cordeau J-F, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52 (8): 928–936.CrossRefGoogle Scholar
  10. Cordeau J-F, Laporte G and Mercier A (2004). Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J Opl Res Soc 55 (5): 542–546.CrossRefGoogle Scholar
  11. Giallombardo G, Moccia L, Salani M and Vacca I (2010). Modeling and solving the tactical berth allocation problem. Transport Res B-Meth 44 (2): 232–245.CrossRefGoogle Scholar
  12. Hu B and Raidl G (2008). Effective neighborhood structures for the generalized traveling salesman problem. In: van Hemert J and Cotta C (eds). Evolutionary Computation in Combinatorial Optimisation. Volume 4972 of Lecture Notes in Computer Science Springer: Berlin, pp 36–47.CrossRefGoogle Scholar
  13. Laporte G (1988). Location-routing problems. In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. Volume 16 of Studies in Management Science and Systems North-Holland: Amsterdam, pp 163–197.Google Scholar
  14. Li LYO and Fu Z (2002). The school bus routing problem: A case study. J Opl Res Soc 53 (5): 552–558.CrossRefGoogle Scholar
  15. Moccia L, Cordeau J-F, Laporte G, Ropke S and Valentini MP (2011). Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57 (1): 53–68.CrossRefGoogle Scholar
  16. Park J and Kim B-I (2010). The school bus routing problem: A review. Eur J Opl Res 202 (2): 311–319.CrossRefGoogle Scholar
  17. Perugia A, Cordeau J-F, Laporte G and Moccia L (2011). Designing a home-to-work bus service in a metropolitan area. Working Paper, HEC Montreal. Submitted.Google Scholar
  18. Reinelt G (1995). TSPLIB 95. Technical report, Universität Heidelberg.Google Scholar
  19. Renaud J and Boctor FF (1998). An efficient composite heuristic for the symmetric generalized traveling salesman problem. Eur J Opl Res 108 (3): 571–584.CrossRefGoogle Scholar
  20. Şeref O, Ahuja RK and Orlin JB (2009). Incremental network optimization: Theory and algorithms. Opns Res 57 (3): 586–594.CrossRefGoogle Scholar
  21. Spada M, Bierlaire M and Liebling TM (2005). Decision-aiding methodology for the school bus routing and scheduling problem. Transport Sci 39 (4): 477–490.CrossRefGoogle Scholar

Copyright information

© Operational Research Society 2011

Authors and Affiliations

  1. 1.ICAR−Consiglio Nazionale delle RicercheCosenzaItaly
  2. 2.HEC MontréalMontréalCanada

Personalised recommendations