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.

• Type: Conference
• Year: 1999
• Where: IPPS
• Authors: El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Denis Robilliard
• Keywords: Ant Colonies, Colonies AC Optimization, Distributed And Parallel Computing, IPPS 1999, Real Ant Colonies