Generative Model-Driven Large-Scale Dynamic Multi-Objective Evolutionary Optimization

In practical applications, dynamic multi-objective optimization problems inevitably face large-scale scenarios. Massive search space and high-dimensional historical data pose some serious challenges to existing prediction-based change response mechanisms, which affects their ability in maintaining population diversity and accurately predicting convergent solutions. In this paper, we propose a generative model-driven approach that trains a generative model for a new environment only through historical Pareto optimal sets. It can generate both convergent and diverse population for the new environment. We show that by introducing a new training scheme and loss function for adversarial autoencoder, the training of the generative model can achieve stable convergence under high-dimensional coupled data conditions. In addition, the trained generative model can maintain the diversity of generative candidate solutions by smooth sampling in the latent space. Extensive experiments were conducted on a typical dynamic multi-objective testing suite with problem settings ranging from 30 to 600 dimensions. These experimental results demonstrate that the optimization performance of the proposed approach outperforms those of the existing state-of-the-art designs.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11043086
Citations
2
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
3.01
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generative Model-Driven Large-Scale Dynamic Multi-Objective Evolutionary Optimization

Gary G. Yen, Zhenan He, Chenyang Li
2 citations
Advanced Multi-Objective Optimization Algorithms
3.01
article

Generative Model-Driven Large-Scale Dynamic Multi-Objective Evolutionary Optimization

Gary G. Yen, Zhenan He, Chenyang Li
article en
2 citations

Abstract

In practical applications, dynamic multi-objective optimization problems inevitably face large-scale scenarios. Massive search space and high-dimensional historical data pose some serious challenges to existing prediction-based change response mechanisms, which affects their ability in maintaining population diversity and accurately predicting convergent solutions. In this paper, we propose a generative model-driven approach that trains a generative model for a new environment only through historical Pareto optimal sets. It can generate both convergent and diverse population for the new environment. We show that by introducing a new training scheme and loss function for adversarial autoencoder, the training of the generative model can achieve stable convergence under high-dimensional coupled data conditions. In addition, the trained generative model can maintain the diversity of generative candidate solutions by smooth sampling in the latent space. Extensive experiments were conducted on a typical dynamic multi-objective testing suite with problem settings ranging from 30 to 600 dimensions. These experimental results demonstrate that the optimization performance of the proposed approach outperforms those of the existing state-of-the-art designs.

Sichuan University (CN), Chengdu University (CN)
Openalex Percentile: Top 8%
Advanced Multi-Objective Optimization Algorithms
3.01
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.