A guided tabu search for the heterogeneous vehicle routeing problem

Journal of the Operational Research Society

Volumn 59, Issue 12, 2008, Pages 1659-1673

  Tarantilis, C D ^a   Zachariadis, E E ^b   Kiranoudis, C T ^b  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Distribution; Heuristics; Logistics; Vehicle routeing problem

Indexed keywords

CUSTOMER SATISFACTION; LOGISTICS; TABU SEARCH; VEHICLES;

BENCH-MARK PROBLEMS; COMPUTATIONAL TIME; DISTRIBUTION; FLEET COMPOSITION; FLEET OF VEHICLES; HETEROGENEOUS VEHICLES; HEURISTICS; OBJECTIVE FUNCTIONS;

FLEET OPERATIONS;

EID: 55849089965     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602504     Document Type: Article

References (20)

1. Croes G (1958). A method for solving Traveling Salesman Problems. Opns Res 6: 791-812.
2. Dueck G (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. J Comput Phys 104: 86-92.
3. Dueck G and Scheuer T (1990). Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90: 161-175.
4. Gendreau M, Laporte G, Musaraganyi C and Taillard ED (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comps & Opns Res 26: 1153-1173.
5. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comps & Opns Res 13: 533-549.
6. Golden BL and Assad AA (1988). Vehicle Routing: Methods and Studies. North-Holland: Amsterdam.
7. Golden BL, Assad AA, Levy L and Gheysens FG (1984). The fleet size and mix vehicle routing problem. Comps & Opns Res 11: 49-66.
8. Hertz A (2006). Anniversary focused issue of Computers & Operations Research on tabu search. Comps & Opns Res 33: 2447-2448.
9. Johnson DS (1974). Fast algorithms for bin packing. J Comput Syst Sci 8: 272-314.
10. Li F, Goldcn B and Wasil E (2005). Very large scale vehicle routing: New tests problems algorithms and results. Comps & Opns Res 32: 1165-1179.
11. Li F, Golden B and Wasil E (2007). A record to record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comps &. Opns Res 34: 2734-2742.
12. Mester D and Bräysy O (2007). Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Comps & Opns Res 34: 2964-2975.
13. Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
14. Taillard ED (1999). A heuristic column generation method for the heterogeneous VRP. RAIRO 33: 1-14.
15. Tarantilis CD (2005). Solving ihe vehicle routing problem with adaptive memory programming methodology. Comps & Opns Res 32: 2309-2327.
16. Tarantilis CD and Kiranoudis CT (2002). BoneRoute: An adaptive memory-based method for effective fleet management. Ann Opns Res 115: 227-241.
17. Tarantilis CD, Kiranoudis CT and Vassiliadis V (2003). A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. J Opl Res Soc 54: 65-71.
18. Tarantilis CD, Kiranoudis CT and Vassiliadis V (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur J Opl Res 152: 148-158.
19. Toth P and Vigo D (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM: Philadelphia.
20. Voudouris C and Tsang E (1995). Partial Constraint Satisfaction Problems and Guided Local Search. Technical Report CSM-250, Department of Computer Science, University of Essex: UK, pp 337-356.