Frugal Rent-A-Car has eight store lots in the Greater St. Louis Metropolitan area. At the beginning of each day, they would like to have a predetermined number of cars available at each lot. However, since customers renting a car may return the car to any of the eight lots, the number of cars available at the end of the day does not always equal the designated number of cars needed at the beginning of the day. Frugal would like to redistribute the cars in the lots to meet the minimum demand and minimize the time needed to move the cars.
Table I below, summarizes the results at the end of one particular day.
Table II below summarizes the time required to travel between the lots.
Solve the problem in order to determine how many cars should be transported from one lot to the next. Turn in computer printout along the answers
Table I Lot
Cars 1 2 3 4 5 6 7 8
Available 37 20 14 26 40 28 38 52
Desired 30 25 20 40 30 20 30 60
Table II To (in minutes)
From 1 2 3 4 5 6 7 8
1 -- 12 17 18 10 20 40 35
2 14 -- 10 19 16 15 28 32
3 14 10 -- 12 8 9 34 26
4 8 16 14 -- 12 15 44 38
5 11 21 16 18 -- 10 24 28
6 24 12 9 17 15 -- 36 35
7 38 30 32 40 25 38 -- 29
8 30 34 28 35 31 33 31 --