arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.08161cs.DMmath.OC
收藏

基于路径的鲁棒流计算方法

Computational Methods for Path-based Robust Flows

Fabian Mies, Britta Peis, Andreas Wierz

摘要:

现实世界的网络往往受到严重的不确定性,需要解决任何可靠的规范模型。在最大流问题的电弧故障的背景下,强大的模型得到了特别的关注。对于一个基于路径的模型,由此产生的优化问题被认为是困难的文献,但复杂性的状态是广泛未知的。我们提出了一种计算方法来解决鲁棒流问题的最优性,同时原始和对偶分离,计算研究表明,其实际效果。此外,我们引入了一种新的模型,提供了一个随机和强大的优化之间的妥协分配概率组的情况下,强大的流量。新模型可以通过与鲁棒模型相同的计算技术来求解。证明的情况下,概率是经验确定的泛化误差的界限。建议的模型以及计算方法扩展到线性优化问题比强大的流量。

英文摘要:

Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention. For a path-based model, the resulting optimization problem is assumed to be difficult in the literature, yet the complexity status is widely unknown. We present a computational approach to solve the robust flow problem to optimality by simultaneous primal and dual separation, the practical efficacy of which is shown by a computational study. Furthermore, we introduce a novel model of robust flows which provides a compromise between stochastic and robust optimization by assigning probabilities to groups of scenarios. The new model can be solved by the same computational techniques as the robust model. A bound on the generalization error is proven for the case that the probabilities are determined empirically. The suggested model as well as the computational approach extend to linear optimization problems more general than robust flows.

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

↑