An improved parallel ant colony optimization based on message passing interface

Authors:
Jie Xiong;Xiaohong Meng;Caiyun Liu
Affiliations:
Key Laboratory of Geo-detection (China University of Geosciences, Beijing), Ministry of Education, Beijing, China;Key Laboratory of Geo-detection (China University of Geosciences, Beijing), Ministry of Education, Beijing, China;Freshman Education Department of Yangtze University, Jingzhou, Hubei, China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 6
Cited 2

Parallel ant colonies for the quadratic assignment problem

Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays

Genetic Programming and Evolvable Machines
A parallel implementation of ant colony optimization

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Ant Colony Optimization

Ant Colony Optimization
Solving the mesh-partitioning problem with an ant-colony algorithm

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Parallel ant colony optimization for the traveling salesman problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence

A survey on parallel ant colony optimization

Applied Soft Computing
A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony Optimization (ACO) is recently proposed metaheuristic approach for solving hard combinatorial optimization problems Parallel implementation of ACO can reduce the computational time obviously An improved parallel ACO algorithm is proposed in this paper, which use dynamic transition probability to enlarge the search space by stimulating ants choosing new path at early stage; use polymorphic ant colony to improve convergence speed by local search and global search; use partially asynchronous parallel implementation, interactive multi-colony parallel and new information exchange strategy to improve the parallel efficiency We implement the algorithm on the Dawn 4000L parallel computer using MPI and C language The Numerical result indicates the algorithm proposed in this paper can improve convergence speed effectively with the fine solution quality.