Asynchronous parallel evolutionary algorithms for constrained optimizations

From MaRDI portal





In 1999, Guo Tao proposed a new population random search algorithm in his PhD thesis to solve function optimization problems. The algorithm is based on the subspace search combined with the population hill-climbing method. The authors give a preliminary theoretical analysis of the algorithm, and present three asynchronous parallel algorithms for shared memory multiprocessor systems and for message passing multicomputer systems.











This page was built for publication: Asynchronous parallel evolutionary algorithms for constrained optimizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712665)