An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

StandardStandard

An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems. / Falahiazar, Alireza; Sharifi, Arash; Seydi, Vahid.
Yn: Journal of Combinatorial Optimization, 01.08.2022, t. 794-849.

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

HarvardHarvard

APA

CBE

MLA

VancouverVancouver

Falahiazar A, Sharifi A, Seydi V. An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems. Journal of Combinatorial Optimization. 2022 Awst 1;794-849. Epub 2022 Mai 6. doi: 10.1007/s10878-022-00860-3

Author

Falahiazar, Alireza ; Sharifi, Arash ; Seydi, Vahid. / An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems. Yn: Journal of Combinatorial Optimization. 2022 ; tt. 794-849.

RIS

TY - JOUR

T1 - An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems

AU - Falahiazar, Alireza

AU - Sharifi, Arash

AU - Seydi, Vahid

PY - 2022/8/1

Y1 - 2022/8/1

N2 - Dynamic multi-objective optimization algorithms are used as powerful methods for solving many problems worldwide. Diversity, convergence, and adaptation to environment changes are three of the most important factors that dynamic multi-objective optimization algorithms try to improve. These factors are functions of exploration, exploitation, selection and adaptation operators. Thus, effective operators should be employed to achieve a robust dynamic optimization algorithm. The algorithm presented in this study is known as spread-based dynamic multi-objective algorithm (SBDMOA) that uses bi-directional mutation and convex crossover operators to exploit and explore the search space. The selection operator of the proposed algorithm is inspired by the spread metric to maximize diversity. When the environment changed, the proposed algorithm removes the dominated solutions and mutated all the non-dominated solutions for adaptation to the new environment. Then the selection operator is used to select desirable solutions from the population of non-dominated and mutated solutions. Generational distance, spread, and hypervolume metrics are employed to evaluate the convergence and diversity of solutions. The overall performance of the proposed algorithm is evaluated and investigated on FDA, DMOP, JY, and the heating optimization problem, by comparing it with the DNSGAII, MOEA/D-SV, DBOEA, KPEA, D-MOPSO, KT-DMOEA, Tr-DMOEA and PBDMO algorithms. Empirical results demonstrate the superiority of the proposed algorithm in comparison to other state-of-the-art algorithms.

AB - Dynamic multi-objective optimization algorithms are used as powerful methods for solving many problems worldwide. Diversity, convergence, and adaptation to environment changes are three of the most important factors that dynamic multi-objective optimization algorithms try to improve. These factors are functions of exploration, exploitation, selection and adaptation operators. Thus, effective operators should be employed to achieve a robust dynamic optimization algorithm. The algorithm presented in this study is known as spread-based dynamic multi-objective algorithm (SBDMOA) that uses bi-directional mutation and convex crossover operators to exploit and explore the search space. The selection operator of the proposed algorithm is inspired by the spread metric to maximize diversity. When the environment changed, the proposed algorithm removes the dominated solutions and mutated all the non-dominated solutions for adaptation to the new environment. Then the selection operator is used to select desirable solutions from the population of non-dominated and mutated solutions. Generational distance, spread, and hypervolume metrics are employed to evaluate the convergence and diversity of solutions. The overall performance of the proposed algorithm is evaluated and investigated on FDA, DMOP, JY, and the heating optimization problem, by comparing it with the DNSGAII, MOEA/D-SV, DBOEA, KPEA, D-MOPSO, KT-DMOEA, Tr-DMOEA and PBDMO algorithms. Empirical results demonstrate the superiority of the proposed algorithm in comparison to other state-of-the-art algorithms.

U2 - 10.1007/s10878-022-00860-3

DO - 10.1007/s10878-022-00860-3

M3 - Article

SP - 794

EP - 849

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

ER -