## A Transport Improvement Problem Transformable to a Best-path ProblemU.S. Department of Transportation, Transport Systems Planning Division, 1967 - Network analysis (Planning) - 26 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

algorithm as given allocation to i,j applied to N*;A arc i,j arc-simple ascent step begin by solving best-path algorithm best-path problem budget level containing all arcs D(iQ d*-value defined denoted disutility function dynamic programming problem efficient enlarged network N*;A ensemble of problems feasible allocation go to Step horizontal step improved network initial subpath initialize D(j jeN-S L-th layer L-th pass label D(i,u label-correcting algorithm labels D(j last arc layer lower minimum is attained minimum total disutility multiplies the number node ifN node-simple path non-negative integers optimal allocation optimal improvement problem optimization problems origin-destination pair particular node pass through Step path from origin path in N*;A permanent-label algorithm problem P(k,R proper subset reformulated problem repeat Step k sequence of sublists set A(i,j set in Step set p(j single-path solution solving the best-path Step h system-wide improvement terminal subpaths TRANSPORT IMPROVEMENT PROBLEM traversal disutility undefined value of D(j