Parallel transfer evolution algorithm

Laili, Yuanjun and Zhang, Lin and Li, Yun (2019) Parallel transfer evolution algorithm. Applied Soft Computing Journal, 75. pp. 686-701. ISSN 1568-4946

[thumbnail of Laili-etal-ASCJ2018-Parallel-transfer-evolution-algorithm]
Text (Laili-etal-ASCJ2018-Parallel-transfer-evolution-algorithm)
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (504kB)| Preview


    Parallelization of an evolutionary algorithm takes the advantage of modular population division and information exchange among multiple processors. However, existing parallel evolutionary algorithms are rather ad hoc and lack a capability of adapting to diverse problems. To accommodate a wider range of problems and to reduce algorithm design costs, this paper develops a parallel transfer evolution algorithm. It is based on the island-model of parallel evolutionary algorithm and, for improving performance, transfers both the connections and the evolutionary operators from one sub-population pair to another adaptively. Needing no extra upper selection strategy, each sub-population is able to select autonomously evolutionary operators and local search operators as subroutines according to both the sub-population's own and the connected neighbor's ranking boards. The parallel transfer evolution is tested on two typical combinatorial optimization problems in comparison with six existing ad-hoc evolutionary algorithms, and is also applied to a real-world case study in comparison with five typical parallel evolutionary algorithms. The tests show that the proposed scheme and the resultant PEA offer high flexibility in dealing with a wider range of combinatorial optimization problems without algorithmic modification or redesign. Both the topological transfer and the algorithmic transfer are seen applicable not only to combinatorial optimization problems, but also to non-permutated complex problems.

    ORCID iDs

    Laili, Yuanjun, Zhang, Lin and Li, Yun ORCID logoORCID:;