Objective of this thesis is optimalization of route for inspectory technician. There were described traveling Salesman problem, vehicle Routing problem and it's modifications. Problem was solved by this three heuristics: nearest neighbour algorithm, savings method and insert method.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:10538 |
| Date | January 2008 |
| Creators | Rusín, Michal |
| Contributors | Fábry, Jan, Pelikán, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| 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.0019 seconds