Research on convergence of ACO subset algorithms

DOI10.1108/03321641311297089MaRDI QIDQ2970613zbMATH OpenOpenAlexFDO

Authors Wenyu Chen, Wangyang Bian, Ru Zeng

Publication date 30 March 2017

Published in COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03321641311297089

zbMATH Keywords

algorithm frameworkant colony optimizationconvergence in solutionconvergence in valuenature of convergenceprobabilistic analysisprogramming and algorithm theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Analysis of convergence of ant colony optimization algorithms
• scientific article; zbMATH DE number 5153056
• Ant colony optimization: recent developments in theoretical analysis
• An extended ant colony algorithm and its convergence analysis
• A proof of convergence for ant algorithms.

Cites work

• Ant colony optimization theory: a survey
• Ant colony optimization.
• Research on convergence of ACO subset algorithms

Cited in

(5)

• A proof of convergence for ant algorithms.
• Research on convergence of ACO subset algorithms
• Start Strategies of ACO Applied on Subset Problems
• Analysis of convergence of ant colony optimization algorithms
• Computational Science - ICCS 2004

This page was built for publication: Research on convergence of ACO subset algorithms

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