Abstract
Dynamic function optimisation is an important research area because many real-world problems are inherently dynamic in nature. Over the years, a wide variety of algorithms have been proposed to solve dynamic optimisation problems, and many of these algorithms have used the Moving Peaks (MP) benchmark to test their own capabilities against other approaches. This paper presents a detailed account of our hybridised Extremal Optimisation (EO) approach that has achieved hitherto unsurpassed results on the three standardised scenarios of the MP problem. Several different components are used in the hybrid EO, and it has been shown that a large proportion of the quality of its outstanding performance is due to the local search component. In this paper, the behaviour of the local search algorithms used is analysed, and the roles of other components are discussed. In the concluding remarks, the generalisation ability of this method and its wider applicability are highlighted.
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 callDisclaimer: 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.
