By Topic

An Improved Ant Colony Optimization Algorithm Based on Dynamic Control of Solution Construction and Mergence of Local Search Solutions

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

2 Author(s)
Jianxin Han ; Sch. of Stat. & Math., Shandong Finance Univ., Jinan ; Yan Tian

An improved ant colony optimization algorithm is proposed in this paper. Comparing with the conventional ant colony optimization algorithm, the proposed method has two highlights. First, a newly strategy based on the dynamic control of solution construction is adopted. The purpose of this strategy is to ensure ants to exploit the solutions at the beginning of searching procedure with large probability while at the end of the searching procedure the solutions provided by each ant are obtained by searching around the best-so-far solution. Second, to obtain a more reasonable solution, a mergence mechanism, based on the local search result of each ant, is employed. The experiments demonstrate that the proposed method has better performance than the conventional ACO algorithm.

Published in:

Natural Computation, 2008. ICNC '08. Fourth International Conference on  (Volume:7 )

Date of Conference:

18-20 Oct. 2008