Enhanced simulated annealing for globally minimizing functions of many-continuous variables
ACM Transactions on Mathematical Software (TOMS)
Future Generation Computer Systems
On how pachycondyla apicalis ants suggest a new search algorithm
Future Generation Computer Systems
The Ant Colony Metaphor for Searching Continuous Design Spaces
Selected Papers from AISB Workshop on Evolutionary Computing
Continuous interacting ant colony algorithm based on dense heterarchy
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Neural Computing and Applications
Computational Optimization and Applications
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
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
A short convergence proof for a class of ant colony optimizationalgorithms
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Ant colony optimization algorithm is a metaheuristic approach for the solutions of combinatorial optimization problems. In order to solve continuous optimization models, a new intelligent algorithm MACO combining a mutation ant colony optimization algorithm and a simulated annealing method is designed. Experiments and comparison with other metaheuristic methods by some test functions are shown the effectiveness of the proposed algorithm.