Progressive hedging-based meta-heuristics for stochastic network design

Crainic, Teodor G and Fu, Xiaorui and Gendreau, Michel and Rei, Walter and Wallace, Stein W (2011) Progressive hedging-based meta-heuristics for stochastic network design. Networks, 58 (2). pp. 114-124. ISSN 0028-3045

Full text not available from this repository.


We consider the stochastic fixed-charge capacitated multicommodity network design (S-CMND) problem with uncertain demand. We propose a two-stage stochastic programming formulation, where design decisions make up the first stage, while recourse decisions are made in the second stage to distribute the commodities according to observed demands. The overall objective is to optimize the cost of the first-stage design decisions plus the total expected distribution cost incurred in the second stage. To solve this formulation, we propose a metaheuristic framework inspired by the progressive hedging algorithm of Rockafellar and Wets. Following this strategy, scenario decomposition is used to separate the stochastic problem following the possible outcomes, scenarios, of the random event. Each scenario subproblem then becomes a deterministic CMND problem to be solved, which may be addressed by efficient specialized methods. We also propose and compare different strategies to gradually guide scenario subproblems to agree on the status of design arcs and aim for a good global design. These strategies are embedded into a parallel solution method, which is numerically shown to be computationally efficient and to yield high-quality solutions under various problem characteristics and demand correlations

Item Type:
Journal Article
Journal or Publication Title:
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
11 Jul 2011 18:38
Last Modified:
01 May 2022 06:57