Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions

DOI10.1016/j.orl.2017.05.002zbMath1409.90120OpenAlexW2613999505MaRDI QIDQ1728256

Abdellah Salhi, Nassim Brahimi, Megdouda Ourbih-Tari

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.05.002

zbMATH Keywords

global optimizationdrift analysisruntime analysisant system

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (1)

Convergence analysis of the plant propagation algorithm for continuous global optimization

Cites Work

• Unnamed Item
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Ant colony optimization and the minimum spanning tree problem
• A survey on metaheuristics for stochastic combinatorial optimization
• ACO algorithms with guaranteed convergence to the optimal solution
• Adaptive drift analysis
• Multiplicative drift analysis
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
• Simple max-min ant systems and the optimization of linear pseudo-boolean functions
• Optimizing expected path lengths with ant colony optimization using fitness proportional update
• Stochastic Algorithms: Foundations and Applications
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Drift analysis of ant colony optimization of stochastic linear pseudo-Boolean functions