Premium
A fundamental problem in vehicle routing
Author(s) -
Orloff C. S.
Publication year - 1974
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230040105
Subject(s) - arc routing , routing (electronic design automation) , computer science , mathematical optimization , travelling salesman problem , vehicle routing problem , node (physics) , 2 opt , destination sequenced distance vector routing , limiting , mathematics , link state routing protocol , routing protocol , computer network , engineering , mechanical engineering , structural engineering
An important but difficult combinatorial problem, in general, is to find the optimal route for a single vehicle on a given network. This paper defines a problem type, called the General Routing Problem, and gives an algorithm for its solution. The classical Traveling Salesman Problem and the Chinese Postman Problem are shown to be special limiting cases of the General Routing Problem. The algorithm provides a unified approach to both node and arc oriented routing problems, and exploits special properties of most real transportation networks such as sparsity of the associated adjacency matrix, and the tendency for arc symmetry at many nodes. For node oriented routing problems, this approach tends to produce large reduction in effective problem size.