CONSTRAINT PROGRAMMING CAN HELP ANTS SOLVING HIGHLY CONSTRAINTED COMBINATORIAL PROBLEMS

Broderick Crawford, Carlos Castro, Eric Monfroy

2008

Abstract

In this paper, we focus on the resolution of Set Partitioning Problem. We try to solve it with Ant Colony Optimization algorithms and Hybridizations of Ant Colony Optimization with Constraint Programming techniques. We recognize the difficulties of pure Ant Algorithms solving strongly constrained problems. Therefore, we explore the addition of Constraint Programming mechanisms in the construction phase of the ants so they can complete their solutions. Computational results solving some test instances are presented showing the advantages to use this kind of hybridization.

Paper Citation

in Harvard Style

Crawford B., Castro C. and Monfroy E. (2008). CONSTRAINT PROGRAMMING CAN HELP ANTS SOLVING HIGHLY CONSTRAINTED COMBINATORIAL PROBLEMS . In Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8111-51-7, pages 380-383. DOI: 10.5220/0001892403800383

in Bibtex Style

@conference{icsoft08,
author={Broderick Crawford and Carlos Castro and Eric Monfroy},
title={CONSTRAINT PROGRAMMING CAN HELP ANTS SOLVING HIGHLY CONSTRAINTED COMBINATORIAL PROBLEMS},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2008},
pages={380-383},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001892403800383},
isbn={978-989-8111-51-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - CONSTRAINT PROGRAMMING CAN HELP ANTS SOLVING HIGHLY CONSTRAINTED COMBINATORIAL PROBLEMS
SN - 978-989-8111-51-7
AU - Crawford B.
AU - Castro C.
AU - Monfroy E.
PY - 2008
SP - 380
EP - 383
DO - 10.5220/0001892403800383