Proceedings of the 2011 Winter Simulation Conference (WSC) 2011
DOI: 10.1109/wsc.2011.6148075
|View full text |Cite
|
Sign up to set email alerts
|

A conditional Monte Carlo method for estimating the failure probability of a distribution network with random demands

Abstract: We consider a model of an irreducible network in which each node is subjected to a random demand, where the demands are jointly normally distributed. Each node has a given supply that it uses to try to meet its demand; if it cannot, the node distributes its unserved demand equally to its neighbors, which in turn do the same. The equilibrium is determined by solving a linear program (LP) to minimize the sum of the unserved demands across the nodes in the network. One possible application of the model might be t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…Some of the results regarding CMC previously appeared in a conference version of this paper ( [8]). Our conference paper restricted the LP's objective function to be the sum of the unserved demands, and we now prove its invariance, as described in contribution 1), which greatly expands the applicability of our approach.…”
Section: )mentioning
confidence: 91%
See 4 more Smart Citations
“…Some of the results regarding CMC previously appeared in a conference version of this paper ( [8]). Our conference paper restricted the LP's objective function to be the sum of the unserved demands, and we now prove its invariance, as described in contribution 1), which greatly expands the applicability of our approach.…”
Section: )mentioning
confidence: 91%
“…Regarding contribution 3), we develop an importance sampling algorithm which is not studied in the conference version, and we provide a proof of asymptotic optimality and algorithm implementation. As for contribution 4), although in the conference version, we have studied the CMC algorithm and its implementation (see [8], Section 4.3), no mathematical proof is provided regarding the asymptotic optimality of this algorithm. Here, in the journal version, we prove it rigorously.…”
Section: )mentioning
confidence: 99%
See 3 more Smart Citations