On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Reference point based multi-objective optimization using evolutionary algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Objective reduction using a feature selection technique
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Objective reduction in evolutionary multiobjective optimization: Theory and applications
Evolutionary Computation
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Optimization of scalarizing functions through evolutionary multiobjective optimization
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Pareto-, aggregation-, and indicator-based methods in many-objective optimization
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Alternative fitness assignment methods for many-objective optimization problems
EA'09 Proceedings of the 9th international conference on Artificial evolution
Self-controlling dominance area of solutions in evolutionary many-objective optimization
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Many-objective directed evolutionary line search
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
IEEE Transactions on Evolutionary Computation
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Hi-index | 0.00 |
In this work, we analyze variable space diversity of Pareto optimal solutions (POS) and study the effectiveness of crossover and mutation operators in evolutionary many-objective optimization. First we examine the diversity of variables in the true POS on many-objective 0/1 knapsack problems with up to 20 items (bits), showing that variables in POS become noticeably diverse as we increase the number of objectives. We also verify the effectiveness of conventional two-point and uniform crossovers, Local Recombination that selects mating parents based on proximity in objective space, and two-point and uniform crossover operators which Controls the maximum number of Crossed Genes (CCG). We use NSGA-II, SPEA2, IBEA ∈驴+驴 and MSOPS, which adopt different selection methods, and many-objective 0/1 knapsack problems with $n=\{100,250,500,750,\mbox{1,000}\}$ items (bits) and m驴=驴{2,4,6,8,10} objectives to verify the search performance of each crossover operator. Simulation results reveal that Local Recombination and CCG operators significantly improve search performance especially for NSGA-II and MSOPS, which have high diversity of genes in the population. Also, results show that CCG operators achieve higher search performance than Local Recombination for m驴驴驴4 objectives and that their effectiveness becomes larger as the number of objectives m increases. In addition, the contribution of CCG and mutation operators for the solutions search is analyzed and discussed.