Hookes-Jeeves-Based Variant of Memetic Algorithm

Hookes-Jeeves-Based Variant of Memetic Algorithm

Dipti Singh (Gautam Buddha University, India) and Kusum Deep (Indian Institute of Technology, Roorkee, India)
DOI: 10.4018/978-1-4666-9885-7.ch004
OnDemand PDF Download:
No Current Special Offers


Due to their wide applicability and easy implementation, Genetic algorithms (GAs) are preferred to solve many optimization problems over other techniques. When a local search (LS) has been included in Genetic algorithms, it is known as Memetic algorithms. In this chapter, a new variant of single-meme Memetic Algorithm is proposed to improve the efficiency of GA. Though GAs are efficient at finding the global optimum solution of nonlinear optimization problems but usually converge slow and sometimes arrive at premature convergence. On the other hand, LS algorithms are fast but are poor global searchers. To exploit the good qualities of both techniques, they are combined in a way that maximum benefits of both the approaches are reaped. It lets the population of individuals evolve using GA and then applies LS to get the optimal solution. To validate our claims, it is tested on five benchmark problems of dimension 10, 30 and 50 and a comparison between GA and MA has been made.
Chapter Preview

Mathematical Form Of Optimization Problems

Different types of practical problems lead to different types of mathematical models for which optimal solutions have to be obtained. The general mathematical formulation of single objective optimization problem is:

  • Minimize (or maximize) 978-1-4666-9885-7.ch004.m01

  • Subject to 978-1-4666-9885-7.ch004.m02 usually defined by


are functions defined on978-1-4666-9885-7.ch004.m06

Complete Chapter List

Search this Book: