Objective space partitioning using conflict information for many-objective optimization

Authors:
Antonio López Jaimes;Hernán Aguirre;Kiyoshi Tanaka;Carlos A. Coello Coello
Affiliations:
CINVESTAV-IPN, Computer Science Department, Mexico City, Mexico;Shinshu University, Faculty of Engineering, Nagano, Japan;Shinshu University, Faculty of Engineering, Nagano, Japan;CINVESTAV-IPN, Computer Science Department, Mexico City, Mexico
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 5
Cited 3

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Objective reduction using a feature selection technique

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Controlling dominance area of solutions and its impact on the performance of MOEAs

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Are all objectives necessary? on dimensionality reduction in evolutionary multiobjective optimization

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Adaptive objective space partitioning using conflict information for many-objective optimization

EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Improved random one-bit climbers with adaptive ε-ranking and tabu moves for many-objective optimization

EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
A study on adaptive ε-ranking and tabu moves in random one-bit climbers for many-objective optimization

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here, we present a partition strategy to generate objective subspaces based on the analysis of the conflict information obtained from the Pareto front approximation found by an underlying multi-objective evolutionary algorithm. By grouping objectives in terms of the conflict among them, we aim to separate the multi-objective optimization into several subproblems in such a way that each of them contains the information to preserve as much as possible the structure of the original problem. The ranking and parent selection is independently performed in each subspace. Our experimental results show that the proposed conflictbased partition strategy outperforms NSGA-II in all the test problems considered in this study. In problems in which the degree of conflict among the objectives is significantly different, the conflict-based strategy achieves its best performance.