Return to search

Hledání nejkratší cesty pomocí mravenčích kolonií - Java implementace / Ant Colony Optimization Algorithms for Shortest Path Problems - Java implementation

This diploma thesis deals with ant colony optimization for shortest path problems. In the theoretical part it describes Ant Colony Optimization. In the practical part ant colony optimization algorithms are selected for the design and implementation of shortest path problems in the Java.

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:231155
Date January 2014
CreatorsDostál, Marek
ContributorsMiškařík, Kamil, Matoušek, Radomil
PublisherVysoké učení technické v Brně. Fakulta strojního inženýrství
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0018 seconds