This thesis deals with Canadian traveller problem (CTP), which can be defined as the shortest path problem in a stochastic environment. The overview of different CTP variants is presented in theoretical part of this thesis, as well as known solutions to these variants. In the next parts, the thesis focuses on the stochastic variation of CTP (SCTP). For this variant chosen solutions (strategies) are discussed more in depth. At the same time, the original strategies named UCTO and UCTP are presented. Further, the thesis deals with the description of a window application implemented in Java, which has been developed to validate and test the functionality of selected strategies. The final part contains experiments and comparison of selected strategies.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:320101 |
| Date | January 2017 |
| Creators | Filip, Sebastián |
| Contributors | Matoušek, Radomil, Dvořák, Jiří |
| Publisher | Vysoké učení technické v Brně. Fakulta strojního inženýrství |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0014 seconds