×

Exact solution of the generalized routing problem through graph transformations. (English) Zbl 1095.90522

Summary: In the general routing problem, the aim is to determine a least cost traversal of a subset of edges, arcs and vertices of a graph. The problem can be transformed into an equivalent traveling salesman problem or rural postman problem and solved optimally. Computational results are reported.

MSC:

90B20 Traffic problems in operations research

Software:

CDT
PDFBibTeX XMLCite
Full Text: DOI