|
|
The global optimalization methods
Dudová, Aneta ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This bachelor work is dedicated to advanced methods of global optimization, and especially problem traveling salesman. It focuses on the description of the problem and its various options, including graph theory, heuristic algorithms, evolutionary algorithms, in which mainly genetic algorithms and optimization by ant colonies. In conclusion, the implementation of these methods and performed testing on different data sets of algorithms that approximately solve the traveling salesman problem.
|
|
|
Evolutionary algorithms for global optimization problem solving
Dragon, Ondřej ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This work is devoded to evolutionary algorithms and solution of global optimization problems, mainly the traveling salesman problem. The traveling salesman problem is analyzed in detail as well as its methods of solution, such as: graph theory, heuristics and evolutionary algorithms. The main optimization method of this work is a Inver - over operator. In conclusion are implemented selected methods and performed testing and evaluation of the individual data sets.
|
|
|
Evolutionary algorithms for global optimization problem solving
Dragon, Ondřej ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This work is devoded to evolutionary algorithms and solution of global optimization problems, mainly the traveling salesman problem. The traveling salesman problem is analyzed in detail as well as its methods of solution, such as: graph theory, heuristics and evolutionary algorithms. The main optimization method of this work is a Inver - over operator. In conclusion are implemented selected methods and performed testing and evaluation of the individual data sets.
|
|
|
The global optimalization methods
Dudová, Aneta ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This bachelor work is dedicated to advanced methods of global optimization, and especially problem traveling salesman. It focuses on the description of the problem and its various options, including graph theory, heuristic algorithms, evolutionary algorithms, in which mainly genetic algorithms and optimization by ant colonies. In conclusion, the implementation of these methods and performed testing on different data sets of algorithms that approximately solve the traveling salesman problem.
|
guest ::
