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
ReaxFF Parameter Optimization with Monte-Carlo and Evolutionary Algorithms: Guidelines and Insights.
Ganna Shchygol1,2, Alexei Yakovlev2, Tomáš Trnka2
1Center for Molecular Modeling (CMM) , Ghent University , Technologiepark-Zwijnaarde 46 , B-9052 Ghent , East Flanders , Belgium.
Optimizing ReaxFF force-field parameters is challenging. This study compares genetic algorithms (GAs), MCFF, and CMA-ES, finding CMA-ES often yields lower errors but GA has less risk of local minima. Careful optimization and noise reduction are crucial.
Area of Science:
- Computational Chemistry
- Materials Science
- Chemical Engineering
Background:
- ReaxFF is a computationally efficient force field for simulating reactive dynamics.
- Optimizing ReaxFF parameters is critical for accuracy but challenging.
- Existing methods like genetic algorithms (GAs) aim to find optimal parameters in a complex search space.
Purpose of the Study:
- To systematically compare the performance of three parameter optimization methods: GA (OGOLEM), Monte-Carlo Force Field Optimizer (MCFF), and Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES).
- To evaluate the reproducibility and convergence behavior of these methods.
- To provide guidelines for selecting and using these optimization techniques.
Main Methods:
- Systematic comparison of OGOLEM (GA), MCFF, and CMA-ES using three literature training sets.
- Repetition of optimizations with varied random seeds and initial parameter guesses to assess reproducibility.
- Analysis of numerical noise impact and strategies for its reduction, such as using unambiguous geometry optimizations.
Main Results:
- No single optimization run should be trusted blindly due to common issues like irreproducibility, poor convergence, or premature convergence.
- GA methods demonstrate the lowest risk of getting trapped in local minima.
- CMA-ES achieved the lowest errors in two-thirds of the cases, though not consistently.
- Numerical noise can be reduced by using unambiguous geometry optimizations.
- Multiple near-optimal parameter sets can be found, suggesting avenues for training set improvement and overfitting detection.
Conclusions:
- CMA-ES and GA offer distinct advantages in ReaxFF parameter optimization, with CMA-ES often reaching lower errors and GA providing more robust convergence.
- Careful consideration of optimization strategies, including reproducibility checks and noise reduction, is essential for reliable ReaxFF parameter development.
- The findings offer practical guidelines for researchers using these methods and highlight the potential for improved training set design and overfitting detection.
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

