Memetic Algorithms and Their Applications in Computer Science

View Sample PDF

Author(s): B. K. Tripathy (VIT University, India), Sooraj T. R. (VIT University, India)and R. K. Mohanty (VIT University, India)
Copyright: 2018
Pages: 21
Source title: Handbook of Research on Modeling, Analysis, and Application of Nature-Inspired Metaheuristic Algorithms
Source Author(s)/Editor(s): Sujata Dash (North Orissa University, India), B.K. Tripathy (VIT University, India)and Atta ur Rahman (University of Dammam, Saudi Arabia)
DOI: 10.4018/978-1-5225-2857-9.ch004

Keywords: Artificial Intelligence / Biologically-Inspired Computing / Information Science Reference / Medicine & Healthcare

Purchase

View Memetic Algorithms and Their Applications in Computer Science on the publisher's website for pricing and purchasing information.

Abstract

The term “memetic algorithm” was introduced by Moscato is an extension of the traditional genetic algorithm. It uses a local search technique to reduce the likelihood of the premature convergence. Memetic algorithms are intrinsically concerned with exploiting all available knowledge about the problem under study. MAs are population-based metaheuristics. In this chapter we explore the applications of memetic algorithms to problems within the domains of image processing, data clustering and Graph coloring, i.e., how we can use the memetic algorithms in graph coloring problems, how it can be used in clustering based problems and how it is useful in image processing. Here, we discuss how these algorithms can be used for optimization problems. We conclude by reinforcing the importance of research on the areas of metaheuristics for optimization.

The IRMA Community

Research IRM

Memetic Algorithms and Their Applications in Computer Science

Purchase

Abstract

Related Content

IRMA Sponsors