Optimalizace pomoci kolonií mravenců
Loading...
Downloads
4
Date issued
Authors
Vašata, Jan
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
ACO deals with solving the combinatorial problem by using ants behavior in nature. More precisely, to search the shortest paths in graphs using pheromone. ACO algorithms are heuristic ones.We have never any guarantee that we get the best possible result. This technique is useful for example for solving the traveling-salesman problem. This work considers with the implementation of the ACO algorithm.
Description
Import 29/09/2010
Subject(s)
ACO, TSP, optimization, bio-inspired computing