ACO algorithms with guaranteed convergence to the optimal solution

DOI10.1016/S0020-0190(01)00258-7MaRDI QIDQ1603542zbMATH OpenOpenAlexFDO

Authors 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

convergenceanalysis of algorithmsrandomized algorithmscombinatorial problemsheuristic optimizationant Colony Optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• A new rank based version of the ant system. -- A computational study
• Cooling Schedules for Optimal Annealing
• Non-negative matrices and Markov chains. 2nd ed
• On the analysis of the \((1+1)\) evolutionary algorithm

Cited in

(24)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603542)