GAVEL - a new tool for genetic algorithm visualization

This paper surveys the state of the art in evolutionary algorithm visualization and describes a new tool called GAVEL. It provides a means to examine in a genetic algorithm (GA) how crossover and mutation operations assembled the final result, where each of the alleles came from, and a way to trace...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on evolutionary computation Vol. 5; no. 4; pp. 335 - 348
Main Authors Hart, E., Ross, P.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.08.2001
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN1089-778X
1941-0026
DOI10.1109/4235.942528

Cover

More Information
Summary:This paper surveys the state of the art in evolutionary algorithm visualization and describes a new tool called GAVEL. It provides a means to examine in a genetic algorithm (GA) how crossover and mutation operations assembled the final result, where each of the alleles came from, and a way to trace the history of user-selected sets of alleles. A visualization tool of this kind can be very useful in choosing operators and parameters and in analyzing how and, indeed, whether or not a GA works. We describe the new tool and illustrate some of the benefits that can be gained from using it with reference to three different problems: a timetabling problem, a job-shop scheduling problem, and Goldberg and Horn's long-path problem. We also compare the tool to other available visualization tools, pointing out those features which are novel and identifying complementary features in other tools.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-778X
1941-0026
DOI:10.1109/4235.942528