A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
نویسندگان
چکیده
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, twodiversitymaintainingmethods, called adaptive dualmapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments. H. Wang (B) · D. Wang School of Information Science and Engineering, Northeastern University, Shenyang 110004, People’s Republic of China e-mail: [email protected] D. Wang e-mail: [email protected] S. Yang Department of Computer Science, University of Leicester, University Road, Leicester LE1 7RH, UK e-mail: [email protected]
منابع مشابه
Memetic Algorithms for Dynamic Optimization Problems
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This chapter investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework o...
متن کاملAn Adaptive Strategy Applied to Memetic Algorithms
Memetic algorithms(MAs) represent one of the promising areas of evolutionary algorithms. However, there are many issues to be solved to design a robust MA. In this paper, we introduce an adaptive memetic algorithm, named GADEDHC, which combines a genetic algorithm and a differential evolution algorithm as global search methods with a directional hill climbing algorithm as local search method. I...
متن کاملA case study of memetic algorithms for constraint optimization
There is a variety of knapsack problems in the literature. Multidimensional 0-1 Knapsack Problem (MKP) is an NP-hard combinatorial optimization problem having many application areas. Many approaches have been proposed for solving this problem. In this paper, an empirical investigation of memetic algorithms (MAs) that hybridize genetic algorithms (GAs) with hill climbing for solving MKPs is prov...
متن کامل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...
متن کاملReal-Coded Memetic Algorithms with Crossover Hill-Climbing
This paper presents a real-coded memetic algorithm that applies a crossover hill-climbing to solutions produced by the genetic operators. On the one hand, the memetic algorithm provides global search (reliability) by means of the promotion of high levels of population diversity. On the other, the crossover hill-climbing exploits the self-adaptive capacity of real-parameter crossover operators w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 13 شماره
صفحات -
تاریخ انتشار 2009