Some practical solutions to the uncertainties of the ant colony optimisation. (4th June 2012)

• Record Type: Journal Article
• Authors: Yi, Zhang; Meng, Zhang; Xiao–qi, Li; Yan, Lv
• Is Part Of: International journal of computer applications technology. Volume 43:Number 4(2012)
• Page Start: 327
• Page End: 334
• Publication Date: 2012-06-04
• Subjects: ant colony algorithm -- ACO -- artificial bee colony -- ABC -- travelling salesman problem -- TSP -- parallel strategy -- self–adaptive -- uncertainty; Technology -- Data processing -- Periodicals; 620.00285
• Languages: English
• ISSNs: 0952-8091

Abstract

In this paper, we present some practical solutions to the uncertainties of the ant colony algorithm. First, in order to find application and popularise the ACO, we try to find some techniques which can eliminate the impact of uncertainties in our algorithm; second, we have done a series of experiments in order to find the best assembly of the parameters. We also present a hybrid optimisation algorithm with artificial bee colony (ABC) and ant colony optimisation (ACO). The ABC is used for optimising multivariable function, and in the proposed algorithm, we use it to optimise the parameters in the ACO, which makes the selection of parameters independent on artificial experiences or trial and error, but rely on the adaptive search of the particles in the ABC. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance for solving large–scale TSP problems. Simulation results also show that the speed of convergence of ACO algorithm could be enhanced greatly.