Abstract
In Chaps. 2 and 3, different orienteering problems (or routing problems with profits) were introduced. The single vehicle problems were discussed in Chap. 2: the profitable tour problem (PTP), the prize-collecting traveling salesperson problem (PCTSP), and the orienteering problem (OP). The multi vehicle problems were discussed in Chap. 3: the team orienteering problem (TOP) and the team orienteering problem with time windows (TOPTW). For discussing the state-of-the-art solution techniques for these different orienteering problems in Chaps. 4, 5, and 6, the problems will be classified differently, based on the similarities between the solution techniques. Therefore, the PTP and PCTSP are discussed in this chapter, the OP and TOP in the next chapter and the problems with time windows, OPTW and TOPTW, in Chap. 6. Moreover, it should be noted that only a few solution techniques have been developed for the PTP and the PCTSP, while many more solution techniques have been developed for the OP, TOP, OPTW, and TOPTW.
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
Aksen D, Aras N (2006) Customer selection and profit maximization in vehicle routing problems. In: Haasis H, Kopfer H, Schönberger J (eds) Research proceedings 2005. Springer, Berlin, pp 37–42
Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia, pp 273–298
Balas E (1989) The prize collecting traveling salesman problem. Networks 19:621–636
Balas E (1995) The prize collecting traveling salesman problem. II: polyhedral results. Networks 25:199–216
Balas E (2002) The prize collecting traveling salesman problem and its applications. In: Gutin G, Punnen A (eds) Traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, pp 663–695
Bérubé JF, Gendreau M, Potvin JY (2009) A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54:56–67
DellAmico M, Maffioli F, Vbrand P (1995) On prize-collecting tours and the asymmetric travelling salesman problem. Int Trans Oper Res 2:297–308
DellAmico M, Maffioli F, Sciomachen A (1998) A Lagrangian heuristic for the prize collecting travelling salesman problem. Ann Oper Res 81:289–306
Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transp Sci 39(2):188–205
Fischetti M, Salazar-González JJ, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10:133–148
Goemans M (2009) Combining approximation algorithms for the prize-collecting TSP. In: Proceedings of CORR
Goemans M, Bertsimas D (1990) On the parsimonious property of connectivity problems. In: SODA 1990 proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pp 388–396
Nguyen V (2010) A primal-dual approximation algorithm for the asymmetric prize-collecting TSP. In: Wu W, Daescu O (eds) Combinatorial optimization and applications. Lecture notes in computer science. Springer, Berlin, pp 260–269
Nguyen V, Nguyen T (2010) Approximating the asymmetric profitable tour. Electron Not Discret Math 36:907–914
Stavropoulou F, Repoussis P, Tarantilis C (2019) The vehicle routing problem with profits and consistency constraints. Eur J Oper Res 274:340–356
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 PTP and PCTSP. In: Orienteering Problems. EURO Advanced Tutorials on Operational Research. Springer, Cham. https://doi.org/10.1007/978-3-030-29746-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-29746-6_4
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)