Optimalizace svozové trasy sběrných míst

This bachelor thesis attends to the optimization of separated waste collection routes, the waste is being collected by the company Technické služby VM s.r.o. The solution is carried out according to the salesman's methods with farthest insertion's algorithm. This algorithm provides possible solutions in an interface of two algebraic systems Maple and Bjornson's application. The routes for separated waste collection, which are compared, constitute an output