| Popis: |
This work is focused on problem-solving nondeterministically polynomial (NP) complexity using ant colony optimization. The work is divided into three blocks. The first is approximated aforementioned optimization along with some modifications. The second part focuses on the problems themselves, in this case, the traveling salesman problem (TSP), from which the vehicle routing problem (VRP). The final part of this thesis describes the use of these tools for the collection of separated waste for district of the České Budějovice. |
