A list based threshold accepting algorithm for the capacitated vehicle routing problem

International Journal of Computer Mathematics

Volumn 79, Issue 5, 2002, Pages 537-553

  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

Logistics networks; Meta heuristics; Threshold accepting; Vehicle routing

Indexed keywords

DECISION SUPPORT SYSTEMS; HEURISTIC METHODS; PROBLEM SOLVING; VEHICLES;

LOGISTICS NETWORKS; META-HEURISTICS; THRESHOLD ACCEPTING; VEHICLE ROUTING;

ALGORITHMS;

EID: 0141538398     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160210948     Document Type: Article

References (27)

1. Dueck, G. and Scheuer, T. (1990). Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing, J. Computational Physics, 90(1), 161-175.
2. Croes, G. (1958). A method for solving traveling salesman problems, Oper. Res., 6 791-812.
3. Waters, C. D. J. (1987). A solution procedure for the vehicle scheduling problem based on iterative route improvement, J. Oper. Res. Soc., 38, 833-839.
4. Christofides, N., Mingozzi, A. and Toth, P. (1979). The vehicle routing problem. Combinatorial Optimization, Wiley, Chichester.
5. Salhi, S. and Rand, G. K. (1987). Improvements to Vehicle Routeing Heuristics, J. Oper. Res. Soc., 38(3), 293-295.
6. Paessens, H. (1988). The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res., 34, 336-344.
7. Pureza, V. M. and Franca, P. M. (1991). Vehicle routing via tabu search metaheuristic, Technical Report CRT-747, Centre de Recherche sur les transports.
8. Baker, B. M. and Sheasby, J. (1999). Extensions to the generalised assignment heuristic for vehicle routing, Eur. J. Oper. Res., 119, 147-157.
9. Bramel, J. B. and Simchi-Levi, D. (1995). A location based heuristic for general routing problems. Oper. Res., 43, 649-660.
10. Duncan, T. (1995). Experiments in the use of neighbourhood search techniques for vehicle routing, Technical Report AIAI-TR-176, Artificial Intelligence Applications Institute, University of Edinburgh.
11. Renaud, J. Boctor, F. F. and Laporte, G. A. (1996a). A fast composite heuristic for the symmetric traveling salesman problem. INFORMS J. Computing, 8, 134-143.
12. Renaud, J. Boctor, F. F. and Laporte, G. (1996b). An improved petal heuristic for the vehicle routing problem, J. Oper, l Res. Soc., 47, 329-336.
13. Rego, C. (1996). Local search and neighborhood structures for vehicle routing problems: sequential and parallel algorithms, Ph. D. Dissertation, University of Versailles.
14. Bullnheimer, B. Hartl P. F. and Strauss, C. (1997). An improved ant system algorithm for the vehicle routing problem, Technical Report, Institute of Management Science, University of Vienna, Austria.
15. Baker, B. M. and Sheasby, J. (1999). Extensions to the generalised assignment heuristic for vehicle routing, Eur. J. Oper. Res., 119, 147-157.
16. Laporte, G., Gendreau, M., Potvin, J.-Y., and Semet, F. (2000). Classical and modern heuristics for the vehicle routing problem, Int. Trans. Oper. Res., 7, 285-300.
17. Tarantilis, C. D., Kiranoudis, C. T. and Vassiliadis, V. S. (2000). A Backtracking Adaptive Threshold Accepting algorithm for the Vehicle Routing Problem, Technical Report, National Technical University of Athens, Greece.
18. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for combinatorial optimisation problems, Annals of Oper. Res., 41, 421-451.
19. Rego, C. and Roucairol, C. (1994). An ecient implementation of ejection chain procedures for the vehicle routing problem. Technical Report 44, PriSM Laboratory, University of Versailles.
20. Hjorring, C. (1995). The vehicle routing problem and local search metaheuristics. Ph. D. dissertation, Department of Engineering Science, The University of Auckland.
21. Toth, P. and Vigo, D. (1998). The granular tabu search (and its application to the vehicle routing problem)., Technical Report, University of Bologna.
22. Barbarosoglu, G. and Ozgur, D. (1999). A tabu search algorithm for the vehicle routing problem, Computers Oper. Res., 26, 255-270.
23. Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems, Networks, 23, 661-672.
24. Gendreau, M., Hertz, A. and Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem, Management Science, 40, 1276-1290.
25. Xu, J. and Kelly, J. P. (1996). A new network flow-based tabu search heuristic for the vehicle routing problem, Transportation Sciences, 30, 379-393.
26. Shaw, P. (1998). Using Constraint Programming and Local search Methods to solve Vehicle Routing Problems, Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Springer).
27. Kelly, J. P. and Xu, J. (1999). A set-partitioning-based heuristic for the vehicle routing problem, INFORMS J. Computing, 1(1), 161-172.