Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives

Adaptive weight-vector adjustment has been explored to compensate for the weakness of the evolutionary many-objective algorithms based on decomposition in solving problems with irregular Pareto-optimal fronts. One essential issue is that the distribution of previously visited solutions likely mismat...

Full description

Bibliographic Details
Main Authors: Lining Xing, Rui Wu, Jiaxing Chen, Jun Li
Format: Article
Language:English
Published: MDPI AG 2022-12-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/11/1/10
_version_ 1797625321528229888
author Lining Xing
Rui Wu
Jiaxing Chen
Jun Li
author_facet Lining Xing
Rui Wu
Jiaxing Chen
Jun Li
author_sort Lining Xing
collection DOAJ
description Adaptive weight-vector adjustment has been explored to compensate for the weakness of the evolutionary many-objective algorithms based on decomposition in solving problems with irregular Pareto-optimal fronts. One essential issue is that the distribution of previously visited solutions likely mismatches the irregular Pareto-optimal front, and the weight vectors are misled towards inappropriate regions. The fact above motivated us to design a novel many-objective evolutionary algorithm by performing local searches on an external archive, namely, LSEA. Specifically, the LSEA contains a new selection mechanism without weight vectors to alleviate the adverse effects of inappropriate weight vectors, progressively improving both the convergence and diversity of the archive. The solutions in the archive also feed back the weight-vector adjustment. Moreover, the LSEA selects a solution with good diversity but relatively poor convergence from the archive and then perturbs the decision variables of the selected solution one by one to search for solutions with better diversity and convergence. At last, the LSEA is compared with five baseline algorithms in the context of 36 widely-used benchmarks with irregular Pareto-optimal fronts. The comparison results demonstrate the competitive performance of the LSEA, as it outperforms the five baselines on 22 benchmarks with respect to metric hypervolume.
first_indexed 2024-03-11T09:54:55Z
format Article
id doaj.art-52517424cca746ea8a1b49c5acd825d1
institution Directory Open Access Journal
issn 2227-7390
language English
last_indexed 2024-03-11T09:54:55Z
publishDate 2022-12-01
publisher MDPI AG
record_format Article
series Mathematics
spelling doaj.art-52517424cca746ea8a1b49c5acd825d12023-11-16T15:52:09ZengMDPI AGMathematics2227-73902022-12-011111010.3390/math11010010Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External ArchivesLining Xing0Rui Wu1Jiaxing Chen2Jun Li3School of Electronic Engineering, Xidian University, Xi’an 710071, ChinaInner Mongolia Institute of Dynamical Machinery, Hohhot 010010, ChinaInner Mongolia Institute of Dynamical Machinery, Hohhot 010010, ChinaSchool of Management, Hunan Institute of Engineering, Xiangtan 411104, ChinaAdaptive weight-vector adjustment has been explored to compensate for the weakness of the evolutionary many-objective algorithms based on decomposition in solving problems with irregular Pareto-optimal fronts. One essential issue is that the distribution of previously visited solutions likely mismatches the irregular Pareto-optimal front, and the weight vectors are misled towards inappropriate regions. The fact above motivated us to design a novel many-objective evolutionary algorithm by performing local searches on an external archive, namely, LSEA. Specifically, the LSEA contains a new selection mechanism without weight vectors to alleviate the adverse effects of inappropriate weight vectors, progressively improving both the convergence and diversity of the archive. The solutions in the archive also feed back the weight-vector adjustment. Moreover, the LSEA selects a solution with good diversity but relatively poor convergence from the archive and then perturbs the decision variables of the selected solution one by one to search for solutions with better diversity and convergence. At last, the LSEA is compared with five baseline algorithms in the context of 36 widely-used benchmarks with irregular Pareto-optimal fronts. The comparison results demonstrate the competitive performance of the LSEA, as it outperforms the five baselines on 22 benchmarks with respect to metric hypervolume.https://www.mdpi.com/2227-7390/11/1/10evolutionary computationmany-objective optimizationirregular Pareto-optimal frontslocal searchexternal archive
spellingShingle Lining Xing
Rui Wu
Jiaxing Chen
Jun Li
Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
Mathematics
evolutionary computation
many-objective optimization
irregular Pareto-optimal fronts
local search
external archive
title Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
title_full Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
title_fullStr Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
title_full_unstemmed Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
title_short Handling Irregular Many-Objective Optimization Problems via Performing Local Searches on External Archives
title_sort handling irregular many objective optimization problems via performing local searches on external archives
topic evolutionary computation
many-objective optimization
irregular Pareto-optimal fronts
local search
external archive
url https://www.mdpi.com/2227-7390/11/1/10
work_keys_str_mv AT liningxing handlingirregularmanyobjectiveoptimizationproblemsviaperforminglocalsearchesonexternalarchives
AT ruiwu handlingirregularmanyobjectiveoptimizationproblemsviaperforminglocalsearchesonexternalarchives
AT jiaxingchen handlingirregularmanyobjectiveoptimizationproblemsviaperforminglocalsearchesonexternalarchives
AT junli handlingirregularmanyobjectiveoptimizationproblemsviaperforminglocalsearchesonexternalarchives