Thesis Details
Graphical Environment for Genetic Algorithm Demonstrations
This paper was performed during a study stay at the Faculty of Infornation Technology of the Brno University of Technology. This paper studies the implementation of six different user interfaces that helps to the user to solve 6 differents problems, explained in more detailed further, using genetic algorithms. These 6 problems are: "Greatest binary number": finding the greatest binary number of a given length; "TSP": Travelling Salesman Problem; "Greatest sin in a defined interval": finding the element with the biggest sin value; "Most ones followed by one zero": finding the binary number with more couples "10"; "Greatest real number": finding the biggest real number between 0 and 100; "Greatest binary real number": finding the biggest real number specifying total and real lengths.
Artificial Intelligence, Soft Computing, Genetic Algorithm, Java, User Interface.
@mastersthesis{FITMT7082,
author = "Jaime Santos",
type = "Master's thesis",
title = "Graphical Environment for Genetic Algorithm Demonstrations",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2008,
location = "Brno, CZ",
language = "english",
url = "https://www.fit.vut.cz/study/thesis/7082/"
}