Return to search

Evoluční algoritmy při řešení problému obchodního cestujícího / Evolutionary Algorithms for the Solution of Travelling Salesman Problem

This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:224447
Date January 2014
CreatorsJurčík, Lukáš
ContributorsBudík, Jan, Dostál, Petr
PublisherVysoké učení technické v Brně. Fakulta podnikatelská
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0019 seconds