A backtracking adaptive threshold accepting algorithm for the vehicle routing problem

Systems Analysis Modelling Simulation

Volumn 42, Issue 5, 2002, Pages 631-664

  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 Management; Local Search; Metaheuristics; Threshold Accepting; Vehicle Routing

Indexed keywords

DISTRIBUTED PARAMETER CONTROL SYSTEMS; HEURISTIC METHODS; ITERATIVE METHODS; PROBLEM SOLVING; RANDOM PROCESSES; THRESHOLD ELEMENTS;

BACKTRACKING ADAPTIVE THRESHOLD ACCEPTING (BATA); DISTRIBUTION MANAGEMENT; LOCAL SEARCH; METAHEURISTICS; THRESHOLD ACCEPTING; VEHICLE ROUTING;

ALGORITHMS;

EID: 0141426890     PISSN: 02329298     EISSN: 10294902     Source Type: Journal    
DOI: None     Document Type: Article

References (70)

1. Y. Agarwal, K. Mathur and H.M. Salkin (1989). A set-partitioning-based exact algorithm for the vehicle routing problem, Networks, 19, 731-749.
2. K. Altinkemer and B. Gavish (1991). Parallel savings based heuristic for the delivery problem. Operations Research, 39(3), 456-469.
3. B.M. Baker (1992). Further improvements to vehicle routing heuristics. Journal of the Operational Research Society. 43(10), 1009-1012.
4. B.M. Baker and J. Sheasby (1999). Extensions to the generalized assignment heuristic for vehicle routing. European Journal of Operational Research, 119, 147-157.
5. M.L. Balinski and R.E. Quandt (1964). On an integer program for a delivery problem. Operations Research, 12(2), 300-304.
6. G. Barbarosoglu and D. Ozgur (1999). A tabu search algorithm for the vehicle routing problem. Computers & Operations Research, 26, 255-270.
7. L. Bodin and L. Berman (1979). Routing and scheduling of school buses by computer. Transportation Science, 13(2), 113-129.
8. J.B. Bramel and D. Simchi-Levi (1995). A location-based heuristic for general routing problems. Operations Research, 43(4), 649-660.
9. N. Christofides and S. Eilon (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20(3), 309-318.
10. N. Christofides (1976). The vehicle routing problem. RAIRO, 10, 55-70.
11. N. Christofides, A. Mingozzi and P. Toth (1979). The vehicle routing problem. In: N. Christofides, A. Mingozzi, P. Toth and C. Sandi (Eds.), Combinatorial Optimization, pp. 315-338. Wiley, Chichester.
12. N. Christofides, A. Mingozzi and P. Toth (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 255-282.
13. N. Christofides, A. Mingozzi and P. Toth (1981). Space state relaxation procedures for the computation of bounds to routing problems. Networks, 11, 145-164.
14. G. Clarke and J.W. Wright (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-589.
15. G. Croes (1958). A method for solving traveling salesman problems. Operations Research, 6, 791-812.
16. G.B. Dantzig and J.H. Ramser (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
17. M. Desrochers and T.W. Verhoog (1989). A matching based savings algorithm for the vehicle routing problem. Les Cahiers du GERAD G-89-04, Ecole des Hautes Etudes Commerciales de Montreal.
18. G. Dueck and T. Scheuer (1990). Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90(1), 161-175.
19. G. Dueck (1993). New optimization heuristics: The great deluge algorithm and record-to-rccord travel. Journal of Computational Physics, 104, 86-92.
20. T. Duncan (1995). Experiments in the use of neighbourhood search techniques for vehicle routing. Technical Report AIAI-TR-176, Artificial Intelligence Applications Institute, University of Edinburgh.
21. R. Fahrion and M. Wrede (1990). On a principle of chain-exchange for vehicle-routeing problems (1-VRP). Journal of the Operational Research Society, 41(9), 821-827.
22. I.A. Feo, J.F. Bard and R.F. Clafin (1991). An overview of GRASP methodology sand applications. Technical report. University of Texas at Austin, Austin, Texas 78712.
23. M.L. Fisher and R. Jaikumar (1981). A generalized assignment heuristic for vehicle routing. Networks, 11, 109-124.
24. B.A. Foster and D.M. Ryan (1976). An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly, 27, 367-384.
25. MR. Garey and D.S. Johnson (1979). Computers and Intractability. A Guide to the theory of NP-compteteness. W.H. Freeman, San Francisco.
26. W.M. Garvin, H.W. Crandall, J.B. John and R.A. Spellman (1957). Applications of linear programming in the oil industry. Management Science, 3 407-430.
27. T.J. Gaskell (1967). Bases for vehicle fleet scheduling. Operational Research Quarterly, 18, 218.
28. B. Gavish and S.C. Graves (1982). Scheduling and routing in transportation and distribution systems: Formulations and new relaxations. Technical report, Graduate School of Management, University of Rochester.
29. M. Gendreau, A. Hertz and G. Laporte (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(1), 1276-1290.
30. B. Gillett and L. Miller (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22(2), 340-349.
31. F. Glover (1989). Canditate list strategies and tabu search. Technical report, Graduate School of Business, University of Colorando, Boulder.
32. B. Golden, T.L. Magnanti and H.Q. Nguyen (1977). Implementing vehicle routing problems. Networks, 7, 113-148.
33. B.L. Golden, E.A. Wasil, J.P. Kelly and I.-M. Chao (1998). Metaheuristics in vehicle routing. In: T.G. Crainic and G. Laporte (Eds.), Fleet Management and Logistics. Kluwer, Boston.
34. E. Hadjiconstantinou, N. Christofides and A. Mingozzi (1995). A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations. Annals of Operations Research, 61, 21-44.
35. C. Hjorring (1995). The vehicle routing problem and local search metaheuristics. Ph.D. dissertation, Department of Engineering Science, The University of Auckland.
36. J.H. Holland (1975). Adaptation in Natural and Artificial systems. The University of Michigan Press, Ann Arbor.
37. D.S. Johnson and C.H. Papadimitriou (1985). Computational complexity. In: E.L. Lawler, J.K. Lenstra, A.K.G. Rinnooy Kan and D.B. Shmoys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Ch. 3). Wiley, Chichester.
38. J.P. Kelly and J. Xu (1999). A set-partitioning-based heuristic for the vehicle routing problem. INFORMS Journal on Computing, 1(1), 161-172.
39. G.A.P. Kinderwater and M.W.P. Savelsbergh (1997). Vehicle routing: handling edge constraints. In: E.H.L. Aarts and J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester.
40. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220, 671-680.
41. G. Laporte, Y. Nobert and M. Desrochers (1985). Optimal routing under capacity and distance restrictions. Operations Research, 33(2), 1050-1073.
42. G. Laporte, M. Gendreau and F. Semet (2000). Classical Heuristics for the vehicle Routing problem, to appear in P. Toth and D. Vigo (Eds.), The Vehicle Routing Problem.
43. G. Laporte, M. Gendreau, J-Y. Potvin and F. Semet (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7, 285-300.
44. S. Lin (1965). Computer solutions of the traveling salesman problem. The Bell System Technical Journal, 44(11), 2245-2269.
45. S. Lin and B.W. Kernigham (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498-516.
46. R.H. Mole and S.R. Jameson (1976). A sequential route-building algorithm employing a generalized savings criterion. Operational research Quarterly, 27, 503-511.
47. R.H. Mole (1983). The curse of unintended rounding error: a case from the vehicle scheduling literature. Journal of the Operational Research Society, 34, 607-613.
48. M.D. Nelson, K.E. Nygard, J.H. Griffin and W.E. Shreve (1985). Implementation techniques for the vehicle routing problem. Computers and Operations Research, 12(3), 273-283.
49. I. Or (1976). Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking. Ph.D. dissertation, Northwestern University, Evanston, IL.
50. I.H. Osman (1993). Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Annals of Operations Research, 41, 421-451.
51. H. Paessens (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34(3), 336-344.
52. V.M. Pureza and P.M. Franca (1991). Vehicle routing via tabu search metahcuristic. Technical Report CRT-747, Centre de Recherche sur les transports.
53. C. Rego (1996). Local search and neighborhood structures for vehicle routing problems: sequential and parallel algorithms. Ph.D. Dissertation, University of Versailles.
54. C. Rego and C. Roucairol (1996). A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: I.H. Osman and J.P. Kelly (Eds), Metaheuristics: Theory and Applications. Kleuwer, Boston.
55. J. Renaud, F.F. Boctor and G. Laporte (1996a). A fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing, 8(2), 134-143.
56. J. Renaud, F.F. Boctor and G. Laporte (1996b). An improved petal heuristic for the vehicle routing problem. Journal of the Operational Research Society, 47(2), 329-336.
57. Y. Rochat and E.D. Taillard (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147-167.
58. D.M. Ryan, C. Hjorring and F. Glover (1993). Extensions of the petal method for vehicle routing. Journal of the Operational Research Society, 4(3), 289-296.
59. S. Salhi and G.K. Rand (1987). Improvements to Vehicle Routing Heuristics. Journal of the Operational Research Society, 38(3), 293-295.
60. E. Taillard (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661-672.
61. P.M. Thompson and H.N. Psaraftis (1993). Cyclic transfer algorithms for the multivehicle routing and scheduling problems. Operations Research, 41(5), 935-946.
62. P. Toth and D. Vigo (1998). The granular tabu search (and its application to the vehicle routing problem). Working paper. DEIS University of Bologna.
63. A. Van Breedam (1994). An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer related, and time-related constraints. Ph.D. dissertation, University of Antwerp.
64. C.D.J. Waters (1987). A solution procedure for the vehicle scheduling problem based on iterative route improvement. Journal of Operational Research Society, 38(9), 833-839.
65. P. Wark and J. Holt (1994). A repeated matching heuristic for the vehicle routeing problem. Journal of Operational Research Society, 45(10), 1156-1167.
66. J.A.G. Willard (1989). Vehicle routing using r-optimal tabu search. Master's thesis, The Management School, Imperial College.
67. A. Wren (1971). Computers in Transport Planning and Operation. Ian Allan, London.
68. A. Wren and A. Holliday (1972). Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly, 23, 333-344.
69. J. Xu and J.P. Kelly (1996). A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sciences, 30, 379-393.
70. P. Yellow (1970). A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 21, 281-283.