arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.10453cs.AI
收藏

部分拉丁方扩张问题的大规模并行进化算法

A massively parallel evolutionary algorithm for the partial Latin square extension problem

University of Angers(昂热大学)

Olivier Goudet, Jin-Kao Hao

摘要:

部分拉丁方扩张问题是在一个部分填充的拉丁方中填充尽可能多的空单元。这个问题是一个有用的模型,在不同领域的广泛应用。本文提出了第一个大规模并行进化算法算法的基础上,这个计算上具有挑战性的问题的部分图着色的转换。该算法具有以下原始元素。基于一个非常大的人口(超过$10^4$个人)和现代图形处理单元,该算法执行许多本地搜索并行,以确保密集利用的搜索空间。该算法采用一个专用的交叉与特定的父匹配策略,以创建大量的多样化和信息保存的后代在每一代。在1800个基准实例上的实验表明,该算法与目前性能最好的方法相比具有很高的竞争力。竞争力的结果也报告相关的拉丁方完成问题。进行分析,以阐明主要算法组件的作用。该算法的代码将公开提供。

英文摘要:

The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of applications in diverse domains. This paper presents the first massively parallel evolutionary algorithm algorithm for this computationally challenging problem based on a transformation of the problem to partial graph coloring. The algorithm features the following original elements. Based on a very large population (with more than $10^4$ individuals) and modern graphical processing units, the algorithm performs many local searches in parallel to ensure an intensive exploitation of the search space. The algorithm employs a dedicated crossover with a specific parent matching strategy to create a large number of diversified and information-preserving offspring at each generation. Extensive experiments on 1800 benchmark instances show a high competitiveness of the algorithm compared to the current best performing methods. Competitive results are also reported on the related Latin square completion problem. Analyses are performed to shed lights on the roles of the main algorithmic components. The code of the algorithm will be made publicly available.

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

↑