Systems Engineering and Electronics ›› 2023, Vol. 45 ›› Issue (8): 2405-2414.doi: 10.12305/j.issn.1001-506X.2023.08.14

• Electronic Technology • Previous Articles     Next Articles

Genetic programming algorithm based on cluster tournament and parent matching

Wei FANG, Jingwen LIANG, Hengyang LU   

  1. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China
  • Received:2021-09-07 Online:2023-07-25 Published:2023-08-03
  • Contact: Wei FANG

Abstract:

In the genetic programming algorithm, population diversity plays an important role in avoiding premature convergence. Improving algorithms by controlling population diversity is a hot spot in genetic programming. Therefore, this paper improves the selection mechanism of the algorithm from the perspective of diversity, and proposes a genetic programming algorithm based on clustering tournament mechanism and parent generation matching. The algorithm divides the population into multiple sub populations through clustering so as to adjust the selection pressure of the algorithm to maintain population diversity and to improve the search ability of the algorithm. In addition, the algorithm extracts individual binary features and uses local matching to cross operate the parent generation. From the perspective of parent pair diversity, the algorithm achieves a better balance between the exploration and the exploitation. Multiple comparative experiments on different benchmark problems verify that the population diversity of the proposed algorithm is greatly improved and the optimization ability and convergence speed are better improved.

Key words: genetic programming, selection pressure, parent matching, feature extraction, diversity

CLC Number: 

[an error occurred while processing this directive]