论文信息 - Parallel Implementation of Ant Colony Optimization for Travelling Salesman Problem

Parallel Implementation of Ant Colony Optimization for Travelling Salesman Problem

A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.

LAURENŢIU RUDEANU | MITICĂ CRAUS

[1] Luca Maria Gambardella,et al. Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .

[3] Marc Gravel,et al. PARALLEL IMPLEMENTATION OF AN ANT COLONY OPTIMIZATION METAHEURISTIC WITH OPENMP , 2001 .

[4] Cyril Fonlupt,et al. Parallel Ant Colonies for Combinatorial Optimization Problems , 1999, IPPS/SPDP Workshops.

[5] Paul Levi,et al. A new approach to exploiting parallelism in ant colony optimization , 2002, Proceedings of 2002 International Symposium on Micromechatronics and Human Science.

[6] Gabriele Kotsis,et al. Parallelization strategies for the ant system , 1998 .

[7] Thomas Stützle,et al. Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.