Algoritmos Heurísticos de Cobertura de Arcos

Abstract
In routing problems, the aim is to determine a least cost circuit covering a
specified set of arcs or nodes of a graph, subject to some constraints. There are
two well-known classes of such problems, called as Traveling Salesman Problem
(TSP) and Chinese Postman Problem (CPP). With rare exceptions, all problems
already formulated in these two classes are NP-complete; therefore only
approximate solutions are available for reasonable-sized problems.
In this paper, we consider the problem of determining a least cost circuit
which covers a given subset of arcs, edges and nodes of a mixed graph, subject to
some node restrictions (restrictions that avoid bad turns of vehicles in real-life
street networks). Obviously, the TSP, CPP and the major part of its variations,
such as the Mixed Chinese Postman Problem and the Rural Postman Problem are
particular cases of this general problem. Our solution is based on an efficient
graph transformation that makes it possible to solve the resulting problem as a
standard TSP. Computational results confirm the efficiency of the method for
solving relatively large problems with good solution quality.
Key-words: Arc Routing Problem, Mixed Chinese Postman Problem, CPP, Rural
Postman Problem, RPP, General Routing Problem, GRP, Turn
Penalty, Solid Waste Collection.
6