Parallel solving of optimization problems on distributed systems by asynchronous differential evolution

From MaRDI portal





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.











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)