Region based memetic algorithm for real-parameter optimisation

نویسندگان

  • Benjamin Lacroix
  • Daniel Molina
  • Francisco Herrera
چکیده

Memetic algorithms with an appropriate trade-off between the exploration and exploitation can obtain very good results in continuous optimisation. That implies the evolutionary algorithm should be focused in exploring the search space while the local search method exploits the achieved solutions. To tackle this issue, we propose to maintain a higher diversity in the evolutionary algorithm's population by including a niching strategy in the memetic algorithm framework. In this work, we design a novel niching strategy where the niches divide the search space into hypercubes of equal size called regions forbidding the presence of two solutions in each region. The objective is to avoid the competition between the local search and the evolutionary algorithm. We tested this niching strategy in a memetic algorithm with local search chaining and obtained significant improvements. The resulting model also appeared to be very competitive with state-of-the-art algorithms. One of the main issues when designing an evolutionary algorithm (EA) [3] for real-coded parameter optimisation problems is to offer a good exploration of the search space and, at the same time, to exploit the most promising regions to obtain high quality solutions. Memetic algorithms (MA) were proposed [34] to manage these competing objectives. They are a hybridisation between EA and local search (LS) algorithms, mixing in one model the exploration power of EA and the exploitative power of the LS. MAs are characterised by the combination of an exploration algorithm and a local improvement algorithm. MAs with an appropriate trade-off between the exploration and exploitation can obtain accurate solutions, improving the search [14,21]. Therefore, the key issue when designing a MA is to organise both efforts in the most cooperative way. Niching strategies have been used in EA to either identify various optima in a fitness landscape or to maintain a strong diversity in the EA's population [13]. In our study, we consider that using niching strategy to maintain a higher diversity in the population leads to a better separation of the effort between the EA and the LS. Thus, we design a niching strategy to limit the competition between the EA and the LS in a MA. The purpose of this method is to let the EA focus on the exploration task by limiting its exploitation power, this task being more efficiently performed by the LS method. Contrarily to most niching strategies where the niches are defined around the solutions of the population, the niches …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Region-based memetic algorithm with archive for multimodal optimisation

In this paper we propose a specially designed memetic algorithm for multimodal optimisation problems. The proposal uses a niching strategy, called region-based niching strategy, that divides the search space in predefined and indexable hypercubes with decreasing size, called regions. This niching technique allows our proposal to keep high diversity in the population, and to keep the most promis...

متن کامل

Memetic Algorithms for Continuous Optimisation Based on Local Search Chains

Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex continuous optimisation problems. There exists a group of continuous local search algorithms that stand out as exceptional local search optimisers. However, on some occasions, they may become very expensive, because of the...

متن کامل

Memetic algorithms based on local search chains for large scale continuous optimisation problems: MA-SSW-Chains

Nowadays, large scale optimisation problems arise as a very interesting field of research, because they appear in many real-world problems (bio-computing, data mining, etc.). Thus, scalability becomes an essential requirement for modern optimisation algorithms. In a previous work, we presented memetic algorithms based on local search chains. Local search chain concerns the idea that, at one sta...

متن کامل

Finding near optimum colour classifiers: genetic algorithm-assisted fuzzy colour contrast fusion using variable colour depth

This thesis presents a complete self-calibrating illumination intensity-invariant colour classification system. We extend a novel fuzzy colour processing technique called Fuzzy Colour Contrast Fusion (FCCF) by combining it with a Heuristicassisted Genetic Algorithm (HAGA) for automatic fine-tuning of colour descriptors. Furthermore, we have improved FCCF’s efficiency by processing colour channe...

متن کامل

A self-adaptive Multimeme Memetic Algorithm co-evolving utility scores to control genetic operators and their parameter settings

Memetic algorithms are a class of well-studied metaheuristics which combine evolutionary algorithms and local search techniques. A meme represents contagious piece of information in an adaptive information sharing system. The canonical memetic algorithm uses a fixed meme, denoting a hill climbing operator, to improve each solution in a population during the evolutionary search process. Given gl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 262  شماره 

صفحات  -

تاریخ انتشار 2014