Parallel solving of optimization problems on distributed systems by asynchronous differential evolution (Q2925055)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel solving of optimization problems on distributed systems by asynchronous differential evolution |
scientific article; zbMATH DE number 6359076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel solving of optimization problems on distributed systems by asynchronous differential evolution |
scientific article; zbMATH DE number 6359076 |
Statements
20 October 2014
0 references
parallel computation
0 references
acceleration of convergence
0 references
asynchronous differential evolution
0 references
evolution algorithm
0 references
global minimum
0 references
Parallel solving of optimization problems on distributed systems by asynchronous differential evolution (English)
0 references
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.
0 references
