arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.13752math.OC
收藏

L形算法中的动态割集

Dynamic cut aggregation in L-shaped algorithms

Martin Biel, Mikael Johansson

摘要:

我们提出了一个新的框架,动态切割聚合L形算法。其目的是通过减少通信延迟和负载不平衡来提高分布式L形算法的并行性能。我们展示了如何最优切割可以聚合成任意分区,而不影响收敛的L形算法。此外,我们给出了一个最坏的情况下的L形算法与静态切割聚集的界限,然后将此结果扩展到动态聚集。我们提出了各种聚合方案,适合我们的框架,并评估他们的大规模随机规划问题的集合。所有方法都在我们的随机规划开源框架StochasticPrograms.jl中实现,该框架用Julia编程语言编写。此外,我们提出了一个粒状的战略,结合了动态和静态切割聚合的优势。主要的性能改进是可能的,我们的方法在分布式设置。我们的实验结果表明,颗粒化的策略可以始终如一地产生高性能的测试问题的范围。我们的最坏情况下的界限支持的实验结果。

英文摘要:

We present a novel framework for dynamic cut aggregation in L-shaped algorithms. The aim is to improve the parallel performance of distributed L-shaped algorithms through reduced communication latency and load imbalance. We show how optimality cuts can be aggregated into arbitrary partitions without affecting convergence of the L-shaped algorithm. Furthermore, we give a worst-case bound for L-shaped algorithms with static cut aggregation and then extend this result for dynamic aggregation. We propose a variety of aggregation schemes that fit into our framework, and evaluate them on a collection of large-scale stochastic programming problems. All methods are implemented in our open-source framework for stochastic programming, StochasticPrograms.jl, written in the Julia programming language. In addition, we propose a granulated strategy that combines the strengths of dynamic and static cut aggregation. Major performance improvements are possible with our approach in distributed settings. Our experimental results suggest that the granulated strategy can consistently yield high performance on a range of test problems. The experimental results are supported by our worst-case bounds.

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

↑