• search hit 11 of 27
Back to Result List

On The Recoverable Robust Traveling Salesman Problem

  • We consider an uncertain traveling salesman problem, where distances between nodes are not known exactly, but may stem from an uncertainty set of possible scenarios. This uncertainty set is given as intervals with an additional bound on the number of distances that may deviate from their expected, nominal value. A recoverable robust model is proposed, that allows a tour to change a bounded number of edges once a scenario becomes known. As the model contains an exponential number of constraints and variables, an iterative algorithm is proposed, in which tours and scenarios are computed alternately. While this approach is able to find a provably optimal solution to the robust model, it also needs to solve increasingly complex subproblems. Therefore, we also consider heuristic solution procedures based on local search moves using a heuristic estimate of the actual objective function. In computational experiments, these approaches are compared. Finally, an alternative recovery model is discussed, where a second-stage recovery tour is not required to visit all nodes of the graph. We show that the previously NP-hard evaluation of a fixed solution now becomes solvable in polynomial time.

Download full text files

Export metadata

Author:Andre Chassein, Marc Goerigk
URN (permanent link):urn:nbn:de:hbz:386-kluedo-38988
Document Type:Preprint
Language of publication:English
Publication Date:2014/10/15
Year of Publication:2014
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2014/10/16
Number of page:17
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 10.09.2012