This thesis deals with the Travelling salesman problem with time windows. The problem is that the travelling salesman must pass through each defined location exactly once and finally return to the original place for the lowest possible price. The time windows in this problem are that each place can only be visited in a given time range, or it can happen that in a certain period of time there will be no path between some places. The thesis deals with an overview of this problem and problems similar to it. It also deals with the description of various methods by which this problem can be solved. As part of this thesis, an application in the Python programming language was also created, which is used to test selected methods for finding solutions. Finally, the given experiments are evaluated and the effectiveness of the given strategies is compared.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:442819 |
| Date | January 2021 |
| Creators | Pavlovič, Dávid |
| Contributors | Šoustek, Petr, Dvořák, Jiří |
| Publisher | Vysoké učení technické v Brně. Fakulta strojního inženýrství |
| Source Sets | Czech ETDs |
| Language | Slovak |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.01 seconds