Abstract
We have described the basic orienteering problem (OP) in Chap. 2, as one known variant of the single vehicle routing problems with profits (VRPP). In this chapter, we introduce the best-known variants of the OP. The first one is the team orienteering problem (TOP). In the TOP multiple routes can be composed to visit a subset of customers. In the context of the game of orienteering, the TOP corresponds to several players of the same team, each collecting profits in parallel, during the same time span. Another well-known variant of the basic OP is the OP with time windows (OPTW), imposing time windows for each customer. If we consider, for example, an application in tourism, we should account for the fact that most tourist attractions are only open within certain opening hours. Arriving at an attraction after it has closed or long before it will open, should be avoided. Both variants, the TOP and the OPTW come together in the third well-known variant, the team OP with time windows (TOPTW), where time windows are considered together with multiple vehicles (or a multiple day trip). The TOP, OPTW, and TOPTW will be presented in detail in this chapter, together with an appropriate mathematical model. Other variants and extensions of the OP, modeling more complex and complicated optimization problems from practice, will be explained in Chap. 8.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Butt SE, Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21(1):101–111
Chao IM, Golden BL, Wasil EA (1996b) The team orienteering problem. Eur J Oper Res 88(3):464–474
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
Gunawan A, Lau HC, Vansteenwegen P, Kun L (2017) Well-tuned algorithms for the team orienteering problem with time windows. J Oper Res Soc 68(8):861–876
Gunawan A, Lau HC, Kun L (2018) ADOPT: combining parameter tuning and adaptive operator ordering for solving a class of orienteering problems. Comput Ind Eng 121:82–96
Hu Q, Lim A (2014) An iterative three-component heuristic for the team orienteering problem with time windows. Eur J Oper Res 232(2):276–286
Lin SW, Yu VF (2012) A simulated annealing heuristic for the team orienteering problem with time windows. Eur J Oper Res 217(1):94–107
Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32(6):1379–1407
Vansteenwegen P, Souffriau W, Vanden Berghe G, Van Oudheusden D (2009) Iterated local search for the team orienteering problem with time windows. Comput Oper Res 36(12):3281–3290
Vansteenwegen P, Souffriau W, Van Oudheusden D (2011a) The orienteering problem: a survey. Eur J Oper Res 209(1):1–10
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Vansteenwegen, P., Gunawan, A. (2019). Definitions and Mathematical Models of OP Variants. In: Orienteering Problems. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29746-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-29746-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29745-9
Online ISBN: 978-3-030-29746-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)