By Topic

Ant Colony Optimization for Configuration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Albert, P. ; ILOG S.A, Gentilly ; Henocque, L. ; Kleiner, M.

An inherent difficulty in enumerative search algorithms for optimisation is the combinatorial explosion that occurs when increasing the size of the input. Among incomplete algorithms that address this issue, ant colony optimization(ACO) uses a combination of random and heuristic methods plus reinforcement learning, which proved efficient on a wide range of CSPs problems. This paper presents results in applying an ACO-based algorithm to configuration, which to the best of our knowledge was never investigated before. We describe how the nature of unbounded configuration problems impacts the ACO approach due to the presence of set-variables with open domains. We propose an ACO framework able to deal with those issues through an original pheromone model and algorithm. We also present the use of particle swarm optimization (PSO) to converge towards good parameter sets. Finally, we provide early experimental results, both for random problem instances andthe "racks" optimisation problem.

Published in:

Tools with Artificial Intelligence, 2008. ICTAI '08. 20th IEEE International Conference on  (Volume:1 )

Date of Conference:

3-5 Nov. 2008