Sökning: L773:1532 0626 OR L773:1532 0634 >
Parallel imperialis...
Parallel imperialist competitive algorithms
-
- Majd, Amin (författare)
- Abo Akad Univ, Finland.
-
- Sahebi, Golnaz (författare)
- Univ Turku, Finland.
-
- Daneshtalab, Masoud (författare)
- Mälardalens högskola,Inbyggda system
-
visa fler...
-
- Plosila, Juha (författare)
- Univ Turku, Finland.
-
- Lotfi, Shahriar (författare)
- Univ Tabriz, Iran.
-
- Tenhunen, Hannu (författare)
- Univ Turku, Finland.
-
visa färre...
-
Abo Akad Univ, Finland Univ Turku, Finland. (creator_code:org_t)
- 2018-01-16
- 2018
- Engelska.
-
Ingår i: Concurrency and Computation. - : WILEY. - 1532-0626 .- 1532-0634. ; 30:7
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- evolutionary computing
- ICA
- multi-population
- parallel approaches
- parallel programming
- optimization
- super-linear performance
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas