Very Strongly Constrained Problems: An Ant Colony Optimization Approach

Maniezzo, V. ; Roffilli, M. (2006) Very Strongly Constrained Problems: An Ant Colony Optimization Approach. [Preprint]
Full text available as:
[thumbnail of maniezzo_roffilli_rev.pdf]
Download (373kB) | Preview


Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This paper is composed of three parts. The first one frames ACO in current trends of research on metaheuristics for combinatorial optimization. The second outlines current research within the ACO community, reporting recent results obtained on different problems, while the third part focuses on a particular research line, named ANTS, providing some details on the algorithm and presenting results recently obtained on a prototypical strongly constrained problem: the set partitioning problem.

Document type
Maniezzo, V.
Roffilli, M.
Ant colony optimization, set partitioning problem, hardly constrained problem, combinatorial optimization, metaheuristics
Deposit date
15 Jan 2008
Last modified
16 May 2011 12:07

Other metadata

This work may be freely consulted and used, may be reproduced on a permanent basis in a digital format (i.e. saving) and may be printed on paper with own personal equipment (without availing of third -parties services), for strictly and exclusively personal, research or teaching purposes, with express exclusion of any direct or indirect commercial use, unless otherwise expressly agreed between the user and the author or the right holder. All other rights are reserved. In particular, it is not allowed to retransmit it via telecommunication network, to distribute or send it in any form, including the personal redirection (e-mail).



Staff only: View the document