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

一种改进的蚁群系统在排序问题中的应用

An improved Ant Colony System for the Sequential Ordering Problem

University of Silesia(西里西亚大学)

Rafał Skinderowicz

摘要:

一个元启发式算法的性能可以通过合并从另一个元启发式算法中提取的思想来提高,这并不罕见。在这篇文章中,我们提出了如何模拟退火(SA)可以用来提高效率的蚁群系统(ACS)和增强型ACS时,解决顺序排序问题(SOP)。此外,我们展示了如何同样的想法可以应用于提高一个专用的本地搜索,即SOP-3交换算法的收敛性。基于一系列的计算实验的SOP实例从著名的TSPLIB和SOPLIB 2006存储库进行的统计分析,提出的算法,无论是在寻找合适的参数值和生成的解决方案的质量。所提出的ACS-SA和EACS-SA算法通常分别产生比ACS和EACS质量更好的解决方案。此外,EACS-SA算法结合所提出的SOP-3-exchange-SA局部搜索能够从SOPLIB 2006存储库中找到10个新的SOP实例的最佳解决方案,从而改进了文献中已知的最先进的结果。总体而言,在48例病例中,有41例发现了最佳已知或改进的解决方案。

英文摘要:

It is not rare that the performance of one metaheuristic algorithm can be improved by incorporating ideas taken from another. In this article we present how Simulated Annealing (SA) can be used to improve the efficiency of the Ant Colony System (ACS) and Enhanced ACS when solving the Sequential Ordering Problem (SOP). Moreover, we show how the very same ideas can be applied to improve the convergence of a dedicated local search, i.e. the SOP-3-exchange algorithm. A statistical analysis of the proposed algorithms both in terms of finding suitable parameter values and the quality of the generated solutions is presented based on a series of computational experiments conducted on SOP instances from the well-known TSPLIB and SOPLIB2006 repositories. The proposed ACS-SA and EACS-SA algorithms often generate solutions of better quality than the ACS and EACS, respectively. Moreover, the EACS-SA algorithm combined with the proposed SOP-3-exchange-SA local search was able to find 10 new best solutions for the SOP instances from the SOPLIB2006 repository, thus improving the state-of-the-art results as known from the literature. Overall, the best known or improved solutions were found in 41 out of 48 cases.

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

↑