Name
Abstract | ||
|---|---|---|
The decomposition-based evolutionary algorithm has become an increasingly popular choice for posterior multiobjective optimization. Facing the challenges of an increasing number of objectives, many techniques have been developed which help to balance the convergence and diversity. Nevertheless, according to a recent study by Ishibuchi
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</italic>
, due to the predefined search directions toward the ideal point, their performance strongly depends on the Pareto front (PF) shapes, especially the orientation of the PFs. To balance the convergence and diversity for decomposition-based methods and to alleviate their performance dependence on the orientation of the PFs, this paper develops an adversarial decomposition method for many-objective optimization, which leverages the complementary characteristics of different subproblem formulations within a single paradigm. More specifically, two populations are co-evolved by two subproblem formulations with different contours and adversarial search directions. To avoid allocating redundant computational resources to the same region of the PF, the two populations are matched into one-to-one solution pairs according to their working regions upon the PF. Each solution pair can at most contribute one principal mating parent during the mating selection process. When comparing nine state-of-the-art many-objective optimizers, we have witnessed the competitive performance of our proposed algorithm on 130 many-objective test problems with various characteristics, including regular and inverted PFs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TCYB.2018.2872803 | IEEE transactions on cybernetics |
Keywords | Field | DocType |
Sociology,Statistics,Optimization,Convergence,Computer science,Evolutionary computation,Shape | Convergence (routing),Population,Mathematical optimization,Evolutionary algorithm,Ranking,Evolutionary computation,Multi-objective optimization,Optimization problem,Pareto principle,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 2 | 2168-2267 |
Citations | PageRank | References |
14 | 0.45 | 46 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mengyuan Wu | 1 | 62 | 2.71 |
| Ke Li | 2 | 75 | 4.86 |
| Sam Kwong | 3 | 4590 | 315.78 |
| Qingfu Zhang | 4 | 7634 | 255.05 |