This work deals with traveling salesman problem (TSP) and examines it’s possibilities to use in business. It is about the optimization of the travel cost, saving time and unnecessary mileage. Part of the work is a program with a GUI written in program MATLAB. Program uses neural networks to calculate the most effective path between places, where the trader has to reach. It’s possible to use the algorithm for many purposes, e.g. distribution of goods, store management, planning of PCBs or rescue services. Program communicates with the Google Maps API server, which provides the actual information of the path.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:234840 |
| Date | January 2016 |
| Creators | Matus, Gabriel |
| Contributors | Doskočil, Radek, Dostál, Petr |
| Publisher | Vysoké učení technické v Brně. Fakulta podnikatelská |
| 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.0017 seconds