随机Steiner树问题的一种快速启发式方法
A Fast Heuristic for Stochastic Steiner Tree Problems
AI总结:
本文提出了一种基于现有Steiner树问题启发式方法的快速启发式算法,用于解决随机Steiner树问题,实验表明其计算效率比现有方法高约5%。
摘要:
在网络设计中存在不确定性的情况下,随机Steiner树问题(SSTP)可以被用来捕捉。尽管有几种专门针对这种随机优化问题的方法,但其确定性变种Steiner树问题(STP)的最先进启发式方法却要多得多。在本文中,我们展示了如何利用现有的STP启发式方法来构建一种新的方法来解决其随机变种SSTP。这种方法是一种强大但简单且易于实现的解决复杂问题的方法。我们使用文献中的基准实例测试我们的方法。数值结果表明,与最先进的方法相比,计算时间显著减少,差距约为5%。
英文摘要:
Network design under uncertainty arises in countless real-world settings and can be captured by the Stochastic Steiner Tree Problem (SSTP). Although there are a few approaches specifically tailored to this stochastic optimization problem, there are considerably more state-of-the-art heuristics for its deterministic variant, the Steiner Tree Problem (STP). In this work, we show how to leverage an existing STP heuristic in building a novel method for solving its stochastic variant, the SSTP. This approach is a powerful, yet simple and easy-to-implement way of solving this complex problem. We test our method using benchmark instances from the literature. Numerical results show considerably faster computation times compared to the state-of-the-art, with a gap of approximately 5%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。