A Study of Some Properties of Ant-Q
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
Journal of Global Optimization
An Ant Colony System Hybridized with Randomized Algorithm for TSP
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
International Journal of Computer Applications in Technology
Patterns and pathways of packing circles into a square
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
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.