Abstract
This work introduces a new asynchronous parallel self-adaptive evolution strategy. An asynchronous scheme is chosen because the load on the processors is usually unbalanced. The proposed algorithm is non-blocking leaving no processor idle at any given time. The motivation and theory for the algorithm is based on the author's previous analysis of continuous evolution strategies9 and the reduction of random fluctuation in mutative self-adaptation.7 The algorithm is implemented in C ++ using Posix threads and tested on a number of unimodal and multimodal benchmark problems. The result is an efficient and effective numerical optimization strategy for multi-processor machines.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Intelligence and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
