A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem

Journal of the Operational Research Society

Volumn 54, Issue 1, 2003, Pages 65-71

  Tarantilis, C D ^a   Kiranoudis, C T ^a   Vassiliadis, V S ^b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Distribution; Heuristics; Logistics; Vehicle routing

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; FLEET OPERATIONS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION;

HETEROGENOUS FIXED FLEET VEHICLE ROUTING PROBLEM; THRESHOLD ACCEPTING METAHEURISTIC;

OPERATIONS RESEARCH;

EID: 0037286947     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601443     Document Type: Article

References (17)

1. Laporte G, Gendreau M, Potvin J-Y and Semet F (2000). Classical and modern heuristics for the vehicle routing problem, Int Trans Opl Res 7: 285-300.
2. Golden BL, Assad AA, Levy L and Gheysens FG (1984). The fleet size and mix vehicle routing problem. Comps & Opns Res. 11: 49-66.
3. Gheysens FG, Golden BL and Assad AA (1984). A comparison of techniques for solving the fleet size and mix vehicle routing problem. Opns Res Spktrm 6: 207-216.
4. Gheysens FG, Golden BL and Assad AA (1986). A new heuristic for determining fleet size and composition. Math Progr Study 26: 233-236.
5. Desrochers M and Verhoog TW (1991). A new heuristic for the fleet size and mix vehicle routing problem. Comps & Opns Res 18: 263-274.
6. Salhi S and Rand GK (1993). Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Opl Res 66: 313-330.
7. Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
8. 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.
9. Taillard ED (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33: 1-14.
10. Taillard ED (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661-672.
11. Dueck G and Scheuer T (1990). Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90: 161-175.
12. Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-589.
13. Paessens H (1988). The savings algorithm for the vehicle routing problem. Eur J Opl Res 34: 336-344.
14. Waters CDJ (1987). A solution procedure for the vehicle scheduling problem based on iterative route improvement. J Opl Res Soc 38: 833-839.
15. Croes G (1958). A method for solving traveling salesman problems. Opns Res 6: 791-812.
16. Kirkpatrick S, Gelatt CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220: 671-680.
17. Tarantilis CD and Kiranoudis CT (2002). Using a spatial decision support system for solving the vehicle routing problem. Inform & Managnt 39: 359-375.