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

多目标整数规划:协同并行方法

Multi-objective integer programming: Synergistic parallel approaches

William Pettersson, Melih Ozlen

摘要:

精确求解多目标整数规划(MOIP)问题通常是一个非常耗时的过程,特别是对于大型和复杂的问题。并行计算有可能大大减少解决此类问题所需的时间,但前提是使用合适的算法。我们的第一个新算法遵循一个简单的技术,展示了令人印象深刻的性能,其设计。然后,我们继续介绍新的理论,开发更有效的并行算法。该理论利用对称群的元素将置换应用于目标函数以分配不同的工作负载,并应用于按字典顺序排列目标函数的算法。因此,信息和更新的边界可以实时共享,从而在线程之间创建协同作用。我们设计并实现了两个算法,利用这样的理论。为了正确分析我们的三个算法的运行时间,我们将它们与文献中的两个现有算法进行比较,并反对在我们选择的IP求解器CPLEX中使用多线程。这六种不同的并行算法,第一次的调查,证明了并行计算的优势。在测试的所有问题类型中,我们的新算法在较小的情况下与现有算法不相上下,在较大的情况下大大优于竞争对手。这些新的算法和免费提供的实现,允许调查复杂的MOIP问题,四个或更多的目标。

英文摘要:

Exactly solving multi-objective integer programming (MOIP) problems is often a very time consuming process, especially for large and complex problems. Parallel computing has the potential to significantly reduce the time taken to solve such problems, but only if suitable algorithms are used. The first of our new algorithms follows a simple technique that demonstrates impressive performance for its design. We then go on to introduce new theory for developing more efficient parallel algorithms. The theory utilises elements of the symmetric group to apply a permutation to the objective functions to assign different workloads, and applies to algorithms that order the objective functions lexicographically. As a result, information and updated bounds can be shared in real time, creating a synergy between threads. We design and implement two algorithms that take advantage of such theory. To properly analyse the running time of our three algorithms, we compare them against two existing algorithms from the literature, and against using multiple threads within our chosen IP solver, CPLEX. This survey of six different parallel algorithms, the first of its kind, demonstrates the advantages of parallel computing. Across all problem types tested, our new algorithms are on par with existing algorithms on smaller cases and massively outperform the competition on larger cases. These new algorithms, and freely available implementations, allows the investigation of complex MOIP problems with four or more objectives.

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

↑