TY - JOUR
T1 - RetroEA
T2 - An efficient evolutionary algorithm for retrosynthetic route planning
AU - Zhang, Yan
AU - Hao, Hao
AU - He, Xiao
AU - Zhou, Aimin
N1 - Publisher Copyright:
© 2025
PY - 2025/7
Y1 - 2025/7
N2 - Significant progress has been achieved in the field of organic molecular retrosynthesis. However, traditional synthesis methods not only require expert knowledge but are also highly time-consuming. With the development of machine learning, artificial intelligence based methods for organic molecular synthesis have become increasingly popular. Recently, evolutionary optimization emerging as an efficient approach for addressing molecular retrosynthesis, its performance has been hindered by mismatches between the discrete encoding and continuous genetic operator, and the extensive size of the search space. In response to these issues, this paper overcomes the discrete nature of the retrosynthetic route planning problem by employing discrete encoding methods and corresponding discrete genetic operators, and reduces the search space through the use of pruning techniques. Applied to four distinct case products, the proposed method not only reduces the calling of the single-step model by an average of 66.1%, but also decreases the time required to identify three feasible solutions by 51.5% across four cases, outperforming current state-of-the-art methods.
AB - Significant progress has been achieved in the field of organic molecular retrosynthesis. However, traditional synthesis methods not only require expert knowledge but are also highly time-consuming. With the development of machine learning, artificial intelligence based methods for organic molecular synthesis have become increasingly popular. Recently, evolutionary optimization emerging as an efficient approach for addressing molecular retrosynthesis, its performance has been hindered by mismatches between the discrete encoding and continuous genetic operator, and the extensive size of the search space. In response to these issues, this paper overcomes the discrete nature of the retrosynthetic route planning problem by employing discrete encoding methods and corresponding discrete genetic operators, and reduces the search space through the use of pruning techniques. Applied to four distinct case products, the proposed method not only reduces the calling of the single-step model by an average of 66.1%, but also decreases the time required to identify three feasible solutions by 51.5% across four cases, outperforming current state-of-the-art methods.
KW - Discrete encoding
KW - Evolutionary optimization
KW - Retrosynthesis
UR - https://www.scopus.com/pages/publications/105005516119
U2 - 10.1016/j.swevo.2025.101967
DO - 10.1016/j.swevo.2025.101967
M3 - 文章
AN - SCOPUS:105005516119
SN - 2210-6502
VL - 96
JO - Swarm and Evolutionary Computation
JF - Swarm and Evolutionary Computation
M1 - 101967
ER -