engleski

Application of the Chinese Postman Problem in Optimizing the Waste Collecting Routes

In this paper, the possibility of applying Chinese postman problem in finding optimal routes for waste collection is presented. The examples of two cities: city of Split in the Republic of Croatia and city of Yongin in the Republic of Korea are considered. Along with the basic notions of graph theory, heuristic algorithms have been clarified in order to solve the various variants of the Chinese postman problem. In the city areas of Split and Yongin, modeling of the examined areas was done using graphs, after which optimal routes of waste collection were determined both by presented heuristic algorithm and using the CPP module of problem solving software package LogisticsLab.

graph theory, optimization, Chinese postman problem, waste collection routes

nije evidentirano