Journal of Heuristics

, Volume 13, Issue 1, pp 49–76 | Cite as

Metaheuristics for the team orienteering problem

  • Claudia Archetti
  • Alain Hertz
  • Maria Grazia Speranza
Article

Abstract

The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances.

Keywords

Team orienteering problem Selective traveling salesman problem Tabu search heuristic Variable neighborhood search heuristic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Butt, S.E. and T.M. Cavalier. (1994). “A Heuristic for the Multiple Tour Maximum Collection Problem.” Computers and Operations Research 21, 101–111.MATHCrossRefGoogle Scholar
  2. Butt, S.E., Ryan, D.M. (1999), An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers and Operations Research 26, 127–141.CrossRefMathSciNetGoogle Scholar
  3. Feillet, D., P. Dejax, and M. Gendreau. (2005). “Traveling Salesman Problems with Profits.” Transportation Science 39, 188#x2013;205.Google Scholar
  4. Feillet, D., P. Dejax, and M. Gendreau. (2004). Traveling Salesman Problems with Profits, to appear in Transportation Science.Google Scholar
  5. Gendreau, M., A. Hertz, and G. Laporte. (1994). “A Tabu Search Heuristic for the Vehicle Routing Problem.” Management Science 40, 1276–1290.MATHCrossRefGoogle Scholar
  6. Golden, B., A. Assad, and R. Dahl. (1984). “Analysis of a Large Scale Vehicle Routing Problem with an Inventory Component.” Large Scale Systems 7, 181–190.MATHGoogle Scholar
  7. Golden, B., L. Levy, and R. Vohra. (1987). “The Orienteering Problem.” Naval Research Logistics 34, 307–318.MATHCrossRefGoogle Scholar
  8. Glover F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers and Operations Research 5, 533–549.CrossRefMathSciNetGoogle Scholar
  9. Glover, F. and M. Laguna. (eds.) (1997). Tabu Search. Kluwer Academic Publishers.Google Scholar
  10. Hansen, P. and N. Mladenović. (1999). “An Introduction to Variable Neighborhood Search.” In S. Voss et al. (eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, PP. 433–458.Google Scholar
  11. Lin, S. (1965). “Computer Solutions of the Traveling Salesman Problem.” Bell System Technical Journal 44, 2245–2269.MathSciNetMATHGoogle Scholar
  12. Mladenović, N. and P. Hansen. (1997). “Variable Neighborhood Search.” Computers and Operations Research 24, 1097–1100.CrossRefMathSciNetMATHGoogle Scholar
  13. Rochat, Y. and E. Taillard. (1995). “Probabilistic Diversification and Intensification in Local Search for Vehicle routing.” Journal of Heuristics 1, 147–167.MATHCrossRefGoogle Scholar
  14. Tang, H. and E. Miller-Hooks. (2005). “A Tabu Search Heuristic for the Team Orienteering Problem.” Computers and Operations Research 32, 1379–1407.CrossRefGoogle Scholar
  15. Tsiligirides, T. (1984). “Heuristic Methods Applied to Orienteering.” Journal of the Operational Research Society 35, 797–809.CrossRefGoogle Scholar
  16. Toth, P. and D. Vigo. (eds.) (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Claudia Archetti
    • 1
  • Alain Hertz
    • 2
  • Maria Grazia Speranza
    • 1
  1. 1.Department of Quantitative MethodsUniversity of BresciaBresciaItaly
  2. 2.École Polytechnique and GERADMontréalCanada

Personalised recommendations