|
|
Optimization of a a route for collecting waste with Traveling Salesman Problem
Trnka, Zdeněk ; Borovička, Adam (advisor) ; Pelikán, Jan (referee)
The Bachelor's dissertation deals with optimization of route designed for collecting communal waste of a company FCC Czech Republic, Ltd. Dissertation search for the most suitable method to solve the real-life example. So formed economic model is to be solved via Traveling Salesman Problem method, whose mathematical model, modifications and solutions options are described in detail in theoretical sections of the dissertation. Exact methods, which are suitable for smaller problem, and heuristic methods, which did not have to give optimal solution, can be used for solving the Traveling Salesman Problem. The Traveling Salesman Problem will be solved here with help of modeling software MPL for Windows. There will be also used two heuristic approaches - Nearest Neighbor algorithm and Savings method. Due to increasing efficiency, a modified Traveling Salesman Problem with Time Windows will be used and solved also through MPL for Windows. To close the dissertation, the result will be summarized and compare firstly among each other and secondly against current company route.
|
guest ::
RSS feed.