Balancing exploration and exploitation in memetic algorithms: A learning automata approach

Abstract

One of the problems with traditional genetic algorithms (GAs) is premature convergence, which makes them incapable of finding good solutions to the problem. The memetic algorithm (MA) is an extension of the GA. It uses a local search method to either accelerate the discovery of good solutions, for which evolution alone would take too long to discover, or reach solutions that would otherwise be unreachable by evolution or a local search method alone. In this paper, we introduce a new algorithm based on learning automata (LAs) and an MA, and we refer to it as LA‐MA. This algorithm is composed of 2 parts: a genetic section and a memetic section. Evolution is performed in the genetic section, and local search is performed in the memetic section. The basic idea of LA‐MA is to use LAs during the process of searching for solutions in order to create a balance between exploration performed by evolution and exploitation performed by local search. For this purpose, we present a criterion for the estimation of success of the local search at each generation. This criterion is used to calculate the probability of applying the local search to each chromosome. We show that in practice, the proposed probabilistic measure can be estimated reliably. On the basis of the relationship between the genetic section and the memetic section, 3 versions of LA‐MA are introduced. LLA‐MA behaves according to the Lamarckian learning model, BLA‐MA behaves according to the Baldwinian learning model, and HLA‐MA behaves according to both the Baldwinian and Lamarckian learning models. To evaluate the efficiency of these algorithms, they have been used to solve the graph isomorphism problem. The results of computer experimentations have shown that all the proposed algorithms outperform the existing algorithms in terms of quality of solution and rate of convergence.

Analysis of Binding Modes between Three Perfluorosulfonates and GPER Based on Computational Simulation and Multiple Spectral Methods

“…The docking grid was set to dimensions of 60 Å × 60 Å × 60 Å with a grid spacing of 0.375 Å for site-specific docking (cavity). To obtain multiple conformations, the Lamarckian genetic algorithm [19] was utilized, simulating 20 different conformations over 25,000,000 steps. Molecular dynamics simulation: Firstly, the small molecule ligands optimized by Gaussian 16 software were converted to the required file format through an online conversion website http://davapc1.bioch.dundee.ac.uk/cgi-bin/prodrg (Accessed on 24 March 2018) [20].…”

A Modified Memetic Algorithm with an Application to Gene Selection in a Sheep Body Weight Study

“…However, GA lacks exploitation capability [ 18 ]; this means that GA cannot obtain the core subset of genes. Therefore, local search is incorporated into GA to enhance exploitation capability, and Memetic Algorithm (MA) is proposed [ 19 ].…”

An improved memetic genetic algorithm based on a complex network as a solution to the traveling salesman problem

“…The goal of exploration is to ensure that a search is global and the goal of exploitation is to find best solution around a single solution. This is a kind of local search in which the goal of the memetic algorithm is to create a balance between the two concepts [14]. The basic GA has good exploration abilities because its basis is global when finding solutions.…”