loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Broderick Crawford 1 ; Carlos Castro 2 and Eric Monfroy 2

Affiliations: 1 Pontificia Universidad Católica de Valparaíso, Universidad Técnica Federico Santa María, Chile ; 2 Universidad Técnica Federico Santa María, University of Nantes, France

ISBN: 978-989-8111-51-7

Keyword(s): Ant Colony Optimization (ACO), Constraint Programming (CP), Constraint Propagation, Arc Consistency (AC), Set Partitioning Problem (SPP).

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Enterprise Software Technologies ; Intelligent Problem Solving ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Software Engineering ; Symbolic Systems

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.81.29.226

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Crawford B.; Castro C.; Monfroy E. and (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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.