Abstract
Literature is prolific with metaheuristics for solving continuous optimisation problems. But, in practice, it is difficult to choose one appropriately for several reasons. First and foremost, ‘new’ metaheuristics are being proposed at an alarmingly fast rate, rendering impossible to know them all. Moreover, it is necessary to determine a good enough set of parameters for the selected approach. Hence, this work proposes a strategy based on a hyper-heuristic model powered by Simulated Annealing for customising population-based metaheuristics. Our approach considers search operators from 10 well-known techniques as building blocks for new ones. We test this strategy on 107 continuous benchmark functions and in up to 50 dimensions. Besides, we analyse the performance of our approach under different experimental conditions. The resulting data reveal that it is possible to obtain good-performing metaheuristics with diverse configurations for each case of study and in an automatic fashion. In this way, we validate the potential of the proposed framework for devising metaheuristics that solve continuous optimisation problems with different characteristics, similar to those from practical engineering scenarios.
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.
