Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design

Jiang, Xiaoping and Bai, Ruibin and Wallace, Stein W. and Kendall, Graham and Landa-Silva, Dario (2020) Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design. Computers & Operations Research, 128 . p. 105182. ISSN 03050548

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (3MB) | Preview

Abstract

We present a method for bundling scenarios in a progressive hedging heuristic (PHH) applied to stochastic service network design, where the uncertain demand is represented by a finite number of scenarios. Given the number of scenario bundles, we first calculate a vector of probabilities for every scenario, which measures the association strength of a scenario to each bundle center. This membership score calculation is based on existing soft clustering algorithms such as Fuzzy C-Means (FCM) and Gaussian Mixture Models (GMM). After obtaining the probabilistic membership scores, we propose a strategy to determine the scenario-to-bundle assignment. By contrast, almost all existing scenario bundling methods such as K-Means (KM) assume before the scenario-to-bundle assignment that a scenario belongs to exactly one bundle, which is equivalent to requiring that the membership scores are Boolean values. The probabilistic membership scores bring many advantages over Boolean ones, such as the flexibility to create various degrees of overlap between scenario bundles and the capability to accommodate scenario bundles with different covariance structures. We empirically study the impacts of different degrees of overlap and covariance structures on PHH performance by comparing PHH based on FCM/GMM with that based on KM and the cover method, which represents the state-of-the-art scenario bundling algorithm for stochastic network design. The solution quality is measured against the lower bound provided by CPLEX. The experimental results show that, GMM-based PHH yields the best performance among all methods considered, achieving nearly equivalent solution quality in a fraction of the run-time of the other methods.

Item Type: Article
Keywords: Network design; Stochastic mixed-integer programs; Progressive hedging; Scenario bundling
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
Identification Number: https://doi.org/10.1016/j.cor.2020.105182
Depositing User: Yu, Tiffany
Date Deposited: 22 Jan 2021 05:56
Last Modified: 22 Jan 2021 05:56
URI: http://eprints.nottingham.ac.uk/id/eprint/64316

Actions (Archive Staff Only)

Edit View Edit View