Proceedings ArticleDOI
GATutor: a graphical tutorial system for genetic algorithms
Charles Prince,Roger L. Wainwright,Dale A. Schoenefeld,Travis A. Tull +3 more
- Vol. 26, Iss: 1, pp 203-207
TLDR
The design and implementation of GATutor, a graphical tutorial system for genetic algorithms (GA), and the set of help screens that explain, with examples, all of the options for each of the GA parameters are discussed.Abstract:
In this paper we discuss the design and implementation of GATutor, a graphical tutorial system for genetic algorithms (GA). The X Window/Motif system provides powerful tools for the development of a user interfaces with a familiar feel and look. We implemented the Traveling Salesman Problem (TSP) and the Set Covering Problem (SCP) as two example GA problems in the tutorial. The TSP problem uses an order-based chromosome representation (permutation of n objects), while the SCP uses bit strings. The user has numerous buttons to select the GA parameters. These include (a) type of initial population: random or from a file, (b) mode: steady-state or generational, (c) population size, (d) maximum number of generations or trials, (e) generation gap, (f) selection mode, (g) selection bias, (h) selection of the crossover operation from a choice of several possibilities, (i) mutation method, (j) mutation rate, (k) replacement method, (l), elitism, etc. The user has the ability to do astep by step execution or to do a continuous run. The screen layout provides visual representation of the chromosomes in the population with the ability to scroll. This gives the user the option of varying one or two GA parameters to visually see the effect on the algorithm. One of most important features of this tutorial is the set of help screens that explain, with examples, all of the options for each of the GA parameters. This package has already been very useful for teaching the fundamental features of GAs in many different courses, and it has been very valuable in our GA research projects.read more
Citations
More filters
Journal ArticleDOI
Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles
Sancho Salcedo-Sanz,Jose A. Portilla-Figueras,Emilio G. Ortiz-García,Ángel M. Pérez-Bellido,Xin Yao +4 more
TL;DR: It is shown that Japanese puzzles are constrained combinatorial optimization problems, that can be solved using EAs with different encodings, and are challenging problems for EAs.
Proceedings ArticleDOI
The use of animation to explain genetic algorithms
David Jackson,Andrew Fovargue +1 more
TL;DR: The XTANGO software system is used to develop a set of animation sequences designed to illustrate the behaviour of a genetic algorithm applied to a real-world problem that is general enough to be adapted easily to a range of problems.
Proceedings ArticleDOI
Using Java to develop Web based tutorials
TL;DR: This paper presents the use of Java applets acting as a web-based interface to existing, platform dependent software tools, and presents an example application called GAWebTutor which was constructed from a comprehensive genetic algorithm package and web- based Java components.
Cai in cs
TL;DR: The domain of computer science contains a wide range of diverse topics and is divided roughly into the following subdomains, which have a theoretical nature, whereas programming languages, architecture, and operating systems are aimed more at practice.
References
More filters
Book
Genetic algorithms in search, optimization, and machine learning
TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Genetic algorithms in search, optimization and machine learning
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
Book
Handbook of Genetic Algorithms
TL;DR: This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems, and introduces the fundamental genetic algorithm (GA), and shows how the basic technique may be applied to a very simple numerical optimisation problem.
Proceedings ArticleDOI
LibGA: a user-friendly workbench for order-based genetic algorithm research
TL;DR: LibGA offers an easy to use ‘user-friendly’ interface and allows comparisons to be made between both generational and steadystate genetic algorithms for a particular problem and offers the unique new feature of a dynamic generation gap.