Return to search

Implementace problému směrování vozidel pomocí algoritmu mravenčích kolonií a částicových rojů / Implementation of the Vehicle Routing Problem Using the Algorithm of Ant Colonies and Particle Swarms

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.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:400931
Date January 2019
CreatorsHanek, Petr
ContributorsKubánková, Anna, Šeda, Pavel
PublisherVysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0016 seconds