A TABU search heuristic for the team orienteering problem

Computers and Operations Research

Volumn 32, Issue 6, 2005, Pages 1379-1407

  Tang, Hao ^a   Miller Hooks, Elise ^b  

^a FedEx   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Adaptive Memory Procedure; Multiple Tour Maximum Collection Problem; Selective TSP; Tabu Search; Team Orienteering Problem (TOP)

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION MAKING; PROBLEM SOLVING; RANDOM PROCESSES; REAL TIME SYSTEMS; SET THEORY;

ADAPTIVE MEMORY PROCEDURE; MULTIPLE TOUR MAXIMUM COLLECTION PROBLEM; SELECTIVE TSP; TABU SEARCH; TEAM ORIENTED PROBLEM (TOP);

HEURISTIC PROGRAMMING;

EID: 9544227386     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2003.11.008     Document Type: Article

References (42)

1. Golden B, Levy L, Vohra R. The orienteering problem. Naval Research Logistics 1987;34:307-18.
2. Chao I, Golden B, Wasil E. The team orienteering problem. European Journal of Operational Research 1996a;88: 464-74.
3. Butt S, Cavalier T. A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 1994;21:101-11.
4. Ballou R, Chowdhury M. MSVS: an extended computer model for transport mode selection. The Logistics and Transportation Review 1980;16:325-38.
5. Diaby M, Ramesh R. The distribution problem with carrier service: a dual based penalty approach. ORSA Journal on Computing 1995;7:24-35.
6. Hall R, Racer M. Transportation with common carrier and private fleets: system assignment and shipment frequency optimization. IIE Transactions 1995;27:217-25.
7. Dueck G, Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 1990;90:161-75.
8. Butt S, Ryan D. An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computer and Operations Research 1999;26:427-41.
9. Laporte G, Martello S. The selective traveling salesman problem. Discrete Applied Mathematics 1990;26:193-207.
10. Ramesh R, Yoon Y, Karwan M. An optimal algorithm for the orienteering tour problem. ORSA Journal on Computing 1992;4:155-65.
11. Fischetti M, Salazar J, Toth P. Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 1998;10:33-148.
12. Gendreau M, Laporte G, Semet F. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 1998b;32:263-73.
13. Tsiligirides T. Heuristic methods applied to orienteering: Journal of the Operational Research Society 1984;35: 797-809.
14. Wren A, Holliday A. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 1972;23:333-44.
15. Golden B, Wang Q, Liu L. A multifaceted heuristic for the orienteering problem. Naval Research Logistics 1988;35:359-66.
16. Ramesh R, Brown K. An efficient four-phase heuristic for the generalized orienteering problem. Computers and Operations Research 1991;18:151-65.
17. Chao I, Golden B, Wasil E. A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 1996b;88:475-89.
18. Gendreau M, Laporte G, Semet F. A tabu search heuristic for the undirected selective traveling salesman problem. European Journal of Operational Research 1998a;10:539-45.
19. Fischetti M, Toth P. An additive approach for the optimal solution of the prize-collecting traveling salesman problem. In: Golden B, Assad A, editors. Vehicle routing: methods and studies. Amsterdam: Elsevier Science Publishers; 1988. p. 319-43.
20. Larson R, Odoni A. Urban operations research. Englewood Cliffs, NJ: Prentice-Hall; 1981.
21. Golden B, Wasil E, Kelly J, Chao I. The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T, Laporte G, editors. Fleet management and logistics. Dordrecht: Kluwer Academic Publishers; 1998. p. 33-56.
22. Gendreau M, Laporte G, Potvin J-Y. Metaheuristics for the capacitated VRP. In: Toth P, Vigo D, editors. The vehicle routing problem, Philadelphia: Society for Industrial & Applied Mathematics; 2002, p. 129-54.
23. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 1986:1:533-49.
24. Glover F. Tabu search: part I. ORSA Journal on Computing 1989;1:190-206.
25. Glover F. Tabu search: part II. ORSA Journal on Computing 1990;2:4-32.
26. Golden B, Laporte G, Taillard E. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers and Operations Research 1997;24:445-52.
27. Rochat Y, Taillard É. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1995;1:147-67.
28. Gendreau M, Laporte G, Musaraganyi C, Taillard É. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 1999;26:1153-73.
29. Taillard É, Gambardella L, Gendreau M, Potvin J-Y. Adaptive memory programming: a unified view of metaheuristics. European Journal of Operational Research 2001;135:1-16.
30. Glover F. Tabu search and adaptive memory programming: advances, applications and challenges. In: Barr R, Helgason R, Kennington J, editors. Advances in metaheuristics, optimization and stochastic modeling technologies, Dordrecht: Kluwer Academic Publishers; 1997. p. 1-75.
31. Taillard É, Badeau P, Gendreau M, Guertin F, Potvin J-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science 1997;31:170-86.
32. Rosenkrantz D, Steams R, Lewis P. Approximate algorithms for the traveling salesman problem. Proceedings of the 15th annual IEEE symposium of switching and automata theory. 1974. p. 33-42.
33. Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994;40:1276-90.
34. Barbarosoglu G, Ozgur D. A tabu search algorithm for the vehicle routing problem. Computers and Operations Research 1999;26:255-70.
35. Lin S, Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 1973;21:498-516.
36. Mladenović N, Hansen P. Variable neighborhood search. Computers and Operations Research 1997;24:1097-110.
37. Liu F-H, Shen S-Y. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research 1999;118:485-504.
38. Hart J, Shogan A. Semi-greedy heuristics: an empirical study. Operations Research Letters 1987;6:107-14.
39. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget J-F, editors. Principles and practice of constraint programming-CP98, Lecture Notes in Computer Science, Berlin: Springer, 1998. p. 417-31.
40. Chao I. Algorithms and solutions to multi-level vehicle routing problems. PhD Dissertation, University of Maryland, College Park, 1993.
41. Miller-Hooks E, Tang H. Scheduling of planned maintenance tasks for otis: final report. Report to United Technologies Research Center of United Technologies Corporation, East Hartford, Connecticut, 2002.
42. Taillard É. A heuristic column generation method for the heterogeneous fleet VRP. Recherche-Operationnelle 1999;33:1-14.