Ant colony optimization theory: a survey
DOI10.1016/j.tcs.2005.05.020zbMath1154.90626OpenAlexW2118573797WikidataQ56972090 ScholiaQ56972090MaRDI QIDQ2575081
Publication date: 5 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.05.020
convergencecombinatorial optimizationmetaheuristicsant colony optimizationstochastic gradient descentapproximate algorithmsmodel-based search
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Model-based search for combinatorial optimization: A critical survey
- An ant colony optimization algorithm for shop scheduling problems
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Ant colony optimization with global pheromone evaluation for scheduling a single machine
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- ACO algorithms with guaranteed convergence to the optimal solution
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Growth transformations for functions on manifolds
- Tabu Search—Part I
- Tabu Search—Part II
- Ants can colour graphs
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- A Stochastic Approximation Method