Sciweavers

Share
IPPS
1999
IEEE

Parallel Ant Colonies for Combinatorial Optimization Problems

8 years 10 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem QAP. Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is feasible to solve large optimization problems.
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Denis Robilliard
Comments (0)
books