Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Terry Jones and Stephanie Forrest

Working Papers from Santa Fe Institute

Abstract: A measure of search difficulty, fitness distance correlation (FDC), is introduced and its power as a predictor of genetic algorithm (GA) performance is investigated. The sign and magnitude of this correlation can be used to predict the performance of a GA on many problems where the global maxima are already known. FDC can be used to correctly classify easy deceptive problems and easy and difficult non-deceptive problems as difficult, it can be used to indicate when Gray coding will prove better than binary coding, it produces the expected answers when applied to problems over a wide range of apparent difficulty, and it is also consistent with the surprises encountered when GAs were used on the Tanese and royal road functions. The FDC measure is a consequence of an investigation into the connection between GAs and heuristic search.

Date: 1995-02
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:safiwp:95-02-022

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().