NeuroCrossover: An intelligent genetic locus selection scheme for genetic algorithm using reinforcement learning

被引:9
作者
Liu, Haoqiang [1 ]
Zong, Zefang [1 ]
Li, Yong [1 ]
Jin, Depeng [1 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Reinforcement learning; Genetic algorithms; Crossover; Intelligent genetic locus selection; Combinatorial optimization problems; Proximal policy optimization; HEURISTICS;
D O I
10.1016/j.asoc.2023.110680
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Researchers have been studying genetic algorithms (GAs) extensively in recent decades and employing them to address extremely challenging combinatorial optimization problems (COPs). Although GAs achieve superior performance, they are less efficient because most GAs are designed manually without intelligent parameter configuration to support scalable problem-solving strategies and learnable evolutionary operators. To address this issue, machine learning (ML) techniques have been integrated with GAs for operator and parameter selection, however, few studies have focused on intelligent genetic locus selection for influential operators in GAs. To fill this gap, this paper proposes an intelligent genetic locus selection algorithm that serves as the foundation of parameter configuration for critical operators. With the established framework, the Cross Information Synergistic Attention (CISA) model and the n-step proximal policy optimization (PPO) have been utilized to intelligently select the appropriate genetic locus for the most influential phase, i.e., crossover, during the evolutionary process. The proposed NeuroCrossover algorithm is validated on extensive COPs, including the traveling salesman problem, capacitated vehicle routing problem, and bin packing problem. The results demonstrate the efficiency and effectiveness of our algorithm, which outperforms other methods in terms of solution quality, convergence speed, and generalization. For instance, with the CISA, the average percentage gaps of our algorithm are 3.64% and 6.38% for instances in TSPLIB and CVRPLIB, respectively, obtaining gains of about 0.47% and 1.20% compared to those of GA. The proposed algorithm provides a novel solution to lead GAs to an efficient search and improve their scalability and learnability.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:16
相关论文
共 48 条
[1]   A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem [J].
Ahmadi, Ehsan ;
Goldengorin, Boris ;
Suer, Gursel A. ;
Mosadegh, Hadi .
APPLIED SOFT COMPUTING, 2018, 65 :214-229
[2]   Robustness and performance of Deep Reinforcement Learning [J].
Al-Nima, Raid Rafi Omar ;
Han, Tingting ;
Al-Sumaidaee, Saadoon Awad Mohammed ;
Chen, Taolue ;
Woo, Wai Lok .
APPLIED SOFT COMPUTING, 2021, 105
[3]   A novel design of differential evolution for solving discrete traveling salesman problems [J].
Ali, Ismail M. ;
Essam, Daryl ;
Kasmarik, Kathryn .
SWARM AND EVOLUTIONARY COMPUTATION, 2020, 52 (52)
[4]   An improved non-dominated sorting biogeography-based optimization algorithm for the (hybrid) multi-objective flexible job-shop scheduling problem [J].
An, Youjun ;
Chen, Xiaohui ;
Li, Yinghe ;
Han, Yaoyao ;
Zhang, Ji ;
Shi, Haohao .
APPLIED SOFT COMPUTING, 2021, 99
[5]  
Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149
[6]   What makes a VRP solution good? The generation of problem-specific knowledge for heuristics [J].
Arnold, Florian ;
Sorensen, Kenneth .
COMPUTERS & OPERATIONS RESEARCH, 2019, 106 :280-288
[7]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[8]   Machine learning for combinatorial optimization: A methodological tour d'horizon [J].
Bengio, Yoshua ;
Lodi, Andrea ;
Prouvost, Antoine .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (02) :405-421
[9]   Hybrid metaheuristics in combinatorial optimization: A survey [J].
Blum, Christian ;
Puchinger, Jakob ;
Raidl, Guenther R. ;
Roli, Andrea .
APPLIED SOFT COMPUTING, 2011, 11 (06) :4135-4151
[10]   Reinforcement Learning-Based Genetic Algorithm in Optimizing Multidimensional Data Discretization Scheme [J].
Chen, Qiong ;
Huang, Mengxing ;
Xu, Qiannan ;
Wang, Hao ;
Wang, Jinghui .
MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020