|
|
Applications of Ant Algorithms
Kaščák, Imrich ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The presented thesis focuses on the basic optimization algorithm of Ant Colony Optimization (ACO) - Ant System (AS) and its extension, Ant Colony System (ACS) on Traveling Salesman Problem (TSP). The essence of these algorithms is to find the optimal solution (the shortest path) in a specified instance containing several locations. The thesis demonstrates verification of behaviour of both algorithms, experimental study of impact of adjustable parameters of ant algorithms on result. Furthermore, the thesis is focused on examining the idea of optimizing detection of image edges by introducing a modification into an existing solution. Modified solution experiments are performed and compared to the original.
|
|
| |
|
| |
|
|
Applications of Ant Algorithms
Kaščák, Imrich ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
The presented thesis focuses on the basic optimization algorithm of Ant Colony Optimization (ACO) - Ant System (AS) and its extension, Ant Colony System (ACS) on Traveling Salesman Problem (TSP). The essence of these algorithms is to find the optimal solution (the shortest path) in a specified instance containing several locations. The thesis demonstrates verification of behaviour of both algorithms, experimental study of impact of adjustable parameters of ant algorithms on result. Furthermore, the thesis is focused on examining the idea of optimizing detection of image edges by introducing a modification into an existing solution. Modified solution experiments are performed and compared to the original.
|
guest ::
