The thesis deals with application of models of routing problems on a real problem, beer distribution in Jesenicko region provided by Viden plus, a.s. The goal of the thesis is to optimize daily distributional routes for two vehicles with different capacities. Total distance has to be minimized respecting time and capacity limits. In case the optimal solution is not found, sub-optimal solution will be accepted. Solutions are calculated with use of the optimization software LINGO and some heuristic methods. Models of travelling salesman problem and vehicle routing problem are used to find the solutions. Results are compared to the current state of distributional routes in conclusion of the thesis.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:124608 |
| Date | January 2012 |
| Creators | Krčmář, Pavel |
| Contributors | Fábry, Jan, Suchánková, Tereza |
| 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.0022 seconds