@inproceedings{9c03ca36007c4d90b4f5b020d4a7ac35,
title = "An ant-based solver for subset problems",
abstract = "Subset Problems are models for many important applications in the field of Operational Research. In this paper, we solve some benchmarks of the Set Partitioning Problem with an Ant-based algorithm using a transition rule with a lookahead mechanism. It 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.",
keywords = "Ant colony optimization, Lookahead techniques, Set partitioning problem",
author = "Broderick Crawford and Carlos Castro and Eric Monfroy",
year = "2009",
doi = "10.1109/ACT.2009.74",
language = "English",
isbn = "9780769539157",
series = "ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies",
pages = "268--270",
booktitle = "ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies",
note = "International Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009 ; Conference date: 28-12-2009 Through 29-12-2009",
}