The Food Channel has nine chef judges who need to be assigned to three cooking competitions, three to each competition. The competition board wants to assign the chefs so that the total distance they travel will be minimized. The distance in kilometers that each chef needs to travel for each competition is given below: Competition Area
Chef Albany Cannelburg Normandy
1 165 90 130
2 75 210 320
3 180 170 140
4 220 80 60
5 410 140 80
6 150 170 190
7 170 110 150
8 105 125 160
9 240 200 155
Respond to these questions:
1)What is the optimal assignment or assignments to minimize the total distance traveled by the chef judges? You may use a computer application to solve this problem.
2) In the last round of cooking competition, Chef #2 and Chef #8 had an altercation with a few contestants in a competition in Albany. The competition had to be stopped due to the severity of the altercation over the type of sauce to be used for grilling. The competition board decided that it would not be a good idea to have the two chefs come back to work in Albany due to the incident. It was decided not to have the two chefs assigned to Albany. How will this affect the optimal solution to this problem?
3) Recommend a strategy for the competition board for more effective management of future competitions.