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.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:400931 |
| Date | January 2019 |
| Creators | Hanek, Petr |
| Contributors | Kubánková, Anna, Šeda, Pavel |
| Publisher | Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds