.png){kind=icon}
.png){kind=icon}
Return
An adaptive adjacent maximum distance crossover operator for multi-objective algorithms
.png){kind=icon}
OA
AI
DOI：10.1007/s00500-023-07978-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results.
Keywords:
Multi-objective optimization
Diversity
Convergence
NSGA-II
MOEA
D
Adaptive crossover operator
