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

Journal of the Operational Research Society

Volumn 63, Issue 2, 2012, Pages 232-244

  Moccia, L ^a   Cordeau, J F ^b   Laporte, G ^b  

^a ICAR CNR   (Italy)

^b HEC MONTRÉAL   (Canada)

Author keywords

generalized vehicle routing problem; large neighbourhood search; tabu search; time windows

Indexed keywords

HEURISTIC ALGORITHMS; TABU SEARCH; VEHICLES;

COMPUTATIONAL RESULTS; GENERAL TOOLS; GENERALIZED VEHICLE ROUTING PROBLEMS; LARGE NEIGHBOURHOOD SEARCHES; POLYNOMIAL COMPLEXITY; SPECIFIC PROBLEMS; TABU SEARCH HEURISTIC; TIME WINDOWS;

VEHICLE ROUTING;

EID: 84855686605     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.25     Document Type: Article

References (21)

1. Ahuja RK, Magnanti TL and Orlin J (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall: Englewood Cliffs, NJ.
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.
3. Bektaş T and Elmastaş S (2007). Solving school bus routing problems through integer programming. J Opl Res Soc 58(12): 1599-1604. (Pubitemid 350129148)
4. Bektaş T, Erdoǧan G and Ropke S (2011). Formulations and branchand-cut algorithms for the generalized vehicle routing problem. Transport Sci, published online before print 18 February, Doi: 10.1287/trsc.1100.0352.
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.
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. (Pubitemid 34410652)
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. (Pubitemid 32827214)
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. (Pubitemid 41706012)
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. (Pubitemid 32720268)
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.
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.
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.
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.
14. Li LYO and Fu Z (2002). The school bus routing problem: A case study. J Opl Res Soc 53(5): 552-558. (Pubitemid 34550667)
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.
16. Park J and Kim B-I (2010). The school bus routing problem: A review. Eur J Opl Res 202(2): 311-319.
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.
18. Reinelt G (1995). TSPLIB 95. Technical report, Universität Heidelberg.
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. (Pubitemid 128392106)
20. Şeref O, Ahuja RK and Orlin JB (2009). Incremental network optimization: Theory and algorithms. Opns Res 57(3): 586-594.
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. (Pubitemid 41706008)