Scheduling technicians for planned maintenance of geographically distributed equipment

Transportation Research Part E: Logistics and Transportation Review

Volumn 43, Issue 5, 2007, Pages 591-609

  Tang, Hao ^a   Miller Hooks, Elise ^b   Tomastik, Robert ^c  

^a FedEx   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNITED TECHNOLOGIES RESEARCH CENTER   (United States)

Author keywords

Maintenance scheduling; Multiple tour maximum collection problem; Selective traveling salesman problem; Tabu search; Time dependent

Indexed keywords

HEURISTIC ALGORITHMS; SCHEDULED MAINTENANCE; TABU SEARCH;

MAINTENANCE SCHEDULING; MAINTENANCE SCHEDULING PROBLEM; MULTIPLE TOUR MAXIMUM COLLECTION PROBLEM; PLANNED MAINTENANCE; PROBLEM INSTANCES; REAL-WORLD; SELECTIVE TRAVELING SALESMAN PROBLEM; TABU SEARCH HEURISTIC; TIME DEPENDENT; UNITED TECHNOLOGIES CORPORATIONS;

TRAVELING SALESMAN PROBLEM;

HEURISTICS; MAINTENANCE; NUMERICAL METHOD;

EID: 34250822373     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2006.03.004     Document Type: Article

References (25)

1. Butt S., and Cavalier T. A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 21 (1994) 101-111
2. Butt S., and Ryan D. An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computer and Operations Research 26 (1999) 427-441
3. Chao I., Golden B., and Wasil E. The team orienteering problem. European Journal of Operational Research 88 (1996) 464-474
4. Chao I., Golden B., and Wasil E. A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88 (1996) 475-489
5. Dueck G., and Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90 (1990) 161-175
6. Erkut E., and Zhang J. On the maximum collection problem with time-dependent rewards. Naval Research Logistics 43 (1996) 749-763
7. Fischetti M., Salazar J., and Toth P. Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10 (1998) 33-148
8. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
9. Gendreau M., Laporte G., and Semet F. A tabu search heuristic for the undirected selective traveling salesman problem. European Journal of Operational Research 106 (1998) 539-545
10. Gendreau M., Laporte G., and Semet F. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32 (1998) 263-273
11. Gendreau M., Laporte G., Musaraganyi C., and Taillard E. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26 (1999) 1153-1173
12. Golden B., Levy L., and Vohra R. The orienteering problem. Naval Research Logistics 34 (1987) 307-318
13. Golden B., Wang Q., and Liu L. A multifaceted heuristic for the orienteering problem. Naval Research Logistics 35 (1988) 359-366
14. Golden B., Laporte G., and Taillard E. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers and Operations Research 24 (1997) 445-452
15. Hart J., and Shogan A. Semi-greedy heuristics: an empirical study. Operations Research Letters 6 (1987) 107-114
16. Laporte G., and Martello S. The selective traveling salesman problem. Discrete Applied Mathematics 26 (1990) 193-207
17. Lin S., and Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
18. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), John Wiley and Sons, Chichester
19. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1110
20. Ramesh R., and Brown K. An efficient four-phase heuristic for the generalized orienteering problem. Computers and Operations Research 18 (1991) 151-165
21. Ramesh R., Yoon Y., and Karwan M. An optimal algorithm for the orienteering tour problem. ORSA Journal on Computing 4 (1992) 155-165
22. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
23. Savelsbergh, M., 2003. The inventory routing problem. Working Paper, Georgia Institute of Technology.
24. Tang H., and Miller-Hooks E. A tabu search heuristic for the team orienteering problem. Computers and Operations Research 32 (2005) 1379-1407
25. Tsiligirides T. Heuristic methods applied to orienteering. Journal of the Operational Research Society 35 (1984) 797-809