Abstract
Chapter 3 describes the definitions and mathematical models of the OPTW and the TOPTW in detail. In this chapter, the benchmark instances and the state-of-the-art solution techniques of both problems will be discussed. The solution techniques are classified into two categories: exact approaches and metaheuristic techniques, which is similar to the classification of solution techniques for the OP and the TOP. In this chapter, we discuss the most important characteristics of these solution approaches and some crucial insights in their effectiveness. For more details, readers are referred to the original papers mentioned in the last section.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cura T (2014) An artificial bee colony algorithm approach for the team orienteering problem with time windows. Comput Ind Eng 74:270–290
Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Tasoulas Y (2013) Cluster-based heuristics for the team orienteering problem with time windows. In: Bonifaci V, Demetrescu C, Marchetti-Spaccamela A (eds) Experimental algorihtms, vol 7933. Lecture Notes in Computer Science. Springer, pp 390–401
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
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
Kantor MG, Rosenwein MB (1992) The orienteering problem with time windows. J Oper Res Soc 43(6):629–635
Labadie N, Mansini R, Melechovskỳ J, Calvo RW (2011) Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J Heuristics 17(6):729–753
Labadie N, Mansini R, Melechovskỳ J, Calvo RW (2012) The team orienteering problem with time windows: an lp-based granular variable neighborhood search. Eur J Oper Res 220(1):15–27
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
Montemanni R, Gambardella LM (2009) Ant colony system for team orienteering problem with time windows. Found Comput Decis Sci 34(4):287–306
Righini G, Salani M (2008) New dynamic programing algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155–170
Righini G, Salani M (2009) Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput Oper Res 36(4):1191–1203
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
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). State-of-the-Art Solution Techniques for OPTW and TOPTW. In: Orienteering Problems. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29746-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-29746-6_6
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)