An ant-based solver for subset problems

Authors:
Broderick Crawford;Carlos Castro;Eric Monfroy
Affiliations:
Pontificia Universidad, Católica de Valparaíso, Valparaíso, Chile;Universidad Técnica, Federico Santa María, Valparaíso, Chile;Université de Nantes, Nantes, France
Venue:
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Year:
2009

Citing 7
Cited 0

Backjump-based backtracking for constraint satisfaction problems

Artificial Intelligence
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics
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
An Ant-Based Framework for Very Strongly Constrained Problems

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Review of "Ant colony optimization" by M.Dorigo, T.Stützle, MIT Press, Cambridge, MA, 2004

Artificial Intelligence
Principles of Constraint Programming

Principles of Constraint Programming
A hybrid ant algorithm for the airline crew pairing problem

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Subset Problems are models for many important applications in the field of Operational Research. In this paper, we solve some benchmarks of them with Ant Colony Optimization using a new transition rule. A Lookahead mechanism was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization.