Jilly wants to encourage her university to compost the organic waste that is produced at various buildings on campus, and so she decides to conduct a feasibility study. Jilly starts by identifying all of the buildings on campus that produce organic waste and how they are connected by road. She constructs the graph U seen below, where the vertices represent the different university buildings that produce organic waste and the edges represent the time, in minutes, it takes to drive between the different buildings via the connecting roads. Due to construction work, the road connecting buildings D and E is temporarily one-way in the direction indicated.
Write down a Hamiltonian cycle in U.
A table for graph U showing the minimum travel times between each pair of buildings is given below:
Find the values of
Jilly decides that the waste collecting route should start and finish at the same building.
She also wants to minimise the time taken to visit each building to collect the waste, and so decides to determine upper and lower bounds for the quickest waste collection route.
After the upper bound in part (c) has been calculated, but before any lower bound has been calculated, the construction work is finished and the one-way restriction between buildings D and E is removed.
Explain how the removal of the one-way restriction will affect the upper bound found in part (c), given that the nearest neighbour algorithm is still used starting at vertex A.
Based on her estimates Jilly decides that the time taken to collect waste from all eight buildings will be too long to take place on a daily basis. She instead decides that waste will only be collected daily from the three buildings that produce the greatest volume of organic waste, buildings E, F and H. The organic waste from the each of the remaining buildings will need to be carried to the nearest of those three buildings to be collected.
The Voronoi diagram below shows the coordinates of each building on a grid relative to a fixed origin. It is partially completed with the perpendicular bisectors of HF and EF.
Given that 5 minutes is allowed for loading the organic waste at each stop, find the time saved by collecting waste at points E, F and H only, rather than visiting all eight buildings. (You may disregard here the amount of time taken to carry the waste from the other five buildings to the collection points at buildings E, F and H.)
Did this page help you?