National Repository of Grey Literature 4 records found  Search took 0.00 seconds. 
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.
Evolutionary Algorithms for the Solution of Travelling Salesman Problem
Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor)
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.
Evolutionary Algorithms for the Solution of Travelling Salesman Problem
Jurčík, Lukáš ; Budík, Jan (referee) ; Dostál, Petr (advisor)
This diploma thesis deals with evolutionary algorithms used for travelling salesman problem (TSP). In the first section, there are theoretical foundations of a graph theory and computational complexity theory. Next section contains a description of chosen optimization algorithms. The aim of the diploma thesis is to implement an application that solve TSP using evolutionary algorithms.
Genetic Algorithms
Miček, David ; Pohl, Jan (referee) ; Honzík, Petr (advisor)
This thesis presents description of Genetic algorithm. The description begins with theory of complexity and following basic theory of genetic algorithm. Next part explains the principle of all three tasks – travelling salesman problem, knapsack problem and evolution of algorithm for five-in-a-row. The main focus was on developing the algorithm for five-in-a-row. The results were tested with other similar algorithms from internet. In case of travelling salesman problem and knapsack problem, the results were compared with gradient optimization methods.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.