{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/evolutionary-retrosynthetic-route-planning","title":"Evolutionary Retrosynthetic Route Planning","arxiv_id":"2310.05186","date":"2023-10-08","proceeding":null,"authors":["Yan Zhang","Hao Hao","Xiao He","Shuanhu Gao","Aimin Zhou"],"abstract":"Molecular retrosynthesis is a significant and complex problem in the field of chemistry, however, traditional manual synthesis methods not only need well-trained experts but also are time-consuming. With the development of big data and machine learning, artificial intelligence (AI) based retrosynthesis is attracting more attention and has become a valuable tool for molecular retrosynthesis. At present, Monte Carlo tree search is a mainstream search framework employed to address this problem. Nevertheless, its search efficiency is compromised by its large search space. Therefore, this paper proposes a novel approach for retrosynthetic route planning based on evolutionary optimization, marking the first use of Evolutionary Algorithm (EA) in the field of multi-step retrosynthesis. The proposed method involves modeling the retrosynthetic problem into an optimization problem, defining the search space and operators. Additionally, to improve the search efficiency, a parallel strategy is implemented. The new approach is applied to four case products and compared with Monte Carlo tree search. The experimental results show that, in comparison to the Monte Carlo tree search algorithm, EA significantly reduces the number of calling single-step model by an average of 53.9%. The time required to search three solutions decreases by an average of 83.9%, and the number of feasible search routes increases by 1.38 times. The source code is available at https://github.com/ilog-ecnu/EvoRRP.","url_abs":"https://arxiv.org/abs/2310.05186v2","url_pdf":"https://arxiv.org/pdf/2310.05186v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"evolutionary-retrosynthetic-route-planning","repo_url":"https://github.com/ilog-ecnu/EvoRRP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-step-retrosynthesis","task_name":"Multi-step retrosynthesis"},{"task_slug":"retrosynthesis","task_name":"Retrosynthesis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.05186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05186"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ilog-ecnu/EvoRRP","reach":{"status":"ok"}}],"summary":{"ran":5},"by_repo_kind":{"official":{"samples":5,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"samples":[{"code_sha256_prefix":"9474d57bd0713385","entry":"float_random_init","repo":"ilog-ecnu/EvoRRP","repo_kind":"official","path":"algorithm/eda_model/utils_eda.py","file_url":"https://github.com/ilog-ecnu/EvoRRP/blob/HEAD/algorithm/eda_model/utils_eda.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9474d57bd0713385"}},{"code_sha256_prefix":"a5bf58320652e56f","entry":"gen_float_solution_via_matrix","repo":"ilog-ecnu/EvoRRP","repo_kind":"official","path":"algorithm/eda_model/utils_eda.py","file_url":"https://github.com/ilog-ecnu/EvoRRP/blob/HEAD/algorithm/eda_model/utils_eda.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a5bf58320652e56f"}},{"code_sha256_prefix":"a0815a08466f89f6","entry":"get_data_from_population","repo":"ilog-ecnu/EvoRRP","repo_kind":"official","path":"algorithm/eda_model/utils_eda.py","file_url":"https://github.com/ilog-ecnu/EvoRRP/blob/HEAD/algorithm/eda_model/utils_eda.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a0815a08466f89f6"}},{"code_sha256_prefix":"a3ca2f825185e95c","entry":"get_main_part_from_smistr","repo":"ilog-ecnu/EvoRRP","repo_kind":"official","path":"algorithm/utils.py","file_url":"https://github.com/ilog-ecnu/EvoRRP/blob/HEAD/algorithm/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a3ca2f825185e95c"}},{"code_sha256_prefix":"e74b48a7119ff154","entry":"local_search","repo":"ilog-ecnu/EvoRRP","repo_kind":"official","path":"algorithm/eda_model/edamodel.py","file_url":"https://github.com/ilog-ecnu/EvoRRP/blob/HEAD/algorithm/eda_model/edamodel.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e74b48a7119ff154"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}