Finding global minima with a new dynamical evolutionary algorithm.
From MaRDI portal
Based on the theory of statistic mechanics, the algorithm proposed in this paper attempts to improve selecting strategies and to activate all individuals to a great extend along with their population evolving, by introducing momentum and activity simulating the molecular kinetic theory to get a selection strategy which drives particles moving and searching every time and everywhere.
Recommendations
- An efficient dynamical evolutionary algorithm for global optimization
- A new dynamical evolutionary algorithm based on statistical mechanics
- Global optimization by an improved differential evolutionary algorithm
- A multi-start global minimization algorithm with dynamic search trajectories
- scientific article; zbMATH DE number 1795720
Cites work
- A filled function method for finding a global minimizer of a function of several variables
- A new evolutionary algorithm for function optimization
- A radial basis function method for global optimization
- Combining Richardson's equations with canard explosion theory in a genetic algorithm to predict instabilities in the India/Pakistan arms race
- scientific article; zbMATH DE number 1160035 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- The globally convexized filled functions for global optimization
Cited in
(3)
This page was built for publication: Finding global minima with a new dynamical evolutionary algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789543)