A Multimodal Multi-Objective Evolutionary Algorithm Based on Historical Archive

For multimodal multi-objective optimization problems, numerous algorithms have been developed and have achieved promising results. However, a common challenge is that many works do not make full use of historical information. Even if an excellent solution is found, it cannot be retained, which leads to accidental deletion or convergence diversity oscillation. This paper proposes a historical archive-based algorithm, named MMO_HA. The algorithm reintroduces discarded individuals during iterations via a historical archive (HA), leveraging a neighborhood-based method that considers the diversity of these individuals in both the decision and objective spaces. The HA is updated alongside the population and eventually merged with the optimal archive (EXA), providing a positive supplement to EXA. Finally, a selection process based on decision-space neighborhood strategies using objective-space crowding distances is applied to further enhance diversity. Experimental results on the 2019 CEC test suite demonstrate the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icaace65325.2025.11019925
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multimodal Multi-Objective Evolutionary Algorithm Based on Historical Archive

Jiankang Song, Caitong Yue, Mengnan Liu, Jing Liang
Advanced Multi-Objective Optimization Algorithms
article

A Multimodal Multi-Objective Evolutionary Algorithm Based on Historical Archive

Jiankang Song, Caitong Yue, Mengnan Liu, Jing Liang
article en

Abstract

For multimodal multi-objective optimization problems, numerous algorithms have been developed and have achieved promising results. However, a common challenge is that many works do not make full use of historical information. Even if an excellent solution is found, it cannot be retained, which leads to accidental deletion or convergence diversity oscillation. This paper proposes a historical archive-based algorithm, named MMO_HA. The algorithm reintroduces discarded individuals during iterations via a historical archive (HA), leveraging a neighborhood-based method that considers the diversity of these individuals in both the decision and objective spaces. The HA is updated alongside the population and eventually merged with the optimal archive (EXA), providing a positive supplement to EXA. Finally, a selection process based on decision-space neighborhood strategies using objective-space crowding distances is applied to further enhance diversity. Experimental results on the 2019 CEC test suite demonstrate the effectiveness of the proposed method.

Zhengzhou University (CN)
Openalex Percentile: Top 86%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.