Balancing exploration and exploitation in genetic algorithm optimization: a novel selection operatorBalancing exploration and exploitation in genetic algorithm...Ş. B. Dalkılıç et al.

被引:0
|
作者
Şahin Burak Dalkılıç [1 ]
Atilla Özgür [2 ]
Hamit Erdem [1 ]
机构
[1] Baskent University,Electric and Electronics Engineering, Faculty of Engineering, Institute of Science
[2] Constructor University,Mathematics and Logistics
关键词
Travelling salesman problem; Genetic algorithms; Selection operators; Selection pressure; Statistical analysis;
D O I
10.1007/s12065-025-01028-8
中图分类号
学科分类号
摘要
The effectiveness of genetic algorithms (GA) is dependent on the selection of operators utilized. A multitude of researchers have proposed a variety of operators with the aim of improving the performance of GA. The results demonstrate that achieving optimal outcomes necessitates a balance between exploration and exploitation. Prior to the implementation of crossover and mutation operators, the process of selecting parent individuals to produce offspring is of paramount importance in maintaining equilibrium. In this paper, we put forward a novel parent selection operator with the objective of improving the balance between exploration and exploitation. Moreover, proposed operator have been compared with existing operators in the literature in terms of convergence rate on a total of 30 distinct traveling salesman problems, 11 of which are symmetric and 19 of which are asymmetric. Finally, the statistical merit of the proposed operator is demonstrated through the use of a critical difference diagram (CD). The results obtained demonstrate that the proposed method is more effective than those presented in the existing literature.
引用
下载
收藏
相关论文
共 16 条
  • [1] Balancing the Exploration and Exploitation in an Adaptive Diversity Guided Genetic Algorithm
    Vafaee, Fatemeh
    Turan, Gyoergy
    Nelson, Peter C.
    Berger-Wolf, Tanya Y.
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 2570 - 2577
  • [2] A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem
    Zhao, Gang
    Luo, Wenjuan
    Nie, Huiping
    Li, Chen
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 1, PROCEEDINGS, 2008, : 505 - 509
  • [3] Trade-off between exploration and exploitation with genetic algorithm using a novel selection operator
    Abid Hussain
    Yousaf Shad Muhammad
    Complex & Intelligent Systems, 2020, 6 : 1 - 14
  • [4] Trade-off between exploration and exploitation with genetic algorithm using a novel selection operator
    Hussain, Abid
    Muhammad, Yousaf Shad
    COMPLEX & INTELLIGENT SYSTEMS, 2020, 6 (01) : 1 - 14
  • [5] Adaptive three-dimensional cellular genetic algorithm for balancing exploration and exploitation processes
    Asmaa Al-Naqi
    Ahmet T. Erdogan
    Tughrul Arslan
    Soft Computing, 2013, 17 : 1145 - 1157
  • [6] Adaptive three-dimensional cellular genetic algorithm for balancing exploration and exploitation processes
    Al-Naqi, Asmaa
    Erdogan, Ahmet T.
    Arslan, Tughrul
    SOFT COMPUTING, 2013, 17 (07) : 1145 - 1157
  • [7] Generalized pigeon-inspired optimization algorithm for balancing exploration and exploitation
    Cheng S.
    Zhang M.
    Shi Y.
    Lu H.
    Lei X.
    Wang R.
    Zhongguo Kexue Jishu Kexue/Scientia Sinica Technologica, 2023, 53 (02): : 268 - 279
  • [8] A dual-population genetic algorithm for balanced exploration and exploitation
    Park, Taejin
    Ryu, Kwang Ryel
    PROCEEDINGS OF THE SECOND IASTED INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE, 2006, : 88 - +
  • [9] Coevolutionary genetic algorithm with effective exploration and exploitation of useful schemata
    Handa, H
    Baba, N
    Katai, O
    Sawaragi, T
    PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2, 1998, : 424 - 427
  • [10] Genetic algorithm by coordinating exploration and exploitation --- Convergence properties and performance analyses
    Jiang, Rui
    Luo, Yu-Pin
    Hu, Dong-Cheng
    Szeto, Kwok-Yip
    Jisuanji Xuebao/Chinese Journal of Computers, 2001, 24 (12): : 1233 - 1241