By Topic

An effective dynamic weighted rule for ant colony system optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
SeungGwan Lee ; Dept. of Comput. Eng., Kyung Hee Univ., Seoul, South Korea ; Tae Ung Jung ; TaeChoong Chung

The ant colony system (ACS) algorithm is new metaheuristic for hard combinational optimization problems. It is a population-based approach that exploits positive feedback as well as greedy search. It was first proposed for tackling the well known traveling salesman problem (TSP). We introduce a new version of the ACS based on a dynamic weighted updating rule. Implementation to solve TSP and the performance results under various conditions are conducted, and the comparison between the original ACS and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed for these problem

Published in:

Evolutionary Computation, 2001. Proceedings of the 2001 Congress on  (Volume:2 )

Date of Conference: