Abstract
In this paper, we propose parallel heterogeneous metaheuristics (PHM) to solve a kind of epistatic problem (NKLandscape). The main feature of our heterogeneous algorithms is the utilization of multiple search threads using different configurations to guide the search process. We propose an operator-based PHM, where each search thread uses a different combination of recombination and mutation operators. We compare the performance of our heterogeneous proposal against an homogeneous algorithm (multiple threads with the same parameter configuration) in a numerical and real time ways. Our experiments show that the heterogeneity could help to design powerful and robust optimization algorithms on high dimensional landscapes with an additional reduction in execution times.
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.
