Question 1 · Planning a coffee-shop network
A coffee-chain owner has three existing shops in a city at:
$A = (4, 2), \quad B = (10, 4), \quad C = (8, 10)$ (units = km).
She wants to open a fourth shop and to plan a delivery network between all four locations. Travel times (min) along direct roads are given later in the question.
(a) [3 marks]
Find the equation of the perpendicular bisector of $[AB]$ in the form $ax + by + c = 0$.
Reveal worked solution
Midpoint of $AB$: $M = (7, 3)$. (M1)
Gradient of $AB$: $m_{AB} = \tfrac{4-2}{10-4} = \tfrac13$; perpendicular gradient $= -3$. (M1)
(b) [3 marks]
Find the equation of the perpendicular bisector of $[BC]$.
Reveal worked solution
Midpoint of $BC$: $(9, 7)$. Gradient of $BC$: $\tfrac{10-4}{8-10} = -3$; perpendicular gradient $= \tfrac13$. (M1 · M1)
(c) [3 marks]
Hence find the point $P$ equidistant from $A$, $B$ and $C$, and calculate its distance from $A$.
Reveal worked solution
Solve simultaneously: $y = -3x + 24$ and $x - 3y + 12 = 0$.
(d) [3 marks]
Explain in Voronoi terms what point $P$ represents, and where the owner should place a fourth shop $D$ if she wants to maximise the size of shop $A$'s Voronoi cell.
Reveal worked solution
Interpretation. $P$ is the Voronoi vertex where the cells of $A$, $B$, $C$ meet — the point equidistant from all three shops. (R1)
Placement of $D$. To maximise $A$'s cell, place $D$ as far from $A$ as possible and far from where the customer base concentrates. Practically: place $D$ on the far side of $B$ or $C$ (e.g. north-east of $C$), so its Voronoi cell steals area from $B$ and $C$ rather than from $A$. (R1 · A1)
(e) [5 marks]
The owner places the fourth shop at $D = (10, 10)$. Travel times (min) between the four shops are: $AB = 12, AC = 20, BC = 15, AD = 22, BD = 10, CD = 8$. Use Prim's algorithm starting at vertex $A$ to find the minimum spanning tree (MST). State the edges chosen in order and the total weight.
Reveal worked solution
Step 1. From $A$, cheapest edge: $AB = 12$. Add $B$. (M1)
Step 2. From $\{A, B\}$: edges to $C$ ($AC=20, BC=15$) and $D$ ($AD=22, BD=10$). Cheapest: $BD = 10$. Add $D$.
Step 3. From $\{A, B, D\}$: edges to $C$ ($AC=20, BC=15, CD=8$). Cheapest: $CD = 8$. Add $C$. (A1 · A1)
(f) [5 marks]
The owner now wants a daily circuit: start at $A$, visit every shop exactly once, return to $A$. Use the nearest-neighbour algorithm starting at $A$ to find an upper bound for the shortest circuit.
Reveal worked solution
Nearest-neighbour trace.
- $A \to$ nearest unvisited $= B$ (12). Path: $A,B$. (M1)
- $B \to$ nearest unvisited $= D$ (10). Path: $A,B,D$.
- $D \to$ nearest unvisited $= C$ (8). Path: $A,B,D,C$.
- Return to $A$: $C \to A = 20$.
(g) [6 marks]
Now use the deleted-vertex algorithm (deleting $A$) to find a lower bound for the shortest Hamiltonian cycle. Compare with (f) and comment on whether the nearest-neighbour tour is optimal.
Reveal worked solution
Step 1. Remove $A$. Remaining vertices: $\{B, C, D\}$ with edges $BC=15, BD=10, CD=8$.
Step 2. MST of the remaining graph (Prim from $B$): $BD = 10$, then $DC = 8$. MST weight $= 18$. (M1 · A1)
Step 3. Add the two shortest edges from $A$: $AB = 12$ and $AC = 20$ (skipping $AD=22$). (M1 · A1)
Comment. Upper bound = lower bound = 50, so the nearest-neighbour tour $A \to B \to D \to C \to A$ is optimal. (R1)