|
|
Application of ACO to simple subsitution ciphers
Turek, Luboš ; Tůma, Jiří (advisor) ; Surynek, Pavel (referee)
Název práce: Použití ACO algoritmu na řešení jednoduché substituční šifry Autor: Luboš Turek Katedra (ústav): Katedra algebry Vedoucí bakalářské práce: doc. RNDr. Jiří Tůma, DrSc. e-mail vedoucího: jiri.tuma@mff.cuni.cz Abstrakt: V předložené práci studujeme kombinatorickou metaheuristiku Ant Colony Optimization a zkoumáme možné způsoby jejího použití k pro- lomení jednoduché substituční šifry. Součástí práce je návrh a implementace programu. Tento program je srovnán s genetickým algoritmem. Klíčová slova: jednoduchá substituční šifra, ant colony optimization, ACO, kryptologie, kryptografie Title: Application of ACO to simple subsitution ciphers Author: Luboš Turek Department: Department of Algebra Supervisor: doc. RNDr. Jiří Tůma, DrSc. Supervisor's e-mail address: jiri.tuma@mff.cuni.cz Abstract: In the present work we study combinatorial metaheuristic Ant Colony Optimization and we search for its application to the problem of cracking simple subtitution cipher. Functional implementation is a part of the thesis. The program is compared to genetic algorithm. Keywords: simple substitution cipher, ant colony optimization, ACO, cryp- tology, cryptography 6
|
|
|
Acceleration of Discrete Optimization Heuristics Using GPU
Pecháček, Václav ; Jaroš, Jiří (referee) ; Pospíchal, Petr (advisor)
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions by means of heuristics and parallel processing. Based on ant colony optimization (ACO) algorithm coupled with k-optimization local search approach, it aims at massively parallel computing on graphics processors provided by Nvidia CUDA platform. Well-known travelling salesman problem (TSP) is used as a case study. Solution is based on dividing task into subproblems using tour-based partitioning, parallel processing of distinct parts and their consecutive recombination. Provided parallel code can perform computation more than seventeen times faster than the sequential version.
|
|
|
Traveling Salesman Problem
Šůstek, Martin ; Snášelová, Petra (referee) ; Zbořil, František (advisor)
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.
|
|
|
Ant colony
Hart, Pavel ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.
|
guest ::
