100 d=4 d=3 4 90 d=2 80 ds=4 dy=5 3 70 5 60 do=5 50 40 30 20 dg=4 10 7 d=2 0 0 10 20 30 40 50 60 70 80 90 100 Graph 1: Customer locations and the depot location. Question 2) (30 points) AgileTA is a long-haul carrier transporting full truck loads. The carrier operates in three cities, A, B and C and prepares transportation plans for the upcoming 4 days. The travel times between cities are given in Table 3. The carrier has to decide the allocation of vehicles based on the information given in Table 4. The carrier makes $500 profit for loaded moves between city pairs (A,B) and (A,C) and $900 between (B,C). Costs of any empty truck moves are: $100 between (A,B), $100 between (A,C) and $200 between (B,C). There is no cost associated for keeping a truck empty in a city. Table 3: Travel times in days) A B C A 0 1 1 B 1 0 2 C 1 2 0 Table 4: Demand and supply information Demand Trucks Entering From To Day Value City Day Value B 1 2 1 2 C B 1 2 1 1 A 3 1 B A 3 2 C B 3 1 TTT a) (20 points) The carrier decides to accept demand #1, demand #4 and half of demand #2. The carrier rejects all other demands. Draw this solution on the time expanded graph. Show the corresponding decision variables and their values. Compute the net total profit (including all profits and the costs) of the carrier. b) (10 points) Consider the transportation plan defined in part a), suggest an improved solution or discuss why the solution cannot be improved