Využití matematického programování pro řešení trasovacích úloh

Abstract

The Master‘s Thesis specifically deals with problems of routing tasks optimization. The aim is to design routes for service vehicles of the Olomouc City Technical Services, a.s., which handles the collection of separated waste at the required criterion of total distance minimization and associated costs. In addition to the introduction and conclusion, the structure of the thesis is divided into three parts. First, the problem is defined, then the Thesis continues with the theoretical basis introduction. The knowledge of graph theory, routing tasks, and mathematical programming are used. In the following part mathematical models are compiled and optimization calculations realized. The theory and problematics of routing tasks are presented together with mathematical models validation and verification. The following describes the preparation of input data in a format compatible with Xpress-IVE, in which all work calculations are carried out. The Master‘s thesis ends with economic interpretation and evaluation of optimization results. In the end, the costs and savings of optimized routes are calculated on the basis of frequencies data and expected fuel prices from the CNB forecasts for the following two years.