## Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms (1995)

Venue: | Proceedings of the Sixth International Conference on Genetic Algorithms |

Citations: | 204 - 5 self |

### BibTeX

@INPROCEEDINGS{Jones95fitnessdistance,

author = {Terry Jones and Stephanie Forrest},

title = {Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms},

booktitle = {Proceedings of the Sixth International Conference on Genetic Algorithms},

year = {1995},

pages = {184--192},

publisher = {Morgan Kaufmann}

}

### Years of Citing Articles

### OpenURL

### Abstract

A measure of search difficulty, fitness distance correlation (FDC), is introduced and examined in relation to genetic algorithm (GA) performance. In many cases, this correlation can be used to predict the performance of a GA on problems with known global maxima. It correctly classifies easy deceptive problems as easy and difficult non-deceptive problems as difficult, indicates when Gray coding will prove better than binary coding, and is 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. 1 INTRODUCTION A correspondence between evolutionary algorithms and heuristic state space search is developed in (Jones, 1995b). This is based on a model of fitness landscapes as directed, labeled graphs that are closely related to the state spaces employed in heuristic search. We examine one aspect of this correspondence, the relationship between...

### Citations

7363 | Genetic Algorithms - Goldberg - 1989 |

1013 | Origins of order: Self-Organization and selection in evolution - Kauffman - 1993 |

980 | A formal basis for the heuristic determination of minimum cost paths - Hart, Nilsson, et al. - 1968 |

865 | An Analysis of the Behavior of a Class of Genetic Adaptive Systems - Jong - 1975 |

685 |
Heuristics: intelligent search strategies for computer problem solving
- Pearl
- 1985
(Show Context)
Citation Context ...n. In GAs, this function is a fitness function and in heuristic search it is an heuristic function. In heuristic statespace search, there is a large body of work on properties of heuristic functions (=-=Pearl, 1984-=-). A general principle of heuristic functions is that they should correlate well with the distance to the goal of the search, as was suggested as early as 1966 by Doran and Michie (1966). Heuristic se... |

330 | Messy genetic algorithms: motivation, analysis, and � rst results - Goldberg, Deb, et al. - 1989 |

243 | A connectionist machine for genetic hillclimbing - Ackley - 1987 |

200 | The royal road for genetic algorithms: Fitness landscapes and GA performance. In Toward a practice of autonomous systems: proceeding of the first european conference on artificial life - Mitchell, Forrest - 1991 |

168 |
Evolutionary Algorithms, Fitness Landscapes and Search
- Jones
- 1995
(Show Context)
Citation Context ...consequence of an investigation into the connection between GAs and heuristic search. 1 INTRODUCTION A correspondence between evolutionary algorithms and heuristic state space search is developed in (=-=Jones, 1995-=-b). This is based on a model of fitness landscapes as directed, labeled graphs that are closely related to the state spaces employed in heuristic search. We examine one aspect of this correspondence, ... |

143 | Correlated and uncorrelated fitness landscapes and how to tell the difference - Weinberger - 1990 |

125 | Simple genetic algorithms and the minimal, deceptive problem - Goldberg - 1987 |

113 | The genetic algorithm and the structure of the fitness landscape - Manderick, Weger, et al. - 1991 |

109 | A new adaptive multi-start technique for combinatorial global optimizations - Boese, Kahng, et al. - 1994 |

102 | M.: What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation - Forrest, Mitchell - 1993 |

96 | Epistasis variance: A viewpoint on GA-hardness - Davidor - 1990 |

59 | Genetic Algorithms as Function Optimizers - Bethke - 1981 |

58 | Representational issues in genetic optimization - Liepins, Vose - 1990 |

56 | Representation and hidden bias: Gray vs. binary coding for genetic algorithms - Caruana, Schaffer, et al. - 1988 |

56 | Genetic algorithm difficulty and the modality of the fitness landscapes - Horn, Goldberg - 1995 |

56 | Distributed Genetic Algorithms for Function Optimization - Tanese - 1989 |

55 | Subharmonic functions - Radó - 1949 |

53 | Sufficient conditions for deceptive and easy binary functions - Deb, DE - 1994 |

52 | Bit-Climbing, Representational Bias, and Test Suite Design - Davis - 1991 |

38 | Recombination, selection, and the genetic construction of computer programs - Tackett - 1994 |

37 | Cost Versus Distance in the Traveling Salesman Problem - Boese - 1995 |

35 | Experiments with the graph traverser program - Doran, Michie - 1966 |

35 | Genetic algorithms - Forrest - 2004 |

32 |
A description of Holland’s royal road function
- Jones
- 1994
(Show Context)
Citation Context ...consequence of an investigation into the connection between GAs and heuristic search. 1 INTRODUCTION A correspondence between evolutionary algorithms and heuristic state space search is developed in (=-=Jones, 1995-=-b). This is based on a model of fitness landscapes as directed, labeled graphs that are closely related to the state spaces employed in heuristic search. We examine one aspect of this correspondence, ... |

26 |
The only challenging problems are deceptive: Global search by solving order-1 hyperplanes
- Das, Whitley
- 1991
(Show Context)
Citation Context ...ption to GAs is a contentious issue. Conflicting and extreme statements have been made, ranging from claims that deception is the only thing that is important in making a problem hard for a GA (Das & =-=Whitley, 1991-=-), through claims that deception is neither necessary nor sufficient for a problem to be hard for a GA (Grefenstette, 1993), to informal claims that deception is irrelevant to real-world problems. It ... |

20 | Spurious Correlations and Premature Convergence in Genetic Algorithms - Schaffer, Eshelman, et al. - 1991 |

11 | Signal-to-noise, Crosstalk and Long Range Problem Difficulty in Genetic Algorithms - Kargupta - 1995 |

10 | Towards a stronger building-blocks hypothesis: Effects of relative building-block fitness - Forrest, Mitchell - 1993 |

1 |
Deception Considered Harmful. Pages 75--91 of
- Grefenstette
- 1993
(Show Context)
Citation Context ...ption is the only thing that is important in making a problem hard for a GA (Das & Whitley, 1991), through claims that deception is neither necessary nor sufficient for a problem to be hard for a GA (=-=Grefenstette, 1993-=-), to informal claims that deception is irrelevant to real-world problems. It is clear that some deceptive problems are hard but also that there are other factors that cause difficulty for a GA, such ... |

1 | Aug 12). Royal Road Functions. Internet Genetic Algorithms Digest v7n22. Available via ftp from ftp.santafe.edu in pub/terry/jhrr.tar.gz - Holland - 1993 |

1 | Long Path Problems. Pages 149--158 of - Horn, Goldberg - 1994 |

1 | Adaptation on Rugged Fitness Landscapes. Pages 527--618 - Kauffman - 1989 |

1 | Deceptiveness and Genetic Algorithm Dynamics. Pages 36--50 of - Vose - 1991 |