Metaheuristic optimization with dynamic strategy adaptation: An evolutionary game theory approach

Abstract

Most metaheuristic methods employ a strategy designed to be generical and fixed. As a result, these methods often lack the capability to adaptively modify their performance in response to different scenarios or challenges encountered during the search process. This paper presents a new metaheuristic algorithm designed to dynamically adjust its search strategy throughout the optimization process for increased efficiency. This algorithm is based on Evolutionary Strategies (ES) due to their notable self-adaptive features. To further enhance its efficiency, we have incorporated elements from Evolutionary Game Theory (EGT). This integration ensures a more comprehensive strategy adaptation process, taking into account not only the information from the specific agent but also insights from other population members. Additionally, our approach alters the conventional EGT mechanism by including not just pairwise evaluations but also data from the top-performing individuals in the population, based on their outcomes. This broader adaptation strategy allows for a faster convergence to the most effective dominant strategy. To demonstrate the effectiveness of our method, we compared it against several established metaheuristic algorithms using 28 diverse test functions. Our findings reveal that this approach produces competitive results, delivering higher-quality solutions and faster convergence rates.