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

多维指派问题的施工组织学实证评价

Empirical evaluation of construction heuristics for the multidimensional assignment problem

Daniel Karapetyan, Gregory Gutin, Boris Goldengorin

摘要:

多维分配问题(MAP)(在s维的情况下缩写为s-AP)是众所周知的分配问题的扩展。MAP的研究最多的情况是3-AP,尽管具有较大s值的问题也有许多应用。在本文中,我们考虑四个快速构造算法的MAP。其中一种化学品是新的。提出了一种改进的算法来优化对慢速计算机内存的访问。提供并讨论了几个实例族的计算实验结果。

英文摘要:

The multidimensional assignment problem (MAP) (abbreviated 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 consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics is proposed to optimize the access to slow computer memory. The results of computational experiments for several instance families are provided and discussed.

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

↑