Showing papers on "Dynamic Source Routing published in 1974"

A fundamental problem in vehicle routing

Abstract: 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.

Optimal Routing in a Packet-Switched Computer Network

Abstract: The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.

Routing a fleet of M vehicles to/from a central facility

Abstract: In a previous paper, algorithms for optimally routing a single vehicle were presented. In this paper, the problem of routing a fleet of M vehicles serving fixed demand for transportation from many origins to a single destination is considered. The M vehicle General Routing Problem (abbreviated M-GRP) is the core of many real routing problems, such as school bus routing for a single school (many-to-one) and garbage truck routing to a central dump. It is shown that the M-GRP on a given graph is equivalent to a GRP on a modified graph. From this result, it is shown that single vehicle routing algorithms can be applied to the M vehicle routing problem.