Your browser doesn't support javascript.
loading
An improved differential evolution algorithm for multi-modal multi-objective optimization.
Qu, Dan; Xiao, Hualin; Chen, Huafei; Li, Hongyi.
Afiliación
  • Qu D; College of Mathematics Education, China West Normal University, Nanchong, China.
  • Xiao H; College of Mathematics and Statistics, Sichuan University of Science & Engineering, Zigong, China.
  • Chen H; College of Mathematics Education, China West Normal University, Nanchong, China.
  • Li H; College of Mathematics and Statistics, Sichuan University of Science & Engineering, Zigong, China.
PeerJ Comput Sci ; 10: e1839, 2024.
Article en En | MEDLINE | ID: mdl-38660209
ABSTRACT
Multi-modal multi-objective problems (MMOPs) have gained much attention during the last decade. These problems have two or more global or local Pareto optimal sets (PSs), some of which map to the same Pareto front (PF). This article presents a new affinity propagation clustering (APC) method based on the Multi-modal multi-objective differential evolution (MMODE) algorithm, called MMODE_AP, for the suit of CEC'2020 benchmark functions. First, two adaptive mutation strategies are adopted to balance exploration and exploitation and improve the diversity in the evolution process. Then, the affinity propagation clustering method is adopted to define the crowding degree in decision space (DS) and objective space (OS). Meanwhile, the non-dominated sorting scheme incorporates a particular crowding distance to truncate the population during the environmental selection process, which can obtain well-distributed solutions in both DS and OS. Moreover, the local PF membership of the solution is defined, and a predefined parameter is introduced to maintain of the local PSs and solutions around the global PS. Finally, the proposed algorithm is implemented on the suit of CEC'2020 benchmark functions for comparison with some MMODE algorithms. According to the experimental study results, the proposed MMODE_AP algorithm has about 20 better performance results on benchmark functions compared to its competitors in terms of reciprocal of Pareto sets proximity (rPSP), inverted generational distances (IGD) in the decision (IGDX) and objective (IGDF). The proposed algorithm can efficiently achieve the two goals, i.e., the convergence to the true local and global Pareto fronts along with better distributed Pareto solutions on the Pareto fronts.
Palabras clave

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Idioma: En Revista: PeerJ Comput Sci Año: 2024 Tipo del documento: Article País de afiliación: China

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Idioma: En Revista: PeerJ Comput Sci Año: 2024 Tipo del documento: Article País de afiliación: China
...