$($see chapter $15)$

From$/$To

SA

Bosco's

Champion

Damron

Enumclaw

Luther

Jones

Heidi

SA

$0$

$97$

$98$

$17$

$22$

$34$

$55$

$71$

Bosco's

$14$

$0$

$99$

$29$

$20$

$39$

$84$

$53$

Champion

$63$

$8$

$0$

$90$

$96$

$89$

$66$

$78$

Damron

$98$

$90$

$29$

$0$

$46$

$88$

$62$

$13$

Enumclaw

$27$

$88$

$94$

$81$

$0$

$49$

$53$

$35$

Luther

$91$

$95$

$62$

$91$

$19$

$0$

$73$

$91$

Jones

$87$

$2$

$27$

$69$

$11$

$4$

$0$

$25$

Heidi

$61$

$31$

$58$

$13$

$15$

$92$

$44$

$0$

Use the nearest neighbor heuristic to identify a route that would minimize the distance traveled. If SA is the starting point, what is the next location the shipper should visit? The rule of thumb when solving the nearest neighbor $($NN$)$ heuristic for logistics routes is to start from the column and make the next move using the location from the row.

Heidi

Damron

Enumclaw

Bosco's

Luther