Skip to main content
SpringerLink
Log in

Other Orienteering Problem Variants

  • Chapter
  • First Online:
Orienteering Problems

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

Abstract

In this chapter, different variants of routing problems with profits will be discussed. Based on what is available in literature, mostly variants of the orienteering problem will be discussed. A first variant considers capacity constraints, since these appear frequently in many practical applications. Next, multi-objective orienteering problems, explicitly considering different types of profits separately are discussed. Time-dependent and stochastic travel times are also relevant for most practical applications. These are considered together with time-dependent and stochastic profits. More and more routing problems are considered together with inventory management. For routing problems with profits, this leads to the inventory orienteering problem.

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

  • Abbaspour RA, Samadzadegan F (2011) Time-dependent personal tour planning and scheduling in metropolises. Expert Syst Appl 38(10):12439–12452

    Article  Google Scholar 

  • Aghezzaf EH, Zhong Y, Raa B, Mateo M (2012) Analysis of the single-vehicle cyclic inventory routing problem. Int J Syst Sci 43:2040–2049

    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 (2013a) 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 (2013b) Optimal solutions for routing problems with profits. Discrete Appl Math 161(4–5):547–557

    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 

  • Bérubé JF, Gendreau M, Potvin JY (2009b) An exact e-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur J Oper Res 194:39–50

    Article  MathSciNet  MATH  Google Scholar 

  • Campbell AM, Gendreau M, Thomas BW (2011) The orienteering problem with stochastic travel and service times. Ann Oper Res 186(1):61–81

    Article  MathSciNet  MATH  Google Scholar 

  • Dewilde T, Cattrysse D, Coene S, Spieksma F, Vansteenwegen P (2013) Heuristics for the traveling repairman problem with profits. Comput Oper Res 40:1700–1707

    Article  MathSciNet  MATH  Google Scholar 

  • Evers L, Glorie K, van der Ster S, Barros AI (2014) A two-stage approach to the orienteering problem with stochastic weights. Comput Oper Res 43:248–260

    Article  MathSciNet  MATH  Google Scholar 

  • Fomin FV, Lingas A (2002) Approximation algorithms for time-dependent orienteering. Inf Process Lett 83:57–62

    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 

  • Garcia A, Arbelaitz O, Vansteenwegen P, Souffriau W, Linaza MT (2010) Hybrid approach for the public transportation time dependent orienteering problem with time windows. In: Corchado E, Romay MG, Savio AM (eds) Hybrid artificial intelligence systems. Lecture notes on artificial intelligence, vol 6077. Berlin, Germany, pp 151–158

    Google Scholar 

  • Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Vathis N (2014b) Efficient heuristics for the time dependent team orienteering problem with time windows. In: Gupta P, Zaroliagis C (eds) Proceedings of the first international conference on applied algorithms (ICAA 2014). Lecture notes in computer science, vol 8321. Springer, pp 152–163

    Google Scholar 

  • Gunawan A, Yuan Z, Lau HC (2014) A mathematical model and metaheuristics for time dependent orienteering problem. In: Proceedings of the 10th international conference of the practice and theory of automated timetabling (PATAT 2014), pp 202–217

    Google Scholar 

  • Ilhan T, Iravani SMR, Daskin MS (2008) The orienteering problem with stochastic profits. IIE Trans 40(4):406–421

    Article  Google Scholar 

  • Lau HC, Yeoh W, Varakantham P, Nguyen DT, Chen H (2012) Dynamic stochastic orienteering problems for risk-aware applications. In: Proceedings of the twenty-eighth conference annual conference on uncertainty in artificial intelligence (UAI-12). AUAI Press, Corvallis, Oregon, pp 448–458

    Google Scholar 

  • Lefever W, Aghezzaf EH, Hadj-Hamou K (2016) A convex optimization approach for solving the single-vehicle cyclic inventory routing problem. Comput Oper Res 72:97–106

    Article  MathSciNet  MATH  Google Scholar 

  • Li J (2012) Research on team orienteering problem with dynamic travel times. J Softw 7(2):249–255

    Google Scholar 

  • Matl P, Nolz P, Ritzinger U, Ruthmair M, Tricoire F (2017) Bi-objective orienteering for personal activity scheduling. Comput Oper Res 82:69–82

    Article  MathSciNet  MATH  Google Scholar 

  • Papapanagiotou V, Montemanni R, Gambardella LM (2014) Objective function evaluation methods for the orienteering problem with stochastic travel and service times. J Appl Oper Res 6(1):16–29

    MATH  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 

  • Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the biobjective orienteering problem. Swarm Intell 3(3):179–201

    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 

  • Tarantilis CD, Stavropoulou F, Repoussis PP (2013) The capacitated team orienteering problem: a bi-level filter-and-fan method. Eur J Oper Res 224(1):65–78

    Article  MathSciNet  MATH  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 

  • Varakantham P, Kumar A (2013) Optimization approaches for solving chance constrained stochastic orienteering problems. In: Perny P, Pirlot M, Tsoukiàs A (eds) Proceedings of the third international conference in algorithmic decision theory (ADT2013). Lecture notes in computer science, vol 8176. Springer, pp 387–398

    Google Scholar 

  • Verbeeck C, Sörensen K, Aghezzaf EH, Vansteenwegen P (2014a) A fast solution method for the time-dependent orienteering problem. Eur J Oper Res 236(2):419–432

    Article  MathSciNet  MATH  Google Scholar 

  • Verbeeck C, Vansteenwegen P, Aghezzaf EH (2016) Solving the stochastic time-dependent orienteering problem with time windows. Eur J Oper Res 255:699–718

    Article  MathSciNet  MATH  Google Scholar 

  • Wang X, Golden BL, Gulczynski D (2014) A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optim Lett 8(8):2349–2356

    Article  MathSciNet  MATH  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 

  • Zhong Y, Aghezzaf EH (2012) Effective local search approaches for the single-vehicle cyclic inventory routing problem. Int J Serv Oper Inf 7(4):260–279

    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). Other Orienteering Problem Variants. In: Orienteering Problems. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29746-6_8

Download citation

Publish with us

Policies and ethics

Search

Navigation