Relevant bibliographies by topics / Mravenčí algoritmy

Contents

  1. Dissertations / Theses

Academic literature on the topic 'Mravenčí algoritmy'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Mravenčí algoritmy.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Dissertations / Theses on the topic "Mravenčí algoritmy"

1

Hart, Pavel. "Mravenčí kolonie." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217700.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Pěnčík, Martin. "Plánování cesty robotu pomocí mravenčích algoritmů." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2014. http://www.nusl.cz/ntk/nusl-231644.

Full text
Abstract:
This thesis deals with robot path planning. It contains an overview of general approaches for path planning and describes methods of swarm intelligence and their application for robot path planning. This paper also contains proposals of adjustments for ant algorithms and it presents experimental results of algorithm implementation.
APA, Harvard, Vancouver, ISO, and other styles
3

Hanek, Petr. "Implementace problému směrování vozidel pomocí algoritmu mravenčích kolonií a částicových rojů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400931.

Full text
Abstract:
This diploma thesis focuses on meta-heuristic algorithms and their ability to solve difficult optimization problems in polynomial time. The thesis describes different kinds of meta-heuristic algorithms such as genetic algorithm, particle swarm optimization or ant colony optimization. The implemented application was written in Java and contains ant colony optimization for capacitated vehicle routing problem and particle swarm optimization which finds the best possible parameters for ant colonies.
APA, Harvard, Vancouver, ISO, and other styles
4

Chu, Andrej. "Metaheuristická metóda mravčej kolónie pri riešení kombinatorických optimalizačných úloh." Doctoral thesis, Vysoká škola ekonomická v Praze, 2005. http://www.nusl.cz/ntk/nusl-76766.

Full text
Abstract:
The Ant Colony Optimization belongs into the metaheuristic methods category and it has been developing quite recently. So far it has shown its capabalities to over-perform other metaheuristic methods in quality of the solutions. This work brings analysis of the possible applications of the method on the classical optimization combinatorial problems -- traveling salesman problem, vehicle routing problem, knapsack problem, generalized assignment problem and maximal clique problem. It also deals with the practical experiments with application on several optimization problems and analysis of the time and memory complexity of such algorithms. The last part of the work is dedicated to the possibility of parallelization of the algorithm, which was result of the application of the ACO method on the traveling salesman problem. It brings analysis of the crucial operations and data synchronization issues, as well as practical example and demonstration of the parallelized version of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Jurčík, Lukáš. "Evoluční algoritmy při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2014. http://www.nusl.cz/ntk/nusl-224447.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

Korgo, Jakub. "Nové aplikace mravenčích algoritmů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385942.

Full text
Abstract:
Ant algorithms have been used for a variety of combinatorial optimization problems. One of these problems, where ant algorithms haven't been used, is the design of transition rules for cellular automata (CA). Which is a problem that this master's thesis is focused on. This work begins with an introduction into ant algorithms and a overview of its applications, followed by an introduction into CA. In the next part the author proposes a way how to encode rules of CA into a graph which is used in ant algorithms. The last part of this thesis contains an application of encoded graph on elitist ant system and MAX-MIN ant system. This is followed by experimental results of creating transition rules for CA problems by these algorithms.
APA, Harvard, Vancouver, ISO, and other styles
7

Zahálka, Jaroslav. "Optimalizace pomocí algoritmů mravenčích kolonií." Master's thesis, Vysoká škola ekonomická v Praze, 2007. http://www.nusl.cz/ntk/nusl-4920.

Full text
Abstract:
This diploma thesis deals with Ant Colony algorithms and their usage for solving Travelling Salesman Problems and Vehicle Routing Problems. These algorithms are metaheuristics offering new approach to solving NP-hard problems. Work begins with a description of the forementioned tasks including ways to tackle them. Next chapter analyses Ant Colony metaheuristic and its possible usage and variations. The most important part of the thesis is practical and is represented by application Ant Colony Optimization Framework. It is easily extensible application written in Java that is able to solve introduced problems. In conclusion this work presents analysis of solutions on test data.
APA, Harvard, Vancouver, ISO, and other styles
8

Sedlák, Václav. "Plánování cesty mobilního robotu pomocí mravenčích algoritmů." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2011. http://www.nusl.cz/ntk/nusl-229515.

Full text
Abstract:
This thesis deals with robot path planning by means of ant colony optimization algorithms. The theoretical part of this thesis introduces basics of path planning problematics. The theoretical part either deals with ant algorithms as optimization and path planning tools. The practical part deals with design and implementation of path planning by means of ant algorithms in Java language.
APA, Harvard, Vancouver, ISO, and other styles
9

Knoflíček, Jakub. "Analýza různých přístupů k řešení optimalizačních úloh." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236207.

Full text
Abstract:
This paper deals with various approaches to solving optimization tasks. In prolog some examples from real life that show the application of optimization methods are given. Then term optimization task is defined and introducing of term fitness function which is common to all optimization methods follows. After that approaches by particle swarm optimization, ant colony optimization, simulated annealing, genetic algorithms and reinforcement learning are theoretically discussed. For testing we are using two discrete (multiple knapsack problem and set cover problem) and two continuous tasks (searching for global minimum of Ackley's and Rastrigin's function) which are presented in next chapter. Description of implementation details follows. For example description of solution representation or how current solutions are changed. Finally, results of measurements are presented. They show optimal settings for parameters of given optimization methods considering test tasks. In the end are given test tasks, which will be used for finding optimal settings of given approaches.
APA, Harvard, Vancouver, ISO, and other styles
10

Horák, Jiří. "Planární antény na substrátech s elektromagnetickými zádržnými pásmy." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-233478.

Full text
Abstract:
Planar antennas are used in several technical applications. The family of planar antennas contains microstrip antennas, which are very popular due to the low weight, low profile, simple manufacturing and easy mass production. Lower gain and excitation of surface waves are disadvantages of microstrip antennas. The propagation of surface waves can be efficiently suppressed if the conventional substrate is replaced by an electromagnetic bandgap (EBG) substrate. Microstrip antennas on EBG substrates have been presented in an open literature for several years. Nevertheless, no published work is devoted to the design of EBG substrates, which can suppress surface waves at several frequencies those cannot be covered by a single bandgap. In order to reach optimum parameters of designed antennas, selected global optimization methods are applied (genetic algorithms, particle swarm optimization, ant colony optimization).
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography