Skip to main content
Springer Nature Link
Log in

A Heuristic-Biased GRASP for the Team Orienteering Problem

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (CAEPIA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9868))

Included in the following conference series:

  • 1777 Accesses

Abstract

This paper introduces a route-planning problem in the sector of tourism. The Tourist Trip Design Problem seeks to maximize the number of points of interest to visit. This paper also proposes an optimization approach for a multi-day planning problem for sightseeing. In order to solve this optimization problem, an efficient Greedy Randomized Adaptive Search Procedure is developed to obtain high-quality solutions. Enhanced solution construction mechanisms and bias functions used in construction mechanism have been proposed. The computational experiments indicate the solving scheme is able to report competitive solutions by using short computational times.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49–76 (2007)

    Article  Google Scholar 

  2. Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1), 49–70 (2010)

    Article  MATH  Google Scholar 

  3. Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211–230 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bresina, J.L.: Heuristic-biased stochastic sampling. In: AAAI 1996, pp. 271–278 (1996)

    Google Scholar 

  5. Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(1), 101–111 (1994)

    Article  MATH  Google Scholar 

  6. Butt, S.E., Ryan, D.M.: An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput. Oper. Res. 26(4), 427–441 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996)

    Article  MATH  Google Scholar 

  8. Dang, D.-C., El-Hajj, R., Moukrim, A.: A branch-and-cut algorithm for solving the team orienteering problem. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 332–339. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Golden, B., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logistics 34, 307–318 (1987)

    Article  MATH  Google Scholar 

  11. Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3), 648–665 (2008)

    Article  Google Scholar 

  12. Kim, B.I., Li, H., Johnson, A.L.: An augmented large neighborhood search method for solving the team orienteering problem. Expert Syst. Appl. 40(8), 3065–3072 (2013)

    Article  Google Scholar 

  13. Lin, S.W.: Solving the team orienteering problem using effective multi-start simulated annealing. Appl. Soft Comput. 13, 1064–1073 (2013)

    Article  Google Scholar 

  14. Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 283–319. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Souffriau, W., Vansteenwegen, P., Berghe, G.V., Oudheusden, D.V.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37(11), 1853–1859 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379–1407 (2005)

    Article  MATH  Google Scholar 

  17. Toth, P., Vigo, D.: An overview of vehicle routing problems. In: The Vehicle Routing Problems. Monographs on Discrete Mathematics and Applications, vol. 9, pp. 1–26. SIAM (2002)

    Google Scholar 

  18. Vansteenwegen, P., Souffriau, W., Berghe, G.V., Oudheusden, D.V.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118–127 (2009)

    Article  MATH  Google Scholar 

  19. Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Vansteenwegen, P., Van Oudheusden, D.: The mobile tourist guide: an or opportunity. OR Insight 20(3), 21–27 (2007)

    Article  Google Scholar 

Download references

Acknowledgment

This paper has been partially funded by the Spanish Ministry of Economy and Competitiveness (TIN2012-32608 and TIN2015-70226-R projects). Contributions by Airam Expósito are supported by the research training program of University of La Laguna and La Caixa. Thanks to IUDR (Instituto Universitario de Desarrollo Regional) for its support provided.

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Systems, University of La Laguna, 38206, Santa Cruz de Tenerife, Spain

    Airam Expósito, Julio Brito & José A. Moreno

Authors
  1. Airam Expósito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julio Brito
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José A. Moreno
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Airam Expósito , Julio Brito or José A. Moreno .

Editor information

Editors and Affiliations

  1. Artificial Intelligence Center, University of Oviedo, Gijón, Spain

    Oscar Luaces

  2. University of Castilla-La Mancha , Albacete, Spain

    José A. Gámez

  3. Public University of Navarre , Pamplona, Spain

    Edurne Barrenechea

  4. Universidad Pablo de Olavide , Sevilla, Spain

    Alicia Troncoso

  5. Public University of Navarre , Pamplona, Navarra, Spain

    Mikel Galar

  6. University of Salamanca , Salamanca, Spain

    Héctor Quintián

  7. University of Salamanca , Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Expósito, A., Brito, J., Moreno, J.A. (2016). A Heuristic-Biased GRASP for the Team Orienteering Problem. In: Luaces , O., et al. Advances in Artificial Intelligence. CAEPIA 2016. Lecture Notes in Computer Science(), vol 9868. Springer, Cham. https://doi.org/10.1007/978-3-319-44636-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44636-3_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44635-6

  • Online ISBN: 978-3-319-44636-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics