An ant colony optimization algorithm and its convergence for the wireless sensor network routing problem

MaRDI QIDQ3500541zbMATH OpenFDO

Authors Wenguo Yang, Tiande Guo

Publication date 3 June 2008

zbMATH Keywords

ant colony optimizationminimum Steiner treeroutingwireless sensor network

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• A convergence proof for the ant colony optimization algorithms for solving the Steiner tree under condition of time dependent evaporation rate
• Analysis of convergence of ant colony optimization algorithms
• scientific article; zbMATH DE number 5153056
• A proof of convergence for ant algorithms.
• An extended ant colony algorithm and its convergence analysis

Cited in

(6)

• Different InterCriteria analysis of variants of ACO algorithm for wireless sensor network positioning
• A convergence proof for the ant colony optimization algorithms for solving the Steiner tree under condition of time dependent evaporation rate
• Optimization algorithm of BP networks based on ant colony algorithm
• Convergence results for ant routing algorithms viastochastic approximation
• scientific article; zbMATH DE number 6006773 (Why is no real title available?)
• Mouse colony optimization and simulated annealing algorithm for energy balance routing in wireless sensor networks

This page was built for publication: An ant colony optimization algorithm and its convergence for the wireless sensor network routing problem

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