Application of Dynamic Programming to Routing Problems
- 1 January 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems Science and Cybernetics
- Vol. 1 (1) , 21-26
- https://doi.org/10.1109/TSSC.1965.300055
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
This publication has 3 references indexed in Scilit:
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962
- Adaptive Control ProcessesPublished by Walter de Gruyter GmbH ,1961
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961