Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
Solving airline crew scheduling problems by branch-and-cut
Management Science
Intelligence through simulated evolution: forty years of evolutionary programming
Intelligence through simulated evolution: forty years of evolutionary programming
P-Complete Approximation Problems
Journal of the ACM (JACM)
The ant colony optimization meta-heuristic
New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Future Generation Computer Systems
An Ants heuristic for the frequency assignment problem
Future Generation Computer Systems
The vehicle routing problem
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Coloured Ant System and Local Search to Design Local Telecommunication Networks
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
An Ant-Based Framework for Very Strongly Constrained Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
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
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
Ant Colony Optimization
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
Searching for maximum cliques with ant colony optimization
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Iterated ants: an experimental study for the quadratic assignment problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Comparing parallelization of an ACO: message passing vs. shared memory
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Grid jobs scheduling: The Alienated Ant Algorithm solution
Multiagent and Grid Systems
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
| Hi-index | 0.01 |
Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This article is composed of three parts. The first one frames ACO in current trends of research on metaheuristics for combinatorial optimization. The second outlines some current research within the ACO community, reporting recent results obtained on different problems, while the third part focuses on a particular research line, named ANTS, providing some details on the algorithm and presenting results recently obtained on a prototypical strongly constrained problem: the set partitioning problem.