Využití Cluster-First Route-Second přístupu pro návrh tras svozu komunálního odpadu

Abstract

The theme of this diploma thesis is planning tours for collection of municipal waste. The main goal is to plan the number of roundabouts for vehicle management on a given real transport network using the Cluster-First Route-Second method. The thesis is based on theoretical knowledge from the field of graphs theory and mathematical programming. The proposed mathematical models are computationally verified on sample examples using the Xpress-IVE program environment. In the next part I preformed calculations on real data. The solution of this experiments is a set of round trips with routes for the vehicles providing collection of waste.

Description

Subject(s)

Cluster-First Route-Second, transport network, waste collection, graphs theory, mathematical programming, Sweep Algorithm, P-median, planning tours

Citation