Next Article in Journal
Enhancing the Robustness of AI-Generated Text Detectors: A Survey
Previous Article in Journal
PSL-IoD: PUF-Based Secure Last-Mile Drone Delivery in Supply Chain Management
Previous Article in Special Issue
Applying λ-Statistical Convergence in Fuzzy Paranormed Spaces to Supply Chain Inventory Management Under Demand Shocks (DS)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Wasserstein Distributionally Robust Optimization for Chance Constrained Facility Location Under Uncertain Demand

1
Department of Computer Science Systems and Communication, University of Milano-Bicocca, 20126 Milan, Italy
2
Department of Economics Management and Statistics, University of Milano-Bicocca, 20126 Milan, Italy
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(13), 2144; https://doi.org/10.3390/math13132144
Submission received: 14 May 2025 / Revised: 22 June 2025 / Accepted: 26 June 2025 / Published: 30 June 2025
(This article belongs to the Special Issue Theoretical and Applied Mathematics in Supply Chain Management)

Abstract

The purpose of this paper is to present a novel optimization framework that enhances Wasserstein Distributionally Robust Optimization (WDRO) for chance-constrained facility location problems under demand uncertainty. Traditional methods often rely on predefined probability distributions, limiting their flexibility in adapting to real-world demand fluctuations. To overcome this limitation, the proposed approach integrates two methodologies, specifically a Genetic Algorithm to search for the optimal decision about facility opening, inventory, and allocation, and a constrained Jordan–Kinderlehrer–Otto (cJKO) scheme for dealing with robustness in the objective function and chance-constraint with respect to possible unknown fluctuations in demand. Precisely, cJKO is used to construct Wasserstein ambiguity sets around empirical demand distributions (historical data) to achieve robustness. As a result, computational experiments demonstrate that the proposed hybrid approach achieves over 90% demand satisfaction with limited violations of probabilistic constraints across various demand scenarios. The method effectively balances operational cost efficiency with robustness, showing superior performance in handling demand uncertainty compared to traditional approaches.
Keywords: constrained JKO (cJKO); chance-constrained optimization; Wasserstein distance; facility location; Genetic Algorithm (GA) constrained JKO (cJKO); chance-constrained optimization; Wasserstein distance; facility location; Genetic Algorithm (GA)

Share and Cite

MDPI and ACS Style

Seyedi, I.; Candelieri, A.; Messina, E.; Archetti, F. Wasserstein Distributionally Robust Optimization for Chance Constrained Facility Location Under Uncertain Demand. Mathematics 2025, 13, 2144. https://doi.org/10.3390/math13132144

AMA Style

Seyedi I, Candelieri A, Messina E, Archetti F. Wasserstein Distributionally Robust Optimization for Chance Constrained Facility Location Under Uncertain Demand. Mathematics. 2025; 13(13):2144. https://doi.org/10.3390/math13132144

Chicago/Turabian Style

Seyedi, Iman, Antonio Candelieri, Enza Messina, and Francesco Archetti. 2025. "Wasserstein Distributionally Robust Optimization for Chance Constrained Facility Location Under Uncertain Demand" Mathematics 13, no. 13: 2144. https://doi.org/10.3390/math13132144

APA Style

Seyedi, I., Candelieri, A., Messina, E., & Archetti, F. (2025). Wasserstein Distributionally Robust Optimization for Chance Constrained Facility Location Under Uncertain Demand. Mathematics, 13(13), 2144. https://doi.org/10.3390/math13132144

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop