MULTI-OBJECTIVE SYNTHESIS PLANNING BY MEANS OF MONTE CARLO TREE SEARCH

26 September 2024, Version 1
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

We introduce a multi-objective search algorithm for retrosynthesis planning, based on a Monte Carlo Tree search formalism. The multi-objective search allow for combining diverse set of objectives without considering their scale or weighting factors. To benchmark this novel algorithm, we employ four objectives in a total of eight retrosynthesis experiments on a PaRoutes benchmark set. The objectives ranges from simple ones based on starting material and step count to complex ones based on synthesis complexity and route similarity. We show that with the careful employment of complex objectives, the multi-objective algorithm outperforms the single-objective search and provides a more diverse set of solution that is closer to the desired objective. Our algorithm thus provides a framework for incorporating novel objectives for specific applications in synthesis planning.

Keywords

Retrosynthesis
Monte Carlo Tree Search
Multi-objective optimisation
tree edit distance
synthetic complexity

Supplementary weblinks

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.