Optimalizace tras pro svoz komunálního odpadu

Abstract

The aim of this thesis is optimize route for waste collection in the Olomouc municipality. The main goal of this thesis is to prepare a suitable route which will decrease total distance in order to keep service operational and effective. The thesis is based on the theoretical knowledge from the fields of operational research, with a focus to mathematical programming and graph theory. The functionality of proposed mathematical models are verified on a set of non-trivial tasks, through computational experiments in the Xpress-IVE environment. In this thesis I performed real computational experiments. Resolute of my findings is to provided the best possible route for the vehicles providing collection of separate waste.

Description

Subject(s)

optimalization, waste collection, mathematical programming, graph theory, mathematical models

Citation