Year-end Sale % OFF 
Abstract
Metaheuristics, such as evolutionary algorithms (EAs) have been proven to be (also theoretically, see, for example, the works of Michael Vose [1]) universal optimization methods. Previous works (Zbigniew Skolicki and Kenneth De Jong [2]) investigated impact of migration intervals on island models of EA’s in their works. Here we explore different migration intervals and amounts of migrating individuals, complementing Skolicki and DeJong’s research. In our experiments we use different ways of selecting migrants and pave the way for further research, e.g. involving different topologies and neighborhoods. We present the idea of the algorithm, show experimental results.
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: Journal of Automation, Mobile Robotics and Intelligent Systems
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.
