Question 2 (14 points)

Question 2 options:Below is a table of times for Taxis (A to H) to reach Customers (1 to 8) who need a ride home after a night on the town. The goal is to Minimize the time it takes for all of the Taxis to reach their Customers. Only one Taxi will be sent to each Customer and each Customer needs only one Taxi.

Taxi / Cust	1	2	3	4	5	6	7	8
A	2	9	10	2	4	15	10	5
B	10	17	18	14	7	5	15	18
C	10	17	17	14	19	6	12	2
D	16	6	19	18	10	15	8	5
E	7	5	10	6	15	14	5	16
F	6	9	7	8	10	2	19	19
G	19	16	17	8	14	7	4	10
H	11	17	5	16	16	9	12	11

The optimal solution to this problem requires the following: Taxi A picks up Customer

Taxi B picks up Customer

Taxi C picks up Customer

Taxi D picks up Customer

Taxi E picks up Customer

Taxi F picks up Customer

Taxi G picks up Customer

Taxi H picks up Customer

Minimum Cost =

Hint: Your cost should be between 32 and 36 Enter your cost without any Formatting. No Dollar Signs and No Commas