Abstract
The prize-collecting travelling salesman problem (pc-tsp) is a known variant of the classical travelling salesman problem. In the pc-tsp, we are given a weighted graph \(G=(V,E)\) with edge weights \(\ell :E\rightarrow {\mathbb {R}}_+\), a special vertex \(r\in V\), penalties \(\pi :V\rightarrow {\mathbb {R}}_+\) and the goal is to find a closed tour K such that \(r\in V(K)\) and such that the cost \(\ell (K)+\pi (V{\setminus } V(K))\), which is the sum of the weights of the edges in the tour and the cost of the vertices not spanned by K, is minimized. In this paper, we study the pc-tsp from a viewpoint of robust optimization. In our setting, an operator must find a closed tour in a (known) edge-weighted tree \(T=(V,E)\) starting and ending in the depot r while some of the edges may be blocked by “avalanches” defining the scenario \(\xi \). The cost \(f(K,\xi )\) of a tour K in scenario \(\xi \) is the cost resulting from “shortcutting” K, i.e. from restricting K to the nodes which are reachable from r in scenario \(\xi \), i.e. in the graph \(T {\setminus } \xi =(V,E{\setminus }\xi )\). In the absolute robust version of the problem one searches for a tour which minimizes the worst-case cost over all scenarios, while in the deviation robust counterpart, the regret, that is, the deviation from an optimum solution for a particular scenario, is sought to be minimized. We show that both versions of the problem can be solved in polynomial time on trees.
Similar content being viewed by others
Notes
Here, we adopt the usual notation that for a function \(f{:}\, S\rightarrow \mathbb {R}\) and a subset \(U\subseteq S\) we write \(f(U):=\sum _{u\in U} f(u)\).
References
Archer A, Bateni M, Hajiaghayi M, Karlow H (2011) Improved approximation algorithm for prize-collecting Steiner tree and TSP. SIAM J Comput 40(2):309–332. doi:10.1137/090771429
Ausiello G, Bonifaci V, Leonardi S, Marchetti-Spaccamela A (2007) Prize-collecting traveling salesman and related problems. In: Gonzalez T (ed) Handbook of approximation algorithms and metaheuristics. CRC Press, pp 40.1–40.13
Awerbuch B, Azar Y, Blum A, Vempala S (1995) Improved approximation guarantees for minimum-weight \(k\)-trees and prize-collecting salesmen. In: Proceedings of the 27th annual ACM symposium on the theory of computing, pp 277–376
Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636
Bar-Noy A, Schieber B (1991) The Canadian traveller problem. In: Proceedings of the second annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, New York, pp 261–270
Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton
Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Progr 99(2):351–376
Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Op Res 23(4):769–805
Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Progr 88(3):411–424
Bertsimas D, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464–501
Bertsimas D, Sim M (2004) The price of robustness. Op Res 52(1):35–53
Beyer H-G, Sendhoff B (2007) Robust optimization-a comprehensive survey. Comput Methods Appl Mech Eng 196(33):3190–3218
Bienstock D, Goemans MX, Simchi-Levi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Math Progr 59(1–3):413–420
Büttner S (2012) Online network routing amongst unknown obstacles. In: Proceedings of the 21st international symposium on mathematical programming (ISMP), p 209
Büttner S (2014) Online disruption and delay management. Verlag Dr. Hut, München. ISBN 978-3-8439-1383-6
Büttner S, Krumke SO (2012) The Canadian tour operator problem (online graph exploration with disposal). In: Proceedings of the 38th international workshop on graph theoretic concepts in computer science. Springer, New York, p 4
Fischetti M, Monaci M (2009) Light robustness. In: Proceedings of robust and online large-scale optimization. Springer, New York, pp 61–84
Gabriel V, Murat C, Thiele A (2014) Recent advances in robust optimization: an overview. Eur J Op Res 235:471–483
Garey MR, Johnson DS (1979) Computers and intractability, vol 174. W.H. Freeman, New York
Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Proceedings of the 10th workshop on algorithmic approaches for transportation modelling, optimization, and systems, pp 100–113
Goerigk, M, Schöbel A (2011) A scenario-based approach for robust linear optimization. In: Proceedings of the 1st International ICST conference on theory and practice of algorithms in (computer) systems. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg, pp 139–150
Lawler EL, Lenstra JK, Rinnooy Kan AH, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization, vol 3. Wiley, Chichester
Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Proceedings of robust and online large-scale optimization. Springer, New York, pp 1–27
Papadimitriou CH, Yannakakis M (1989) Shortest paths without a map. In: Proceedings of the 16th international colloquium on automata, languages and programming. Springer, New York, pp 610–620
Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. In: Proceedings of lecture notes in computer science, vol. 840. Springer, New York
Schöbel A (2014) Generalized light robustness and the trade-off between robustness and nominal quality. Math Methods Op Res 80(2):161–191
Westphal S (2008) A note on the \(k\)-Canadian traveller problem. Inf Process Lett 106(3):87–89
Yu G, Yang J (1998) On the robust shortest path problem. Comput Op Res 25(6):457–468
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Büttner, S., Krumke, S.O. Robust optimization for routing problems on trees. TOP 24, 338–359 (2016). https://doi.org/10.1007/s11750-015-0384-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-015-0384-x
Keywords
- Robust optimization
- Routing problem
- Dynamic programming
- Uncertainty
- Prize collecting traveling salesman problem