lodging is the same in all. The relative cost of traveling from one town to another is
recorded in Fig. 11. Design the most economical route.
Calculation Procedure:
- Determine the minimum cost of transportation from towns Cl
and C2 to town E
The design will be executed by dynamic programming, which was applied in an earlier
calculation procedure to identity the most lucrative combination of investments. The most
economical route from A to E will be constructed in stages, in reverse order.
The cost of transportation from Cl to E is as follows: for Cl-Dl-E, 14 + 10 = 24; for
C1-D2-E, 15 + 11 = 26; for C1-D3-E, 18 + 13 = 31. Thus, the minimum cost is 24. The
cost of transportation from C2 to E is: for C2-D1-E, 11 + 10 = 21; for C2-D2-E, 19+11 =
30; for C2-D3-E, 16 + 13 = 29. Thus, the minimum cost is 21. Record these minimum
costs and their corresponding towns in district D in Fig. 12; they are the only costs that
are relevant from now on. - Determine the minimum cost of transportation from towns B1,
B2 and B3 to town E
Refer to Fig. 12. The cost of transportation from Bl to E is: for Bl-Cl-E, 12 + 24 = 36;
for B1-C2-E, 11+21= 32. Thus, the minimum cost is 32. The cost of transportation from
B2 to E is: for B2-C1-E, 17 + 24 = 41; for B2-C2-E, 21 + 21 = 42. Thus, the minimum
cost is 41. The cost of transportation from B3 to E is: for B3-C1-E, 10 + 24 = 34; for B3-
District District District
BCDFIGURE 11. Relative cost of transportation between successive stops.