Runtime analysis of a simple ant colony optimization algorithm
From MaRDI portal
Recommendations
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm
- Runtime analysis of the 1-ANT ant colony optimizer
- Running time analysis of ant colony optimization for shortest path problems
- First steps to the runtime complexity analysis of ant colony optimization
- Ant colony optimization: recent developments in theoretical analysis
Cites work
- scientific article; zbMATH DE number 1962832 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Ant colony optimization theory: a survey
- Ant colony optimization.
- Automata, Languages and Programming
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the distribution of the number of successes in independent trials
- On the finite-time dynamics of ant colony optimization
- STACS 2005
- The Metropolis algorithm for graph bisection
Cited in
(25)- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- Runtime analysis of discrete particle swarm optimization applied to shortest paths computation
- A note on the parameter of evaporation in the ant colony optimization algorithm
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- Runtime Analysis of a Simple Ant Colony Optimization Algorithm
- Runtime analysis of the 1-ANT ant colony optimizer
- Towards a runtime comparison of natural and artificial evolution
- Working principles of binary differential evolution
- The use of tail inequalities on the probable computational time of randomized search heuristics
- scientific article; zbMATH DE number 2013445 (Why is no real title available?)
- Runtime analysis of a binary particle swarm optimizer
- Energy efficient ant colony algorithms for data aggregation in wireless sensor networks
- Stochastic optimization with adaptive restart: a framework for integrated local and global learning
- On the finite-time dynamics of ant colony optimization
- Ant colony optimization and the minimum spanning tree problem
- Running time analysis of ant colony optimization for shortest path problems
- A cross layer optimization modeling for a periodic WSN application
- Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
- Ant colony optimization: recent developments in theoretical analysis
- First steps to the runtime complexity analysis of ant colony optimization
- A simple ant colony optimizer for stochastic shortest path problems
- An ant colony algorithm with fuzzy adaptive survival and its convergence
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
This page was built for publication: Runtime analysis of a simple ant colony optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1022344)
