Volume 44, Number 2, April-June 2010
|Page(s)||119 - 138|
|Published online||27 April 2010|
Lexicographic α-robustness: an application to the 1-median problem
Rouen Business School, 1 rue du Maréchal Juin, BP 215 – 76825 Mont Saint Aignan
Cedex, France; email@example.com
2 LAMSADE, Université Paris-Dauphine, Pl. du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France.
Accepted: 2 October 2009
In the last decade, several robustness approaches have been developed to deal with uncertainty. In decision problems, and particularly in location problems, the most used robustness approach rely either on maximal cost or on maximal regret criteria. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of criteria based on the worst case. We apply this approach to the 1-median location problem under uncertainty on node weights and we give a specific algorithm to determine robust solutions in the case of a tree. We also show that this algorithm can be extended to the case of a general network.
Mathematics Subject Classification: 90B50
Key words: Robustness / 1-median location problem / minmax cost/regret
© EDP Sciences, ROADEF, SMAI, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.