The ant colony optimization meta-heuristic
New ideas in optimization
Future Generation Computer Systems
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Ant colony optimization and stochastic gradient descent
Artificial Life
Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Removing the Genetics from the Standard Genetic Algorithm
Removing the Genetics from the Standard Genetic Algorithm
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Structural advantages for ant colony optimisation inherent in permutation scheduling problems
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Solution bias in ant colony optimisation: Lessons for selecting pheromone models
Computers and Operations Research
An analysis of problem difficulty for a class of optimisation heuristics
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Tuning the performance of the MMAS heuristic
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Two models of parallel ACO algorithms for the minimum tardy task problem
International Journal of High Performance Systems Architecture
Higher order pheromone models in ant colony optimisation
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
| Hi-index | 0.00 |
In this paper we introduce model-based search as a unifying framework accommodating some recently proposed heuristics for combinatorial optimization such as ant colony optimization, stochastic gradient ascent, cross-entropy and estimation of distribution methods. We discuss similarities as well as distinctive features of each method, propose some extensions and present a comparative experimental study of these algorithms.