| Article ID: | iaor20041735 |
| Country: | United Kingdom |
| Volume: | 54 |
| Issue: | 8 |
| Start Page Number: | 906 |
| End Page Number: | 910 |
| Publication Date: | Aug 2003 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte G., Blais M. |
| Keywords: | vehicle routing & scheduling |
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.