Skip to main content
SpringerLink
Log in

Applications of the OP

  • Chapter
  • First Online:
Orienteering Problems

Part of the book series: EURO Advanced Tutorials on Operational Research ((EUROATOR))

Abstract

In recent years, we observe from literature that the VRP and OP, including their variants, have been used to model many different planning and scheduling problems from practice, such as the routing of technicians, athlete recruitment, or military applications. Recently, other practical applications, such as the tourist trip design problem, the mobile crowdsourcing problem, the smuggler search problem, the wildfire routing problem, and the integration of vehicle routing, inventory management, and customer selection problems, have been studied and use the OP as a basic model. In this chapter, various practical applications will be discussed in more detail. We will describe how different aspects from practice can actually be modeled as OP variants. More details about the formulations of the most used OP variants and algorithms to tackle these variants, will be explained in Chap. 8.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Angelelli E, Archetti C, Vindigni M (2014) The clustered orienteering problem. Eur J Oper Res 238(2):404–414

    Article  MathSciNet  MATH  Google Scholar 

  • Archetti C, Feillet D, Hertz A, Speranza MG (2009) The capacitated team orienteering and profitable tour problems. J Oper Res Soc 60:831–842

    Article  MATH  Google Scholar 

  • Archetti C, Bianchessi N, Speranza MG (2013) The capacitated team orienteering problem with incomplete service. Optim Lett 7(7):1405–1417

    Article  MathSciNet  MATH  Google Scholar 

  • Archetti C, Bianchessi N, Speranza MG (2014a) The split delivery capacitated team orienteering problem. Networks 63(1):16–33

    Article  MathSciNet  MATH  Google Scholar 

  • Archetti C, Speranza MG, Corberán Á, Sanchis JM, Plana I (2014b) The team orienteering arc routing problem. Transp Sci 48(3):442–457

    Article  MATH  Google Scholar 

  • Archetti C, Corberán Á, Plana I, Sanchis JM, Speranza MG (2015) A matheuristic for the team orienteering arc routing problem. Eur J Oper Res 245(2):392–401

    Article  MathSciNet  MATH  Google Scholar 

  • Archetti C, Corberán Á, Plana I, Sanchis JM, Speranza MG (2016) A branch-and-cut algorithm for the orienteering arc routing problem. Comput Oper Res 66:95–104

    Article  MathSciNet  MATH  Google Scholar 

  • Archetti C, Carrabs F, Cerulli R (2018) The set orienteering problem. Eur J Oper Res 267:264–272

    Article  MathSciNet  MATH  Google Scholar 

  • Chen C, Cheng SF, Gunawan A, Misra A, Dasgupta K, Chander D (2014) TRACCS: Trajectory-aware coordinated urban crowd-sourcing. In: Proceedings of the second AAAI conference on human computation and crowdsourcing (HCOMP 2014), Pittsburgh, USA

    Google Scholar 

  • Chen C, Cheng SF, Lau HC, Misra A (2015) Towards city-scale mobile crowdsourcing: task recommendations under trajectory uncertainties. In: Proceedings of the international joint conference on artificial intelligence (IJCAI-2015), Buenos Aires, Argentina

    Google Scholar 

  • Divsalar A, Vansteenwegen P, Cattrysse D (2013) The orienteering problem with hotel selection: a variable neighborhood search method. Int J Prod Econ 145(1):150–160

    Article  Google Scholar 

  • Divsalar A, Vansteenwegen P, Sorensen K, Cattrysse D (2014) A memetic algorithm for the orienteering problem with hotel selection. Eur J Oper Res 237(1):29–49

    Article  MATH  Google Scholar 

  • Erdoğan G, Laporte G (2013) The orienteering problem with variable profits. Networks 61(2):104–116

    Article  MathSciNet  MATH  Google Scholar 

  • Garcia A, Vansteenwegen P, Arbelaitz O, Souffriau W, Linaza MT (2013) Integrating public transportation in personalised electronic tourist guides. Comput Oper Res 40(3):758–774

    Article  Google Scholar 

  • Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014a) A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20(3):291–328

    Article  Google Scholar 

  • Geem ZW, Tseng CL, Park Y (2005) Harmony search for generalized orienteering problem: best touring in china. In: Wang L, Chen K, Ong YS (eds) Advances in natural computation, vol 3612. Lecture notes in computer science. Springer, Berlin, pp 741–750

    Google Scholar 

  • Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: a survey of recent variants, solution approaches and applications. Eur J Oper Res 255(2):315–332

    Article  MathSciNet  MATH  Google Scholar 

  • Herzog D, Wörndl W (2014) A travel recommender system for combining multiple travel regions to a composite trip. In: Proceedings of new trends in content-based recommender systems (CBRecSys) workshop, 8th ACM conference on recommender systems, California, USA

    Google Scholar 

  • Ludwig B, Zenker B, Schrader J (2009) Recommendation of personalized routes with public transport connections. In: Tavangarian D, Kirste T, Timmermann D, Lucke U, Versick D (eds) Intelligent interactive assistance and mobile multimedia computing: international conference, IMC 2009, communications in computer and information science, vol 53. Springer, Berlin, pp 97–107

    Chapter  Google Scholar 

  • Malucelli F, Giovannini A, Nonato M (2015) Designing single origin-destination itineraries for several classes of cycle-tourists. Transp Res Procedia 10:413–422

    Article  Google Scholar 

  • Peng G, Dewil R, Verbeeck C, Gunawan A, Xing L, Vansteenwegen P (2019) Agile earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times. Comput Oper Res 111:84–98

    Article  MathSciNet  Google Scholar 

  • Peng G, Vansteenwegen P, Liu X, Xing L, Kong X, (2018) An iterated local search algorithm for agile earth observation satellite scheduling. In: Proceedings of 2018 spaceOps conference, Marseille, France

    Google Scholar 

  • Pietz J, Royset JO (2013) Generalized orienteering problem with resource depedent rewards. Nav Res Logist 60(4):294–312

    Article  MATH  Google Scholar 

  • Souffriau W, Vansteenwegen P, Vertommen J, Vanden Berghe G, Van Oudheusden D (2008) A personalised tourist trip design algorithm for mobile tourist guides. Appl Artif Intell 22(10):964–985

    Article  Google Scholar 

  • Souffriau W, Vansteenwegen P, Vanden Berghe G, Van Oudheusden D (2013) The multiconstraint team orienteering problem with multiple time windows. Transp Sci 47(1):53–63

    Article  MATH  Google Scholar 

  • Sylejmani K, Dika A (2011) Solving touristic trip planning problem by using taboo search approach. Int J Comput Sci 8(5):139–149

    Google Scholar 

  • Tricoire F, Romauch M, Doerner KF, Hartl RF (2010) Heuristics for the multi-period orienteering problem with multiple time windows. Comput Oper Res 37(2):351–367

    Article  MathSciNet  MATH  Google Scholar 

  • Vander Merwe M, Minas JP, Ozlen M, Hearne JW (2014) The cooperative orienteering problem with time windows. Optim Online

    Google Scholar 

  • Vansteenwegen P, Mateo M (2014) An iterated local search algorithm for the single-vehicle cyclic inventory routing problem. Eur J Oper Res 237(3):802–813

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Vansteenwegen P, Souffriau W, Vanden Berghe G, Van Oudheusden D (2011) The city trip planner: an expert system for tourists. Expert Syst Appl 38(6):6540–6546

    Article  Google Scholar 

  • Verbeeck C, Vansteenwegen P, Aghezzaf EH (2014b) An extension of the arc orienteering problem and its application to cycle trip planning. Transp Res Part E 68:64–78

    Article  Google Scholar 

  • Yu J, Aslam J, Karaman S, Rus D (2015) Anytime planning of optimal schedules for a mobile sensing robot. In: Proceedings of IEEE/RSJ international conference on intelligent robots and systems (IROS 2015), Hamburg, Germany

    Google Scholar 

  • Zhang S, Ohlmann JW, Thomas BW (2014) A priori orienteering with time windows and stochastic wait times at customers. Eur J Oper Res 239(1):70–79

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KU Leuven Mobility Research Centre, University of Leuven, Leuven, Belgium

    Pieter Vansteenwegen

  2. School of Information Systems, Singapore Management University, Singapore, Singapore

    Aldy Gunawan

Authors
  1. Pieter Vansteenwegen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aldy Gunawan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pieter Vansteenwegen .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Vansteenwegen, P., Gunawan, A. (2019). Applications of the OP. In: Orienteering Problems. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29746-6_7

Download citation

Publish with us

Policies and ethics

Search

Navigation