Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions

DOI10.1007/978-3-540-74446-7_5MaRDI QIDQ5429290zbMATH OpenOpenAlexFDO

Authors F. Neumann, Dirk Sudholt, Carsten Witt

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2003/26137

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• Runtime analysis of the 1-ANT ant colony optimizer
• First steps to the runtime complexity analysis of ant colony optimization
• Runtime analysis of a simple ant colony optimization algorithm
• Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Cited in

(4)

• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• Runtime analysis of the 1-ANT ant colony optimizer
• When to use bit-wise neutrality
• Ant colony optimization and the minimum spanning tree problem

This page was built for publication: Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions

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