Thesis Details

Implementace a vizualizace klasického genetického algoritmu za použití Metropolisova algoritmu

Bachelor's Thesis Student: Matula Radek Academic Year: 2006/2007 Supervisor: Ohlídal Miloš, Ing.
English title
Implementation and Visualization of Classic Genetic Algorithm Using Metropolis Algorithm
Language
Czech
Abstract

This bachelor's thesis contains description of utilisation genetic and Metropolis algorithm to solution the Traveling Salesman Problem (TSP). Thesis describes process of development aplication POC and explains problems with adjusting parameters of algorithm.

Keywords

Genetic algorithm, traveling salesman problem, TSP, metropolis algorith, Nicholas Constantine Metropolis, Metropolis criterion, method Monte Carlo, simulated annealing, wxWidgets, crossover, mutation, population, gene, chromosome, elitism, generation, C++, python, sed, script, Mersenne Twister

Department
Degree Programme
Information Technology
Files
Status
defended, grade D
Date
27 August 2007
Reviewer
Committee
Honzík Jan M., prof. Ing., CSc. (DIFS FIT BUT), předseda
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Motyčka Arnošt, doc. Ing., CSc. (Mendelu), člen
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Citation
MATULA, Radek. Implementace a vizualizace klasického genetického algoritmu za použití Metropolisova algoritmu. Brno, 2007. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-08-27. Supervised by Ohlídal Miloš. Available from: https://www.fit.vut.cz/study/thesis/2707/
BibTeX
@bachelorsthesis{FITBT2707,
    author = "Radek Matula",
    type = "Bachelor's thesis",
    title = "Implementace a vizualizace klasick\'{e}ho genetick\'{e}ho algoritmu za pou\v{z}it\'{i} Metropolisova algoritmu",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2007,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/2707/"
}
Back to top