Route minimisation
Page 1 of 1
Route minimisation
The table shows the least times, in seconds, that it takes a robot to travel between six points in an automated warehouse. These six points are an entrance, A, and five storage bins, B, C, D, E and F. The robot will start at A, visit each bin, and return to A. The total time taken for the robot’s route is to be minimised.
(a) Show that there are two nearest neighbour routes that start from A. You must make the routes and their lengths clear.
(b) Starting by deleting F, and all of its arcs, find a lower bound for the time taken for the robot’s route.
(c) Use your results to write down the smallest interval which you are confident contains the optimal time for the robot’s route.
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|