• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Robust location transportation problems under uncertain demands

Gabrel, Virginie; Lacroix, Mathieu; Murat, Cécile; Remli, Nabila (2014), Robust location transportation problems under uncertain demands, Discrete Applied Mathematics, 146, part 1. 10.1016/j.dam.2011.09.015

Type
Article accepté pour publication ou publié
Date
2014
Journal name
Discrete Applied Mathematics
Volume
146
Number
part 1
Publisher
Elsevier
Publication identifier
10.1016/j.dam.2011.09.015
Metadata
Show full item record
Author(s)
Gabrel, Virginie
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Lacroix, Mathieu cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Murat, Cécile
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Remli, Nabila
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In robust optimization, the multi-stage context (or dynamic decision-making) assumes that the information is revealed in stages. So, part of the decisions must be taken before knowing the real values of the uncertain parameters, and another part, called recourse decisions, is taken when the information is known. In this paper, we are interested in a robust version of the locationtransportationproblem with an uncertaindemand using a 2-stage formulation. The obtained robust formulation is a convex (not linear) program, and we apply a cutting plane algorithm to exactly solve the problem. At each iteration, we have to solve an NP-hard recourse problem in an exact way, which is time-consuming. Here, we go further in the analysis of the recourse problem of the locationtransportationproblem. In particular, we propose a mixed integer program formulation to solve the quadratic recourse problem and we define a tight bound for this reformulation. We present an extensive computation analysis of the 2-stage robustlocationtransportationproblem. The proposed tight bound allows us to solve large size instances.
Subjects / Keywords
Robust optimization; Location transportation problem; Mixed integer linear programming; Interval uncertainty; Convex optimization

Related items

Showing items related by title and author.

  • Thumbnail
    Recourse problem of the 2-stage robust location transportation problem 
    Remli, Nabila; Murat, Cécile; Gabrel, Virginie; Lacroix, Mathieu (2010) Communication / Conférence
  • Thumbnail
    A New Bound for Solving the Recourse Problem of the 2-Stage Robust Location Transportation Problem 
    Remli, Nabila; Murat, Cécile; Gabrel, Virginie; Lacroix, Mathieu (2010) Document de travail / Working paper
  • Thumbnail
    Robust Supply Chain Management Problem with Uncertain Demands 
    Remli, Nabila; Murat, Cécile; Gabrel, Virginie (2011) Communication / Conférence
  • Thumbnail
    Nouvelle approche pour traiter des problèmes linéaires avec seconds membres incertains. Application au problème de transport 
    Remli, Nabila; Gabrel, Virginie; Murat, Cécile (2010) Communication / Conférence
  • Thumbnail
    A robust p-Center problem under pressure to locate shelters in wildfire context 
    Demange, Marc; Gabrel, Virginie; Haddad, Marcel Adonis; Murat, Cécile (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo