arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.05602math.OCcs.NAmath.NA
收藏

分布网络中稀有事件模拟

Rare-Event Simulation for Distribution Networks

Columbia University(哥伦比亚大学);New Jersey Institute of Technology(新泽西理工学院)

Jose Blanchet, Juan Li, Marvin K. Nakayama

AI总结:

本文研究分布网络中均衡分配的稀有事件概率,提出重要性采样和条件蒙特卡洛算法进行估计,并证明其渐近效率。

摘要:

我们把分布网络中的均衡分配建模为一个线性规划问题,该问题最小化网络中各节点未满足需求的成本。约束条件规定,一旦某个节点的供应耗尽,其未满足需求将分配给邻近节点。所有节点均如此操作,最终解即为均衡分配。假设需求是随机的(遵循联合高斯分布),我们的目标是研究最优成本(即均衡状态下未满足需求的成本)超过大阈值的概率,这是一个稀有事件。我们的贡献是开发了重要性采样和条件蒙特卡洛算法来估计此概率。我们建立了这些算法的渐近效率,并给出了数值结果,展示了其强大的性能。

英文摘要:

We model equilibrium allocations in a distribution network as the solution of a linear program (LP) which minimizes the cost of unserved demands across nodes in the network. The constraints in the LP dictate that once a given node's supply is exhausted, its unserved demand is distributed among neighboring nodes. All nodes do the same and the resulting solution is the equilibrium allocation. Assuming that the demands are random (following a jointly Gaussian law), our goal is to study the probability that the optimal cost (i.e. the cost of unserved demands in equilibrium) exceeds a large threshold, which is a rare event. Our contribution is the development of importance sampling and conditional Monte Carlo algorithms for estimating this probability. We establish the asymptotic efficiency of our algorithms and also present numerical results which illustrate strong performance of our procedures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑