Parallel imperialist competitive algorithms. (16th January 2018)

• Record Type: Journal Article
• Authors: Majd, Amin; Sahebi, Golnaz; Daneshtalab, Masoud; Plosila, Juha; Lotfi, Shahriar; Tenhunen, Hannu
• Other Names: Trunfio Giuseppe A. guestEditor.; Spataro William guestEditor.; Sirakoulis Georgios Ch. guestEditor.
• Is Part Of: Concurrency and computation. Volume 30:Number 7(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-01-16
• Subjects: evolutionary computing -- ICA -- multi‐population -- parallel approaches -- parallel programming -- optimization -- super‐linear performance; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4393
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: 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 Competitive Algorithm. The algorithm has been implemented with 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 existing well‐known parallel algorithms, our approach obtains more accurate results within a shorter time period.