An extended ant colony algorithm and its convergence analysis

DOI10.1007/s11009-005-1485-zzbMath1081.90046OpenAlexW2050295500MaRDI QIDQ812977

Giovanni Sebastiani, Giovanni Luca Torrisi

Publication date: 30 January 2006

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-005-1485-z

zbMATH Keywords

convergence analysisstochastic optimizationsimulationant colony

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

First steps to the runtime complexity analysis of ant colony optimization, Runtime analysis of ant colony optimization with best-so-far reinforcement

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• ACO algorithms with guaranteed convergence to the optimal solution
• On the analysis of the \((1+1)\) evolutionary algorithm
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Cooling Schedules for Optimal Annealing
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC