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.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:224447 |
Date | January 2014 |
Creators | Jurčík, Lukáš |
Contributors | Budík, Jan, Dostál, Petr |
Publisher | Vysoké učení technické v Brně. Fakulta podnikatelská |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.4166 seconds