On the finite-time dynamics of ant colony optimization

DOI10.1007/s11009-006-7291-4zbMath1103.68981OpenAlexW2015649422MaRDI QIDQ2433257

Walter J. Gutjahr

Publication date: 27 October 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-006-7291-4

zbMATH Keywords

stochastic optimizationstochastic approximationprobabilistic algorithmsant colony optimizationconvergence speed

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20)

Related Items (7)

Competence-driven project portfolio selection, scheduling and staff assignment ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ Multi-objective decision analysis for competence-oriented project portfolio selection ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point ⋮ Runtime analysis of a simple ant colony optimization algorithm ⋮ Runtime analysis of ant colony optimization with best-so-far reinforcement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dynamics of a genetic algorithm for simple random Ising systems
• Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
• Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
• Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Ant colony optimization with global pheromone evaluation for scheduling a single machine
• ACO algorithms with guaranteed convergence to the optimal solution
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• A new rank based version of the ant system. -- A computational study
• An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
• First steps to the runtime complexity analysis of ant colony optimization
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
• Stochastic Algorithms: Foundations and Applications

This page was built for publication: On the finite-time dynamics of ant colony optimization