Diversity is crucial for metaheuristic algorithms. It prevents early convergence, balances exploration and exploitation, and helps to avoid local optima. Traditional metaheuristic algorithms tend to rely on a single strategy for generating new solutions, often resulting in a lack of diversity. In contrast, employing multiple strategies encourages a variety of search behaviors and a diverse pool of potential solutions, thereby improving the exploration of the search space. Evolutionary Game Theory (EGT) modifies agents’ strategies through competition, promoting successful strategies and eliminating weaker ones. Structured populations, as opposed to unstructured ones, preserve diverse strategies through localized competition, meaning that an individual’s strategy is influenced by only a subset or group of the population and not all elements. This paper presents a novel metaheuristic method based on EGT applied to structured populations. Initially, individuals are positioned near optimal regions using the Metropolis–Hastings algorithm. Subsequently, each individual is endowed with a unique search strategy. Considering a certain number of clusters, the complete population is segmented. Within these clusters, the method enhances search efficiency and solution quality by adapting all strategies through an intra-cluster competition. To assess the effectiveness of the proposed method, it has been compared against several well-known metaheuristic algorithms across a suite of 30 test functions. The results indicated that the new methodology outperformed the established techniques, delivering higher-quality solutions and faster convergence rates.
Read full abstract