Parallel Imperialist Competitive Algorithms

A1 Originalartikel i en vetenskaplig tidskrift (referentgranskad)


Interna författare/redaktörer


Publikationens författare: Amin Majd, Golnaz Sahebi, Masoud Daneshtalab, Juha Plosila, Shahriar Lotfi, Hannu Tenhunen
Förläggare: Wiley
Publiceringsår: 2018
Tidskrift: Concurrency and Computation: Practice and Experience
Volym: 30
Nummer: 7
eISSN: 1532-0634


Abstrakt

The importance of optimization and NP-problem solving cannot be overemphasized. The usefulness

and popularity of evolutionary computing methods are also well established. There are

various types of evolutionary methods; they are mostly sequential but some of them have parallel

implementations as well.We propose a multi-population method to parallelize the Imperialist

CompetitiveAlgorithm. The algorithm has been implementedwith the Message Passing Interface

on 2 computer platforms, and we have tested our method based on shared memory and message

passing architectural models. An outstanding performance is obtained, demonstrating that

the proposed method is very efficient concerning both speed and accuracy. In addition, compared

with a set of existingwell-known parallel algorithms, our approach obtainsmore accurate results

within a shorter time period.


Senast uppdaterad 2019-22-11 vid 03:17