Strong Combination of Ant Colony Optimization with Constraint Programming Optimization - Archive ouverte HAL Access content directly
Conference Papers Year :

Strong Combination of Ant Colony Optimization with Constraint Programming Optimization

Abstract

We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using the CP Optimizer modeling API. Then, it is solved in a generic way by a two-phase algorithm. The first phase aims at creating a hot start for the second: it samples the solution space and applies reinforcement learning techniques as implemented in ACO to create pheromone trails. During the second phase, CP Optimizer performs a complete tree search guided by the pheromone trails previously accumulated. The first experimental results on knapsack, quadratic assignment and maximum independent set problems show that this new algorithm enhances the performance of CP Optimizer alone.
Fichier principal
Vignette du fichier
final-version.pdf (209.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01492973 , version 1 (24-03-2020)

Identifiers

Cite

Madjid Khichane, Patrick Albert, Christine Solnon. Strong Combination of Ant Colony Optimization with Constraint Programming Optimization. 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Jun 2010, Bologne, Italy. pp.232-245, ⟨10.1007/978-3-642-13520-0_26⟩. ⟨hal-01492973⟩
90 View
137 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More