Landscape smoothing of numerical permutation spaces in genetic algorithms

  • Authors:
  • Richard Simpson;Ranette Halverson

  • Affiliations:
  • Midwestern State University, Wichita Falls, Texas;Midwestern State University, Wichita Falls, Texas

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recent popularity of genetic algorithms (GA's) and their application to a wide range of problems is a result of their ease of implementation and flexibility. Evolutionary techniques are often applied to optimization and related search problems where the fitness of a possible result is easily established. Although many landscapes are searched quickly, there are those, such as permutation landscapes, that are particularly challenging to the GA approach. This paper suggests an alternative approach, called landscape smoothing, to searching numerical permutation landscapes. This paper demonstrates that this approach is more effective than the usual schemes since it smoothes the original landscape in a way that allows GA exploitation to occur naturally using standard mutation and crossover operators.