ReaxFF Parameter Optimization with Monte-Carlo and Evolutionary Algorithms: Guidelines and Insights
Related Experiment Video
Updated: Jan 5, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Ganna Shchygol1,2, Alexei Yakovlev2, Tomáš Trnka2
1Center for Molecular Modeling (CMM) , Ghent University , Technologiepark-Zwijnaarde 46 , B-9052 Ghent , East Flanders , Belgium.
Abstract:
ReaxFF is a computationally efficient force field to simulate complex reactive dynamics in extended molecular models with diverse chemistries, if reliable force-field parameters are available for the chemistry of interest. If not, they must be optimized by minimizing the error ReaxFF makes on a relevant training set. Because this optimization is far from trivial, many methods, in particular, genetic algorithms (GAs), have been developed to search for the global optimum in parameter space. Recently, two alternative parameter calibration techniques were proposed, that is, Monte-Carlo force field optimizer (MCFF) and covariance matrix adaptation evolutionary strategy (CMA-ES). In this work, CMA-ES, MCFF, and a GA method (OGOLEM) are systematically compared using three training sets from the literature. By repeating optimizations with different random seeds and initial parameter guesses, it is shown that a single optimization run with any of these methods should not be trusted blindly: nonreproducible, poor or premature convergence is a common deficiency. GA shows the smallest risk of getting trapped into a local minimum, whereas CMA-ES is capable of reaching the lowest errors for two-third of the cases, although not systematically. For each method, we provide reasonable default settings, and our analysis offers useful guidelines for their usage in future work. An important side effect impairing parameter optimization is numerical noise. A detailed analysis reveals that it can be reduced, for example, by using exclusively unambiguous geometry optimization in the training set. Even without this noise, many distinct near-optimal parameter vectors can be found, which opens new avenues for improving the training set and detecting overfitting artifacts.
More Related Videos
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Randomized Experiments
Simple randomization
Simple...
Response Surface Methodology
The process of RSM involves several key steps:
Protein Folding Quality Check in the RER
Thermal expansion and Thermal stress: Problem Solving
To solve the problem, first, identify the known and unknown quantities. The initial length (L) of the bridge is 1275 m, the coefficient of linear expansion (α) for steel is 12 x 10-6/°C, and the change in temperature (ΔT) is 55...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility

