Ranking Robustness and its Application to Evacuation Planning

  • We present a new approach to handle uncertain combinatorial optimization problems that uses solution ranking procedures to determine the degree of robustness of a solution. Unlike classic concepts for robust optimization, our approach is not purely based on absolute quantitative performance, but also includes qualitative aspects that are of major importance for the decision maker. We discuss the two variants, solution ranking and objective ranking robustness, in more detail, presenting problem complexities and solution approaches. Using an uncertain shortest path problem as a computational example, the potential of our approach is demonstrated in the context of evacuation planning due to river flooding.

Download full text files

Export metadata

Metadaten
Author:Marc Goerigk, Horst Hamacher, Anika Kinscherff
URN:urn:nbn:de:hbz:386-kluedo-42966
Series (Serial Number):Report in Wirtschaftsmathematik (WIMA Report) (160)
Document Type:Preprint
Language of publication:English
Date of Publication (online):2016/01/02
Year of first Publication:2016
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2016/02/03
Page Number:22
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vom 30.07.2015