An Ant Colony Optimization Algorithm based on automatic dynamic updating

Currently, the general ant colony algorithm is disadvantage of solving continuous problem, such as the slow convergence and stagnation. To this end, we proposed an Ant Colony Optimization Algorithm which is capable of automatic dynamic updating the parameters. It chooses the ants through the fitness...

Full description

Saved in:
Bibliographic Details
Main Authors: Zuo Li-yun, Zuo Li-feng
Format: Conference Proceeding
Language:English
Subjects:
Accuracy
Aerospace electronics
Algorithm design and analysis
Convergence
Heuristic algorithms
Optimization
pheromone
solution accuracy
transition probability
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Currently, the general ant colony algorithm is disadvantage of solving continuous problem, such as the slow convergence and stagnation. To this end, we proposed an Ant Colony Optimization Algorithm which is capable of automatic dynamic updating the parameters. It chooses the ants through the fitness function (i.e., the objective function). Then, in accordance with the specific issue of the characteristics of the problem, algorithms parameters can be automatically adjusted to the optimum to make the entire optimization process. The concrete method is to transfer the discrete problem to continuous space problem through the transition probability in order to enhance the optimal path of the pheromone of ants, accelerate the convergence and avoid algorithm stagnation by controlling residual amount of pheromone. Simulation results show that the algorithm for solving the problem of continuous time domain can significantly improve the convergence speed and solution accuracy.
DOI:10.1109/CSAE.2012.6272560