A fast and effective heuristic for the orienteering problem

European Journal of Operational Research

Volumn 88, Issue 3, 1996, Pages 475-489

  Chao, I Ming ^a   Golden, Bruce L ^b   Wasil, Edward A ^c  

^a DEPARTMENT OF PHYSICS   (Taiwan)

^b UNIVERSITY OF MARYLAND   (United States)

^c AMERICAN UNIVERSITY   (United States)

Author keywords

Heuristic search; Vehicle routing problem

Indexed keywords

OPERATIONS RESEARCH; OPTIMIZATION; SET THEORY; TRANSPORTATION ROUTES;

HEURISTIC SEARCH; ORIENTEERING PROBLEM; VEHICLE ROUTING PROBLEM;

HEURISTIC METHODS;

EID: 0030574676     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00035-6     Document Type: Article

References (20)

1. Balas, E. (1989), "The prize collecting traveling salesman problem", Networks 19, 621-636.
2. Chao, I-M., (1993), "Algorithms and solutions to multi-level vehicle routing problems", Ph.D. Dissertation, Applied Mathematics Program, University of Maryland, College Park, MD.
3. Chao, I-M., Golden, B, and Wasil E. (1996), "The team orienteering problem", European Journal of Operational Research 88, 464-474.
4. Dueck, G. (1990), "New optimization heuristics, the great deluge algorithm and the record-to-record travel", Scientific Center Technical Report, IBM Germany, Heidelberg Scientific Center, Heidelberg, Germany, December.
5. Golden, B., Assad, A., and Dahl, R. (1984), "Analysis of a large-scale vehicle routing problem with an inventory component", Large Scale Systems 7, 181-190.
6. Golden, B., Levy, L., and Vohra, R. (1987), "The orienteering problem", Naval Research Logistics 34, 307-318.
7. Golden, B., Wang, Q., and Liu, L. (1988), "A multifaceted heuristic for the orienteering problem", Naval Research Logistics 35, 359-366.
8. Kantor, M., and Rosenwein, M. (1992), "The orienteering problem with time windows", Journal of the Operational Research Society 43/6, 629-635.
9. Keller, P.C. (1985), "Multiobjective routing through space and time: The MVP and TDVP problems", Ph.D. Dissertation, The University of Western Ontario, London, Ontario, Canada.
10. Keller, P.C. (1989), "Algorithms to solve the orienteering problem: A comparison", European Journal of Operational Research 41, 224-231.
11. Laporte, G., and Martello, S. (1990), "The selective traveling salesman problem", Discrete Applied Mathematics 26, 193-207.
12. Leifer, A.C., and Rosenwein, M.S. (1994), "Strong linear programming relaxations for the orienteering problem", European Journal of Operational Research 73, 517-523.
13. Lin, S. (1965), "Computer solutions of the traveling salesman problem", Bell System Technical Journal 44, 2245-2269.
14. Mittenthal, J., and Noon, C.E. (1992), "An insert/delete heuristic for the traveling salesman subset-tour problem with one additional constraint", Journal of the Operational Research Society 43/3, 277-283.
15. Pillai, R.S. (1992), "The traveling salesman subset-tour problem with one additional constraint (TSSP+1)", Ph.D. Dissertation, The University of Tennessee, Knoxville, TN.
16. Ramesh, R., and Brown, K.M. (1991), "An efficient four-phase heuristic for the generalized orienteering problem", Computers & Operations Research 18/2, 151-165.
17. Ramesh, R., Yoon, Y., and Karwan, M. (1992), "An optimal algorithm for the orienteering tour problem", ORSA Journal on Computing 4/2, 155-165.
18. Sokkappa, P.R. (1990), "The cost-constrained traveling salesman problem", Ph.D. Dissertation, The University of California, Livermore, CA.
19. Tsiligirides, T. (1984), "Heuristic methods applied to orienteering", Journal of the Operational Research Society 35/9, 797-809.
20. Wren, A., and Holliday, A. (1972), "Computer scheduling of vehicles for one or more depots to a number of delivery points", Operational Research Quarterly 23, 333-344.