Imperial competitive algorithm with policy learning for the traveling salesman problem

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/121451

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121451

题名:	Imperial competitive algorithm with policy learning for the traveling salesman problem
作者:	Chen, M. H.;Chen, S. H.;Chang, P. C.
关键词:	Traveling salesman problem;Imperial competitive algorithm;Combinatorial optimization problems;Artificial chromosomes;Genetic algorithm
日期:	2015-10
上传时间:	2021-10-06 12:11:42 (UTC+8)
摘要:	The traveling salesman problem (TSP) is one of the most studied combinatorial optimization problems. In this paper, we present the new idea of combining the imperial competitive algorithm with a policy-learning function for solving the TSP problems. All offspring of each country are defined as representing feasible solutions for the TSP. All countries can grow increasingly strong by learning the effective policies of strong countries. Weak countries will generate increasingly excellent offspring by learning the policies of strong countries while retaining the characteristics of their own country. Imitating these policies will enable the weak countries to produce improved offspring; the solutions generated will, therefore, acquire a favorable scheme while maintaining diversity. Finally, experimental results for TSP instances from the TSP library have shown that our proposed algorithm can determine the salesman’s tour with more effective performance levels than other known methods.
關聯:	Soft Computing 21(7), pp 1863–1875
DOI:	10.1007/s00500-015-1886-z
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	19	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章