Randomized heuristics for capacitated arc routing problem

This paper addresses the problem of providing services or goods to the edges of the graph which models the roads or paths of the communication network. The task is to search for a closed path which contains either all edges or a set of desired edges, where the length of the path is minimized. There are many modifications of the problem: postman problem, rural postman problem, windy postman problem, capacitated postman problem. Those tasks have a number of practical applications, such as the optimization of municipal waste collection, route optimization problem for cleaning city streets, reading energy meters, delivery of mail, school bus routes. This article outlines the tasks, models and solution methods.