Parallel Artificial Bee Colony Algorithm for the Traveling Salesman Problem

DOI

10.2991/iccia.2012.160How to use a DOI?

Keywords

parallel algorithm, artificial bee colony algorithm, traveling salesman problem, message passing interface

Abstract

Artificial Bee Colony Algorithm (ABCA) is a novel swarm intelligence algorithm which a colony of artificial bees cooperate in finding good solutions for numerical optimization problems and combinatorial optimization problems. Traveling Salesman Problem (TSP) is a famous combinatorial optimization problem which has been used in many fields such as network communication, transportation, manufacturing and logistics. However, it requires a considerably large amount of computational time and resources for solving TSP. To dealing with this problem, we present a Parallel Artificial Bee Colony Algorithm (PABCA) in several computers which operation system is Linux based on the Message Passing Interface (MPI). The entire artificial bee colony is divided into several subgroups by PABCA equally. Each subgroup performs an ABCA for TSP on each processor node, respectively. Each sub-colony on every processor node communicates the current best fitness function and parameters of current best fitness function according to ring topological structure during calculation process. Some well-known benchmark problems in TSP are used to evaluate the performance of ABCA and PABCA. Meanwhile, the performance of PABCA is compared with Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Experimental results show that the PABCA can obtain solutions with equal precision and reduce the time of computation obviously in comparison with serial ABCA. And PABCA have much better performance in contrast with GA and PSO.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Kun Xu
AU  - Mingyan Jiang
AU  - Dongfeng Yuan
PY  - 2014/05
DA  - 2014/05
TI  - Parallel Artificial Bee Colony Algorithm for the Traveling Salesman Problem
BT  - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012)
PB  - Atlantis Press
SP  - 663
EP  - 667
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccia.2012.160
DO  - 10.2991/iccia.2012.160
ID  - Xu2014/05
ER  -