Parallel optimization based on artificial bee colony algorithm
- 1 March 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 955-959
Abstract
This paper aims to tackle the shortcomings of the standard artificial bee colony algorithm (ABC) such as slow convergence, long solving time and being easy to fall into local optima. We study the state transformation formula and propose a parallelized ABC algorithm with Message Passing Interface (MPI). We use the traveling salesman problem (TSP) as the case study. Our experiments show that the parallel ABC algorithm has an advantage in speed over the standard algorithm w.r.t. iterations and convergence speed.Keywords
This publication has 3 references indexed in Scilit:
- A modified ABC algorithm based on improved-global-best-guided approach and adaptive-limit strategy for global optimizationApplied Soft Computing, 2016
- Parallelizing Simulated Annealing Algorithm in Many Integrated Core Architecture2016
- Research of Parallel Artificial Bee Colony Algorithm Based on MPI2013