A Study on the use of "self-generation'' in memetic algorithms

  • Authors:
  • Natalio Krasnogor;Steven Gustafson

  • Affiliations:
  • Automated Scheduling, Optimization and Planning Group, School of Computer Science and IT, University of Nottingham, Nottingham NG8 1BB, UK (E-mail: nxk@cs.nott.ac.uk);Automated Scheduling, Optimization and Planning Group, School of Computer Science and IT, University of Nottingham, Nottingham NG8 1BB, UK (E-mail: smg@cs.nott.ac.uk)

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A vast number of very successful applications of Global-Local Search Hybrids have been reported in the literature in the last years for a wide range of problem domains. The majority of these papers report the combination of highly specialized pre-existing local searchers and usually purpose-specific global operators (e.g. genetic operators in an Evolutionary Algorithm).In this paper we concentrate on one particular class of Global-Local Search Hybrids, Memetic Algorithms (MAs), and we describe the implementation of ``self-generating'' mechanisms to produce the local searches the MA uses. This implementation is tested in two problems, NK-Landscape Problems and the Maximum Contact Map Overlap Problem (MAX-CMO).