Thesis Details
Problém obchodního cestujícího
This thesis is focused on modification of known principles ACO and GA to increase their performance. Thesis includes two new principles to solve TSP. One of them can be used as an initial population generator. The appendix contains the implementation of the application in Java. The description of this application is also part of the thesis. One part is devoted to optimization in order to make methods more efficient and produce shorter paths. In the end of the thesis are described experiments and their results with different number of places from 101 up to 3891.
ACO, GA, Ant Colony Optimization, Genetic Algorithm, TSP, Travelling Salesman Problem, GA Optimization, Initial Population for GA, Deterministic solution for TSP
Burget Lukáš, doc. Ing., Ph.D. (DCGM FIT BUT), člen
Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT), člen
Křivka Zbyněk, Ing., Ph.D. (DIFS FIT BUT), člen
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS FIT BUT), člen
@bachelorsthesis{FITBT17732, author = "Martin \v{S}\r{u}stek", type = "Bachelor's thesis", title = "Probl\'{e}m obchodn\'{i}ho cestuj\'{i}c\'{i}ho", school = "Brno University of Technology, Faculty of Information Technology", year = 2015, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/17732/" }