Title | ||
---|---|---|
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. |
Abstract | ||
---|---|---|
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. (C) 2016 Wiley Periodicals, Inc. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1002/net.21691 | NETWORKS |
Keywords | Field | DocType |
capacity expansion,robustness,uncertain demand,bi-objective optimization,minimum cost flow,complexity,approximation | Objective approach,Approximation algorithm,Mathematical optimization,Enumeration,Quality of service,Robustness (computer science),Compromise,Mathematics,Minimum-cost flow problem | Journal |
Volume | Issue | ISSN |
68.0 | 3.0 | 0028-3045 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hassene Aissi | 1 | 312 | 17.03 |
Daniel Vanderpooten | 2 | 1153 | 74.66 |