A clean-up crew is stationed at facility D and wants to take the shortest route to each site. They usually clean up facilities C, E, A and F on the same day and therefore want the shortest route from D to each facility
Recommend a route for the crew to leave from D, clean up each facility one after the other, and return to facility D. (Assume all paths are accessible.)
Answer: D to E to F to C to A to D. Total distance = 47. This is really a small version of the traveling salesman problem. Doing the minimal spanning tree prior to this problem may be helpful.
Business
You might also like to view...
When an agency acts in its quasi-judicial capacity, its behavior is referred to as _____
Fill in the blanks with correct word
Business
Which of the following does NOT constitute a normal interpersonal communication task for managers?
A) coordinating activities B) disseminating information C) motivating employees D) giving speeches at conferences
Business