IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
A Weighted Max-Min Ant Colony Algorithm for TSP Instances
Yun BUTian Qian LIQiang ZHANG
Author information
JOURNAL RESTRICTED ACCESS

2015 Volume E98.A Issue 3 Pages 894-897

Details
Abstract

It is very difficult to know evolution state of ACO in its working. To solve the problem, we propose using colony entropy and mean colony entropy to monitor the algorithm. The two functions show fluctuation and declining trends depended on time t in a tour and iteration number. According to the principle, that each updated edge will get the same increment is improper. Then a weighted algorithm is proposed to calculate each arc's increment based on its selected probability. The strategy can provide more exploration to help to find the global optimum value, and experiments show its improved performance.

Content from these authors
© 2015 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top