• 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 capacity expansion of a network under demand uncertainty: a bi-objective approach

Aissi, Hassene; Vanderpooten, Daniel (2016), Robust capacity expansion of a network under demand uncertainty: a bi-objective approach, Networks, 68, 3, p. 185-199. 10.1002/net.21691

Type
Article accepté pour publication ou publié
Date
2016
Journal name
Networks
Volume
68
Number
3
Publisher
Wiley
Pages
185-199
Publication identifier
10.1002/net.21691
Metadata
Show full item record
Author(s)
Aissi, Hassene
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Vanderpooten, Daniel
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
This paper deals with the problem of capacity expansion of a network under independent uncertain demands defined by interval sets. In this context, decisions about capacity expansion must be made before the demands are revealed. Standard robust models require the definition of an uncertainty domain and look for the minimum cost solution able to satisfy any demand within this domain. We propose, justify, and illustrate an alternative robust model based on a bi-objective formulation. Therefore, in addition to the cost criterion, we consider a second criterion, related to the Quality of Service, which measures the ability of a solution to handle any demand. The decision-maker can be interested in efficient solutions offering a compromise between these criteria. We study the complexity of the enumeration of the corresponding nondominated set, and propose exact and approximation algorithms.
Subjects / Keywords
capacity expansion; robustness; uncertain demand; bi-objective optimization; minimum cost flow; complexity; approximation

Related items

Showing items related by title and author.

  • Thumbnail
    Robust approaches for the data association problem 
    Aissi, Hassene; Vanderpooten, Daniel; Vanpeperstraete, Jean-Michel (2005) Communication / Conférence
  • Thumbnail
    Weighted sum model with partial preference information: application to Multi-Objective Optimization 
    Kaddani, Sami; Vanderpooten, Daniel; Vanpeperstraete, Jean-Michel; Aissi, Hassene (2017) Article accepté pour publication ou publié
  • Thumbnail
    Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem 
    Figueira, José; Paquete, Luis; Simoes, Marco; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
  • Thumbnail
    Bi-objective matchings with the triangle inequality 
    Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
  • Thumbnail
    Minimizing the number of late jobs on a single machine under due date uncertainty 
    Aissi, Hassene; Aloulou, Mohamed Ali; Kovalyov, Mikhail Y. (2011) 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