ACO algorithms with guaranteed convergence to the optimal solution

DOI10.1016/S0020-0190(01)00258-7zbMath1013.68092OpenAlexW2048910294MaRDI QIDQ1603542

Walter J. Gutjahr

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00258-7

zbMATH Keywords

convergenceheuristic optimizationcombinatorial problemsanalysis of algorithmsrandomized algorithmsant Colony Optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (23)

Pheromone models in ant colony optimization (ACO) ⋮ A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs ⋮ Convergence analysis of the plant propagation algorithm for continuous global optimization ⋮ On the finite-time dynamics of ant colony optimization ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW ⋮ D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. ⋮ Comparing backhauling strategies in vehicle routing using ant colony optimization ⋮ Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions ⋮ Converging marriage in honey-bees optimization and application to stochastic dynamic programming ⋮ Convergence and monotonicity of the hormone levels in a hormone-based content delivery system ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ On the convergence of the cross-entropy method ⋮ Ant search based control optimisation strategy for a class of chaotic system ⋮ Nonautonomous stochastic search for global minimum in continuous optimization ⋮ Mining time series data for segmentation by using ant colony optimization ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Runtime analysis of ant colony optimization with best-so-far reinforcement ⋮ Ant colony optimization theory: a survey ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem ⋮ An extended ant colony algorithm and its convergence analysis

Cites Work

• Unnamed Item
• Non-negative matrices and Markov chains. 2nd ed
• On the analysis of the \((1+1)\) evolutionary algorithm
• A new rank based version of the ant system. -- A computational study
• Cooling Schedules for Optimal Annealing

This page was built for publication: ACO algorithms with guaranteed convergence to the optimal solution