Text

Offline and Online Objective Reduction via Gaussian Mixture Model Clustering

The objective reduction has been regarded as a basic issue in many-objective optimization. Existing objective reduction methods identify one set of essential objectives using an approximate nondominated front. However, if the Pareto front (PF) of a many-objective optimization problem (MaOP) is irregular, one single set of essential objectives may not be efficient for objective reduction. This article proposes to produce several different sets of essential objectives in objective reduction. More specifically, we use the Gaussian mixture model clustering to classify the obtained nondominated front into different subsets and perform objective reduction on each subset. Both an offline objective reduction method and an online objective reduction method are developed. The experimental results indicate that our proposed methods work well for MaOPs with degenerate or nondegenerate PFs.

Ketersediaan

Informasi Detail

Judul Seri

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION; Vol.27 No.2 April 2023

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 341-354

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MANY-OBJECTIVE OPTIMIZATION
GAUSSIAN MIXTURE MODEL
OBJECTIVE REDUCTION
DEGENERATE PARETO FRONT (PF)

Info Detail Spesifik

DOI: 10.1109/TEVC.2022.3168836

Pernyataan Tanggungjawab

Genghui Li, Zhenkun Wang, Qingfu Zhang, Jianyong Sun

Versi lain/terkait

Lampiran Berkas

Komentar