The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Memetic Algorithms and Their Applications in Computer Science
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.
Related Content
|
Aswathy Ravikumar, Harini Sriraman.
© 2023.
18 pages.
|
|
Ezhilarasie R., Aishwarya N., Subramani V., Umamakeswari A..
© 2023.
10 pages.
|
|
Sangeetha J..
© 2023.
13 pages.
|
|
Manivannan Doraipandian, Sriram J., Yathishan D., Palanivel S..
© 2023.
14 pages.
|
|
T. Kavitha, Malini S., Senbagavalli G..
© 2023.
36 pages.
|
|
Uma K. V., Aakash V., Deisy C..
© 2023.
23 pages.
|
|
Alageswaran Ramaiah, Arun K. S., Yathishan D., Sriram J., Palanivel S..
© 2023.
17 pages.
|
|
|