Upload your study docs or become a

Course Hero member to access this document

**Unformatted text preview: **Antonio and Denver. Joe knows that after one day of driving he can reach Kansas City,Omaha or Dallas and after 2 days he can arrive at San Antonio or Denver. Finally, after 3 days he can be at Los Angeles. Joe has to decide at which cities he should stay in order to minimize the total distance traveled. The corresponding network is shown on the following figure. A network example General form of a dynamic program Forward formulation • We begin by finding the shortest route from the origin city to each of the cities of stage 2. Then, we use this information to find the shortest path from the origin city to each of the cities of stage 3. This information is then used to find the shortest path from the origin city to the destination city. The idea is to solve, at each iteration, an easy problem which helps to solve a more complex problem. Forward recursion: Forward recursion: Forward recursion: General Forward formulation...

View
Full Document