The Ant Colony Optimization paradigm for combinatorial optimization

Authors:
Antonella Carbonaro;Vittorio Maniezzo
Affiliations:
Scienze dell'Informazione, University of Bologna, Via Sacchi 3, 47023 Cesena, Italy;Scienze dell'Informazione, University of Bologna, Via Sacchi 3, 47023 Cesena, Italy
Venue:
Advances in evolutionary computing
Year:
2003

Citing 18
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Technical Note: \cal Q-Learning

Machine Learning
Ant-based load balancing in telecommunications networks

Adaptive Behavior
Routing in telecommunications networks with ant-like agents

IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
The ant colony optimization meta-heuristic

New ideas in optimization
ACO algorithms for the quadratic assignment problem

New ideas in optimization
An Ants heuristic for the frequency assignment problem

Future Generation Computer Systems
A Bionomic Approach to the Capacitated p-Median Problem

Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
Ant Colony Optimization

Ant Colony Optimization
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony Optimization is a paradigm for designing combinatorial optimization metaheuristic algorithms, which construct a solution on the basis of information provided both by some standard constructive heuristic and by previously obtained solutions. In this chapter, we present current results obtained by ACO algorithms on several hard combinatorial optimization problems. Furthermore, we describe in more detail a particular ACO algorithm, the ANTS metaheuristic, presenting its general structure and reporting results obtained on the quadratic and on the frequency assignment problems.