An Efficient Parallel Version of Dynamic Multi-Objective Evolutionary Algorithm

  • Ghadeer Written by
  • Update: 30/06/2022

An Efficient Parallel Version of Dynamic Multi-Objective Evolutionary Algorithm

Maroua Grid

Computer Science Department,

Barika University Centre, Algeria

This email address is being protected from spambots. You need JavaScript enabled to view it.

Leyla Belaiche

Computer Science Department,

Biskra University, Algeria

This email address is being protected from spambots. You need JavaScript enabled to view it.

Laid Kahloul

Computer Science Department,

Biskra University, Algeria

 This email address is being protected from spambots. You need JavaScript enabled to view it.

Saber Benharzallah

Computer Science Department,

 Batna 2 University, Algeria

This email address is being protected from spambots. You need JavaScript enabled to view it.

Abstract: Multi-Objective Optimization Evolutionary Algorithms (MOEAs) belong to heuristic methods proposed for solving Multi-objective Optimization Problems (MOPs). In fact, MOEAs search for a uniformly distributed, near-optimal, and near-complete Pareto front for a given MOP. However, several MOEAs fail to achieve their aim completely due to their fixed population size. To overcome this shortcoming, Dynamic Multi-Objective Evolutionary Algorithm (DMOEA) [20] was proposed. Although DMOEA has the distinction of dynamic population size, it still suffers from a long execution time. To deal with the last disadvantage, we have proposed previously a Parallel Dynamic Multi-Objective Evolutionary Algorithm (PDMOEA) [10] to obtain efficient results in less execution time than the sequential counterparts, in order to tackle more complex problems. This paper is an extended version of [10] and it aims to demonstrate the efficiency of PDMOEA through more experimentations and comparisons. We firstly compare DMOEA with other multi-objective evolutionary algorithms Non-Dominated Sorting Genetic Algorithm (NSGA-II) and Strength Pareto Evolutionary Algorithm (SPEA-II), then we present an exhaustive comparison of PDMOEA versus DMOEA and discuss how the number of used processors influences the efficiency of PDMOEA. As experimental results, PDMOEA enhances DMOEA in terms of three criteria: improving the objective space, minimizing the computational time, and converging to the desired population size. Finally, the paper establishes a new formula relating the suitable number of processes, required in PDMOEA, and the number of necessary generations to converge to the optimal solutions.

Keywords: Multi-objective problems, pareto front, multi-objective evolutionary algorithms, dynamic MOEA, parallel DMOEA.

Received April 10, 2022; accepted April 28, 2022
https://doi.org/10.34028/iajit/19/3A/2

Full text

Read 571 times
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…