P-Complete Approximation Problems
Journal of the ACM (JACM)
Future Generation Computer Systems
Efficient and Accurate Parallel Genetic Algorithms
Efficient and Accurate Parallel Genetic Algorithms
Ant Colony Optimization
Forking genetic algorithms: Gas with search space division schemes
Evolutionary Computation
cAS: ant colony optimization with cunning ants
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
An external partial permutations memory for ant colony optimization
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Iterated ants: an experimental study for the quadratic assignment problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Parallel ant colony optimization for the traveling salesman problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A survey on parallel ant colony optimization
Applied Soft Computing
| Hi-index | 0.00 |
The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most promising ACO algorithms. In this paper, we apply cAS to solving QAP. We focus our main attention on the effects of applying local search and parallelization of the cAS. Results show promising performance of cAS on QAP.