Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Inbreeding properties of geometric crossover and non-geometric recombinations
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Recombination of similar parents in EMO algorithms
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Comparison between lamarckian and baldwinian repair on multiobjective 0/1 knapsack problems
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
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
IEEE Transactions on Evolutionary Computation
The balance between proximity and diversity in multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover operators for binary strings (e.g., one-point and uniform) tend to decrease the diversity of solutions in EMO algorithms while they improve the convergence to the Pareto front. This is because such a crossover operator, which is called geometric crossover, always generates an offspring in the segment between its two parents under the Hamming distance in the genotype space. That is, the sum of the distances from the generated offspring to its two parents is always equal to the distance between the parents. In this paper, first we propose a non-geometric binary crossover operator to generate an offspring outside the segment between its parents. Next we examine the effect of the use of non-geometric binary crossover on single-objective genetic algorithms. Experimental results show that non-geometric binary crossover improves their search ability. Then we examine its effect on EMO algorithms. Experimental results show that non-geometric binary crossover drastically increases the diversity of solutions while it slightly degrades their convergence to the Pareto front. As a result, some performance measures such as hypervolume are clearly improved.