Robust parallel hybrid artificial bee colony algorithms for the multi-dimensional numerical optimization

No Thumbnail Available

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Date

2020-09

Major/Subject

Mcode

Degree programme

Language

en

Pages

21

Series

Journal of Supercomputing, Volume 76, issue 9, pp. 7026-7046

Abstract

This study proposes a set of new robust parallel hybrid metaheuristic algorithms based on artificial bee colony (ABC) and teaching learning-based optimization (TLBO) for the multi-dimensional numerical problems. The best practices of ABC and TLBO are implemented to provide robust algorithms on a distributed memory computation environment using MPI libraries. Island parallel versions of the proposed hybrid algorithm are observed to obtain much better results than those of sequential versions. Parallel pseudorandom number generators are used to provide diverse solution candidates to prevent stagnation into local optima. The performances of the proposed hybrid algorithms are compared with eight different metaheuristics algorithms of particle swarm optimization, differential evolution variants, ABC variants and evolutionary algorithm. The empirical results show that the new hybrid parallel algorithms are scalable and the best performing algorithms when compared to the state-of-the-art metaheuristics.

Description

Keywords

Artificial bee colony, Hybrid, Parallel, TLBO

Other note

Citation

Dokeroglu, T, Pehlivan, S & Avenoglu, B 2020, ' Robust parallel hybrid artificial bee colony algorithms for the multi-dimensional numerical optimization ', Journal of Supercomputing, vol. 76, no. 9, pp. 7026-7046 . https://doi.org/10.1007/s11227-019-03127-7