A Novel Collective Crossover Operator for Genetic Algorithms

被引:0
|
作者
Kiraz, Berna [1 ]
Bidgoli, Azam Asilian [2 ]
Ebrahimpour-Komleh, Hossein [2 ]
Rahnamayan, Shahryar [3 ]
机构
[1] Fatih Sultan Mehmet Vakif Univ, Dept Comp Engn, Istanbul, Turkey
[2] Univ Kashan, Dept Elect & Comp Engn, Kashan, Iran
[3] Ontario Tech Univ, Dept Elect Comp & Software Engn, Nat Inspired Computat Intelligence NICI Lab, Oshawa, ON, Canada
来源
2020 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC) | 2020年
关键词
Genetic algorithms; Crossover operator; Multi-parent crossover; Optimization; All-parent crossover;
D O I
10.1109/smc42975.2020.9282841
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Crossover is the main genetic operator which influences the power of evolutionary algorithms. Among a variety of crossover operators, there has been a growing interest in multi-parent crossover operators in evolutionary computation. The main motivation of those schemes is establishing comprehensive collective collaboration of more than two chromosomes in the population to generate a new offspring. In this paper, a novel all-parent crossover operator called collective crossover for genetic algorithm is proposed. In this method, all individuals in the current population are involved in recombination part and one offspring is generated. The contribution of each individuals is defined based on its quality in terms of fitness value. The performance of the collective crossover operator is tested on CEC-2017 benchmark functions. The results revealed that the proposed crossover operator performs better when compared to well-known two-parent crossover operators including one-point and two-point crossovers. In addition, the differences between collective crossover and the other crossover operators are statistically significant for the most cases.
引用
收藏
页码:4204 / 4209
页数:6
相关论文
共 50 条
  • [1] The influence of crossover operator on the diversity in genetic algorithms
    Tian, FH
    IC-AI'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 1-III, 2000, : 481 - 486
  • [2] A novel crossover operator for genetic algorithm: Stas crossover
    Poohoi, Ratchadakorn
    Puntusavase, Kanate
    Ohmori, Shunichi
    DECISION SCIENCE LETTERS, 2023, 12 (03) : 515 - 524
  • [3] A new crossover operator for genetic algorithms
    Coli, M
    Gennuso, G
    Palazzari, P
    1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 201 - 206
  • [4] A Novel Crossover Operator Designed to Exploit Synergies of Two Crossover Operators for Real-Coded Genetic Algorithms
    Shashi
    Deep, Kusum
    PROCEEDINGS OF FIFTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2015), VOL 2, 2016, 437 : 343 - 350
  • [5] Genetic algorithms and VRP: the behaviour of a crossover operator
    Vaira, Gintaras
    Kurasova, Olga
    BALTIC JOURNAL OF MODERN COMPUTING, 2013, 1 (3-4): : 161 - 185
  • [6] Appropriate Combination of Crossover Operator and Mutation Operator in Genetic Algorithms for the Travelling Salesman Problem
    Ahmed, Zakir Hussain
    Haron, Habibollah
    Al-Tameem, Abdullah
    CMC-COMPUTERS MATERIALS & CONTINUA, 2024, 79 (02): : 2399 - 2425
  • [7] The TransRAR Crossover Operator for Genetic Algorithms with Set Encoding
    Ruiz-Torrubiano, Ruben
    Suarez, Alberto
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 489 - 496
  • [8] Composite clustering crossover operator for improving genetic algorithms
    Busmchiu, Andrei
    2023 25TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, SYNASC 2023, 2023, : 332 - 339
  • [9] A new crossover operator for real coded genetic algorithms
    Deep, Kusum
    Thakur, Manoj
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) : 895 - 911
  • [10] A novel ODV crossover operator-based genetic algorithms for traveling salesman problem
    Victer Paul, P.
    Ganeshkumar, C.
    Dhavachelvan, P.
    Baskaran, R.
    SOFT COMPUTING, 2020, 24 (17) : 12855 - 12885