Xiaoping Jiang
Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design
Jiang, Xiaoping; Bai, Ruibin; Wallace, Stein W.; Kendall, Graham; Landa-Silva, Dario
Authors
Ruibin Bai
Stein W. Wallace
Graham Kendall
Professor DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
PROFESSOR OF COMPUTATIONAL OPTIMISATION
Abstract
© 2020 Elsevier Ltd 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.
Citation
Jiang, X., Bai, R., Wallace, S. W., Kendall, G., & Landa-Silva, D. (2021). Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design. Computers and Operations Research, 128, Article 105182. https://doi.org/10.1016/j.cor.2020.105182
Journal Article Type | Article |
---|---|
Acceptance Date | Dec 8, 2020 |
Online Publication Date | Dec 17, 2020 |
Publication Date | Apr 1, 2021 |
Deposit Date | Oct 22, 2024 |
Publicly Available Date | Oct 23, 2024 |
Journal | Computers and Operations Research |
Print ISSN | 0305-0548 |
Electronic ISSN | 1873-765X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 128 |
Article Number | 105182 |
DOI | https://doi.org/10.1016/j.cor.2020.105182 |
Public URL | https://nottingham-repository.worktribe.com/output/5207234 |
Publisher URL | https://www.sciencedirect.com/science/article/pii/S0305054820302999?via%3Dihub |
Files
35446666
(3.2 Mb)
PDF
You might also like
Local-global methods for generalised solar irradiance forecasting
(2024)
Journal Article
UAV Path Planning for Area Coverage and Energy Consumption in Oil and Gas Exploration Environment
(2023)
Presentation / Conference Contribution
Evolving Deep CNN-LSTMs for Inventory Time Series Prediction
(2019)
Presentation / Conference Contribution
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search