Parallel solving of optimization problems on distributed systems by asynchronous differential evolution
Asynchronous differential evolution (ADE) is an evolution algorithm of the global minimum search for real functions. The algorithm is effective with increasing of a population size in the case when stagnation or degeneracy of the population is determined. It is known that a restart of the algorithm often lets to approach the convergence probability to unity. Here, the comparison of convergence and acceleration in parallel calculations of the ADE algorithm with the restart and a standard differential evolution algorithm with the restart is presented.
- A study on efficient asynchronous parallel multi-objective evolutionary algorithm with waiting time limitation
- Investigations on distributed differential evolution framework with fault tolerance mechanisms
- An asynchronous parallel evolutionary algorithm for solving large instances of the multi-objective QAP
- Distributed evolutionary optimization using Nash games and GPUs -- applications to CFD design problems
- Asynchronous parallel evolutionary algorithms for constrained optimizations
- Numerical analysis of SAXS-data from vesicular systems by asynchronous differential evolution method
- Hierarchical topology in parallel differential evolution
- Comparison of asynchronous particle swarm optimization and dynamic differential evolution for partially immersed conductor
- Asynchronous differential evolution with restart
- Asynchronous Differential Evolution
- scientific article; zbMATH DE number 1941949 (Why is no real title available?)
- scientific article; zbMATH DE number 2040835 (Why is no real title available?)
This page was built for publication: Parallel solving of optimization problems on distributed systems by asynchronous differential evolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925055)