you are finding the budget.

page 41. is included at the bottom as the future state table

Problem 2. Find the first year and the steady-state budget of a highway agency with a 2,200 lane-mile road network using the Markov decision process. Initially, 20% of the network is in good condition, 50% in fair condition, and 30% in poor condition. The following data are given: 1. Condition States: 2. Alternative Maintenance Actions (a) Good (b) Fair (c) Poor (i) Do nothing (routine maintenance) (ii) Seal coat (iii) 2" overlay 3. Maintenance Policies: Condition state (a) always gets action (i) Condition state (b) always gets action (ii) Condition state (c) always gets action (iii) 4. Transition probabilities (your pick must be reasonable): Look at page 41 of Lecture 9 for transition probabilities. Action Good Fair Poor Good Do Nothing Fair Poor Seal Coat Good Fair Poor Good 2" overlay Fair Poor Show all (or a typical set, if using a spreadsheet) calculations. 5. Action Costs: Condition State Action One-time action cost, $/lane-mile Annual routine maint. cost, $/lane-mile Annual user cost, $/lane- mile Total cost, $/lane-mile Good Do nothing 0 2,500 2,500 Fair Seal coat 5,000 200 5,200 Poor 2"overlay 15,000 75 15,075 Future Condition State Initial Condition State 1 2 3 to 6 7 7 8 9 45 0.03 0.01 1 0.90 0.04 0.02 0 0 0 0 2 0.01 0.90 0.03 0 0.05 0.01 0 0 0 3 0 0.01 0.920 0.01 0.01 0.02 0.030 0.020 4 0 0 0 0.92 0.05 0.010 0.070 5 0 0 0 0.01 0.94 0.03 0.01 6 C 0 0 0 0.01 0.94 0 0.01 0.04 7 0 0 0 0.02 0 0.95 0.02 0.01 8 0 0 0 0 0 0.01 0.96 0.03 9 0 0 0 0 0.01 on to die 0,01 0.98 Problem 2. Find the first year and the steady-state budget of a highway agency with a 2,200 lane-mile road network using the Markov decision process. Initially, 20% of the network is in good condition, 50% in fair condition, and 30% in poor condition. The following data are given: 1. Condition States: 2. Alternative Maintenance Actions (a) Good (b) Fair (c) Poor (i) Do nothing (routine maintenance) (ii) Seal coat (iii) 2" overlay 3. Maintenance Policies: Condition state (a) always gets action (i) Condition state (b) always gets action (ii) Condition state (c) always gets action (iii) 4. Transition probabilities (your pick must be reasonable): Look at page 41 of Lecture 9 for transition probabilities. Action Good Fair Poor Good Do Nothing Fair Poor Seal Coat Good Fair Poor Good 2" overlay Fair Poor Show all (or a typical set, if using a spreadsheet) calculations. 5. Action Costs: Condition State Action One-time action cost, $/lane-mile Annual routine maint. cost, $/lane-mile Annual user cost, $/lane- mile Total cost, $/lane-mile Good Do nothing 0 2,500 2,500 Fair Seal coat 5,000 200 5,200 Poor 2"overlay 15,000 75 15,075 Future Condition State Initial Condition State 1 2 3 to 6 7 7 8 9 45 0.03 0.01 1 0.90 0.04 0.02 0 0 0 0 2 0.01 0.90 0.03 0 0.05 0.01 0 0 0 3 0 0.01 0.920 0.01 0.01 0.02 0.030 0.020 4 0 0 0 0.92 0.05 0.010 0.070 5 0 0 0 0.01 0.94 0.03 0.01 6 C 0 0 0 0.01 0.94 0 0.01 0.04 7 0 0 0 0.02 0 0.95 0.02 0.01 8 0 0 0 0 0 0.01 0.96 0.03 9 0 0 0 0 0.01 on to die 0,01 0.98