By Topic

Premium-Penalty Ant Colony 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

2 Author(s)
Wei Gao ; Wuhan Polytech. Univ., Wuhan ; Fei-jun Zhang

The ant colony optimization is a new meta-heuristic, it is a population based algorithm and is a good method for combination optimizations. Due to the random probabilistic search strategy, the slow convergence is the main problem of the ACO. In order to improve the convergence of the algorithm, the premium-penalty ant colony optimization (PPACO) is proposed. In this new algorithm, the good solutions found by the ants are awarded while the ordinary ones are punished. In order to counteract the polarization of pheromone values on all roads, the pheromone trails limited to an interval [taumin, taumax] and the evaporation rate is set to a higher value. The results of the simulation experiments are presented, in which the solutions gained by PPACO is compared with the best known results on several traveling salesman problems. It proves that the PPACO is ranked among the best ACO for tackling the TSP problems.

Published in:

Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on

Date of Conference:

1-3 Nov. 2008