Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem

Salman Khodayifar () and Mohammadreza Farjaie ()
Additional contact information
Salman Khodayifar: Institute for Advanced Studies in Basic Sciences (IASBS)
Mohammadreza Farjaie: Institute for Advanced Studies in Basic Sciences (IASBS)

Journal of Combinatorial Optimization, 2025, vol. 50, issue 4, No 6, 28 pages

Abstract: Abstract In this paper, we first present a stochastic model for the survivable capacitated network design problem, in which the demand vector is uncertain. To deal with the uncertainty of the demand vector, we use the joint chance-constrained programming method. According to the real-world application, it is assumed that only partial distribution information of uncertain demand, such as support, mean, and variance is available, and we use a robust method to deal with this uncertainty. The obtained robust counterpart model is a distributionally robust joint chance-constrained model. Due to the intractability of the distributionally robust joint chance-constrained model, we use the deterministic and Bonferroni approximation methods to solve it. The obtained models from the first and second methods are mixed integer non-linear programming (MINLP) and mixed integer linear programming (MILP), respectively. We propose an iterative approximation optimization method to provide the lower and upper bounds for the MINLP model. In the end, the efficiency of the proposed techniques is evaluated by some realistically sized instances.

Keywords: Survivability; Network design problem; Distributionally robust; Joint chance- constrained programming; Bonferroni approximation (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01370-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:4:d:10.1007_s10878-025-01370-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01370-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().