An ant colony optimization algorithm and its convergence for the wireless sensor network routing problem
From MaRDI portal
Publication:3500541
zbMATH Open1150.68547MaRDI QIDQ3500541FDOQ3500541
Authors: Wenguo Yang, Tiande Guo 
Publication date: 3 June 2008
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 (5)
- 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
- Title not available (Why is that?)
- 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)
