Lexicographic α-robustness : an application to the 1-median problem

Abstract : 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.
Type de document :
Article dans une revue
RAIRO - Operations Research, EDP Sciences, 2010, vol. 44, n°2, pp. 119-138. 〈10.1051/ro/2010010〉
Liste complète des métadonnées

https://hal-rbs.archives-ouvertes.fr/hal-00565530
Contributeur : Emilie Breton <>
Soumis le : dimanche 13 février 2011 - 19:47:38
Dernière modification le : jeudi 11 janvier 2018 - 06:17:30

Lien texte intégral

Identifiants

Collections

PSL

Citation

Rim Kalai-Jemai, M.A Aloulou, P.H Vallin, D. Vanderpooten. Lexicographic α-robustness : an application to the 1-median problem. RAIRO - Operations Research, EDP Sciences, 2010, vol. 44, n°2, pp. 119-138. 〈10.1051/ro/2010010〉. 〈hal-00565530〉

Partager

Métriques

Consultations de la notice

150