Cooling schedules for optimal annealing
Mathematics of Operations Research
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
The ant colony optimization meta-heuristic
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
A Graph-based Ant system and its convergence
Future Generation Computer Systems
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
INFORMS Journal on Computing
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Cross-entropy and rare events for maximal cut and partition problems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Computers and Operations Research
On the runtime analysis of the 1-ANT ACO algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
First steps to the runtime complexity analysis of ant colony optimization
Computers and Operations Research
Hybrid approach for pole assignment using LQR technique and Ant System metaheuristic
International Journal of Artificial Intelligence and Soft Computing
Running Time Analysis of ACO Systems for Shortest Path Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Convergence results for ant routing algorithms viastochastic approximation
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Information Sciences: an International Journal
Convergence results for ant routing algorithms via stochastic approximation
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
It is shown that on fairly weak conditions, the current solutions of a metaheuristic following the ant colony optimization paradigm, the graph-based ant system, converge with a probability that can be made arbitrarily close to unity to one element of the set of optimal solutions. The result generalizes a previous result by removing the very restrictive condition that both the optimal solution and its encoding are unique (this generalization makes the proof distinctly more difficult) and by allowing a wide class of implementation variants in the first phase of the algorithm. In this way, the range of application of the convergence result is considerably extended.