Zobraziť v EDS

A parametric segmented multifactorial evolutionary algorithm based on a three-phase analysis.

Uložené v:
Podrobná bibliografia
Názov: A parametric segmented multifactorial evolutionary algorithm based on a three-phase analysis.
Autori: Chai, Peihua, Cao, Langcai, Xu, Ridong, Zeng, Yifeng
Zdroj: Applied Intelligence; Nov2023, Vol. 53 Issue 21, p25605-25625, 21p
Predmety: EVOLUTIONARY algorithms, TRAVELING salesman problem, COMPUTER multitasking, COMBINATORIAL optimization, BENCHMARK problems (Computer science), SEARCH algorithms, RESEARCH personnel
Abstrakt: Evolutionary multitasking optimization, which concentrates on solving multiple tasks simultaneously, has been a core area of interest for researchers in recent years. Existing Multifactorial Evolutionary Algorithms (MFEA) are quite dependent on the synergy among the tasks. Consequently, solving multiple tasks is prone to fall into local traps when the optimization enters a certain stage. The objective of this paper is to investigate these problems in more detail and provide corresponding solutions. Specifically, we propose a three-stage analysis method that divides the multitasking optimization problem into three stages and explain the MFEA features according to the individual distribution in each stage, based on which we further develop a Parametric Segmented Multifactorial Evolutionary Algorithm (PS-MFEA) and apply a precise search strategy in the algorithm. Additionally, we propose both a reinitialization mechanism and a backtracking mechanism to avoid local optima. We conduct a comprehensive experiment on two test sets of benchmark problems with different similarity levels and the discrete combinatorial optimization tasks of the traveling salesman problem. The results demonstrate that using PS-MFEA can obtain better performances in both test sets and solve practical problems. [ABSTRACT FROM AUTHOR]
Copyright of Applied Intelligence is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáza: Complementary Index
Popis
Abstrakt:Evolutionary multitasking optimization, which concentrates on solving multiple tasks simultaneously, has been a core area of interest for researchers in recent years. Existing Multifactorial Evolutionary Algorithms (MFEA) are quite dependent on the synergy among the tasks. Consequently, solving multiple tasks is prone to fall into local traps when the optimization enters a certain stage. The objective of this paper is to investigate these problems in more detail and provide corresponding solutions. Specifically, we propose a three-stage analysis method that divides the multitasking optimization problem into three stages and explain the MFEA features according to the individual distribution in each stage, based on which we further develop a Parametric Segmented Multifactorial Evolutionary Algorithm (PS-MFEA) and apply a precise search strategy in the algorithm. Additionally, we propose both a reinitialization mechanism and a backtracking mechanism to avoid local optima. We conduct a comprehensive experiment on two test sets of benchmark problems with different similarity levels and the discrete combinatorial optimization tasks of the traveling salesman problem. The results demonstrate that using PS-MFEA can obtain better performances in both test sets and solve practical problems. [ABSTRACT FROM AUTHOR]
ISSN:0924669X
DOI:10.1007/s10489-023-04917-6