DocumentCode :
1081235
Title :
Application of Dynamic Programming to Routing Problems
Author :
Jefferis, R.P. ; Fegley, K.A.
Author_Institution :
The Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, Pa.
Volume :
1
Issue :
1
fYear :
1965
Firstpage :
21
Lastpage :
26
Abstract :
Dynamic programming is applicable to routing problems where the objective is to find the route between two points which will minimize some cost function. Although the computational procedure to find the solution to routing problems is more complex than for the majority of dynamic programming problems, solution algorithms are available and can be readily applied. Such an algorithm is presented; and, as an example of routing problems that are readily handled by dynamic programming, the route which minimizes the cost of constructing a pipeline between Fostoria, Ohio, and Columbus, Ohio, is determined.
Keywords :
Cost function; Dynamic programming; Dynamic scheduling; Equations; Functional programming; Interpolation; Pipelines; Routing; Transportation; Weapons;
fLanguage :
English
Journal_Title :
Systems Science and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0536-1567
Type :
jour
DOI :
10.1109/TSSC.1965.300055
Filename :
4082044
Link To Document :
بازگشت