This thesis discusses combinatorial optimization problems, its characteristics and solving methods. Different types of such problems are presented here and I hint at solution using classical heuristical algorithms. In the next part, I focus on artificial neural networks, their description and classification. In the last part, I'm comparing two neural network approaches for solving a travelling salesman problem on several examples.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:193186 |
Date | January 2014 |
Creators | Dvořák, Marek |
Contributors | Zouhar, Jan, Melechovský, Jan |
Publisher | Vysoká škola ekonomická v Praze |
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.0031 seconds