多维指派问题的模因算法
A Memetic Algorithm for the Multidimensional Assignment Problem
摘要：
多维指派问题（在s维的情况下称为MAP或s-AP）是著名指派问题的扩展。MAP的研究最多的情况是3-AP，尽管具有较大s值的问题也有许多应用。在本文中，我们提出了一个memetic算法的地图，是一个组合的遗传算法与局部搜索过程。该文件的主要贡献是一个想法，动态调整生成的大小，产生一个突出的灵活性的算法执行良好的小和大的固定运行时间。对多个实例族的计算实验结果表明，该算法在合理的时间内产生了高质量的解，性能优于最先进的3-AP模因算法.
英文摘要：
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose a memetic algorithm for MAP that is a combination of a genetic algorithm with a local search procedure. The main contribution of the paper is an idea of dynamically adjusted generation size, that yields an outstanding flexibility of the algorithm to perform well for both small and large fixed running times. The results of computational experiments for several instance families show that the proposed algorithm produces solutions of very high quality in a reasonable time and outperforms the state-of-the art 3-AP memetic algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
