Skip to main content
Article thumbnail
Location of Repository

Implementation and Visualization of Classic Genetic Algorithm Using Metropolis Algorithm

By Radek Matula

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

Topics: Metropolisovo kritérium; wxWidgets; chromosome; generation; elitism; skript; sed; TSP; Mersenne Twister; Genetický algoritmus; populace; problém obchodního cestujícího; traveling salesman problem; Metropolisův algoritmus; mutation; chromozóm; generace; simulované žíhání; mutace; simulated annealing; metropolis algorith; python; C++; Nicholas Constantine Metropolis; crossover; gen; population; křížení; gene; Genetic algorithm; metoda Monte Carlo; Metropolis criterion; script; elitářský mechanismus; method Monte Carlo
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2007
OAI identifier: oai:invenio.nusl.cz:239273
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.nusl.cz/ntk/nusl-23... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.