In: Operations Management
1. The Green Cab Company has a taxi waiting at each of four cabstands in Evanston, Illinois. Four customers have called and requested service. The distances, in miles, from the waiting taxis to the customers are given in the following table. Find the optimal assignment of taxis to customers so as to minimize total driving distances to the customers. Please show all steps/work
Cab site |
Customer |
|||
A |
B |
C |
D |
|
Stand 1 |
8 |
3 |
4 |
8 |
Stand 2 |
5 |
4 |
6 |
7 |
Stand 3 |
7 |
7 |
9 |
6 |
Stand 4 |
8 |
6 |
6 |
4 |
This is an integer programming question.
Let a1, a2, a3, a4 be the cases where Customer A is assigned Stand 1, 2, 3, 4 respectively. Since customer will go in only one taxi, only one of a1, a2, a3, a4 will be equal to 1, rest 3 will be equal to 0
Let b1, b2, b3, b4 be the cases where Customer B is assigned Stand 1, 2, 3, 4 respectively. Since customer will go in only one taxi, only one of b1, b2, b3, b4 will be equal to 1, rest 3 will be equal to 0
Let c1, c2, c3, c4 be the cases where Customer C is assigned Stand 1, 2, 3, 4 respectively. Since customer will go in only one taxi, only one of c1, c2, c3, c4 will be equal to 1, rest 3 will be equal to 0
Let d1, d2, d3, d4 be the cases where Customer D is assigned Stand 1, 2, 3, 4 respectively. Since customer will go in only one taxi, only one of d1, d2, d3, d4 will be equal to 1, rest 3 will be equal to 0
The objective function is to minimize the distance between the customer and the stand -
Min Z = 8a1 + 5a2 + 7a3 + 8a4 + 3b1 + 4b2 + 7b3 + 6b4 + 4c1 + 6c2 + 9c3 + 6c4 + 8d1 + 7d2 + 6d3 + 4d4
Constraints -
a1 + a2 + a3 + a4 = 1 .. constraint on Customer A choosing one taxi stand
b1 + b2 + b3 + b4 = 1 .. constraint on Customer B choosing one taxi stand
c1 + c2 + c3 + c4 = 1 .. constraint on Customer C choosing one taxi stand
d1 + d2 + d3 + d4 = 1 .. constraint on Customer D choosing one taxi stand
a1 + b1 + c1 + d1 = 1 .. constraint on Stand 1 selected for a customer
a2 + b2 + c2 + d2 = 1 .. constraint on Stand 2 selected for a customer
a3 + b3 + c3 + d3 = 1 .. constraint on Stand 3 selected for a customer
a4 + b4 + c4 + d4 = 1 .. constraint on Stand 4 selected for a customer
a1, a2, a3, a4, b1, b2, b3, b4, c1, c2, c3, c4, d1, d2, d3, d4 <=1
Let us solve this using Excel Solver -
Let none of the taxi stands be selected inititally (indicated in grey cells)
We will need to calculate the values in the grey cells to minimize the cost. Put in the constraints and solve to get -
Hence, Customer A should be assigned Taxi from Stand 2, Customer B should be assigned taxi from Stand 2, Customer C should be assigned taxi from Stand 1 and Customer D should be assigned taxi from Stand 4 to minimize the total distance to 19 miles