A constraint handling technique using compound distance for solving constrained multi-objective optimization problems
Guiding the working population to evenly explore the valuable areas which are not dominated by feasible solutions is important in the process of dealing with constrained multi-objective optimization problems (CMOPs). To this end, according to the angular distance and ℓp-norm, this paper introduces a...
Uloženo v:
| Vydáno v: | AIMS mathematics Ročník 6; číslo 6; s. 6220 - 6241 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
AIMS Press
01.01.2021
|
| Témata: | |
| ISSN: | 2473-6988, 2473-6988 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Guiding the working population to evenly explore the valuable areas which are not dominated by feasible solutions is important in the process of dealing with constrained multi-objective optimization problems (CMOPs). To this end, according to the angular distance and ℓp-norm, this paper introduces a new compound distance to measure individual's search diameter in the objective space. After that, we propose a constraint handling technique using the compound distance and embed it in evolutionary algorithm for solving CMOPs. In the proposed algorithm, the individuals with large search diameters in the valuable areas are given priority to be preserved. This can prevent the working population from getting stuck in the local areas and then find the optimal solutions for CMOPs more effectively. A series of numerical experiments show that the proposed algorithm has better performance and robustness than several existing state-of-the-art constrained multi-objective evolutionary algorithms in dealing with different CMOPs. |
|---|---|
| ISSN: | 2473-6988 2473-6988 |
| DOI: | 10.3934/math.2021365 |