Activity 01
Inquiry Circle: Route Planning Heuristic
Groups of 4 receive a map with 8-10 city nodes and distances. Each group uses a different heuristic (nearest neighbor, farthest first, random order) to plan a tour visiting every city, then calculates their total distance. Groups compare results. The activity reveals that different heuristics produce different answers and that none is guaranteed optimal.
Explain the concept of a heuristic and when it is useful.
Facilitation TipDuring Collaborative Investigation, assign each group a different heuristic so the class can compare results side by side.
What to look forPresent students with a small instance of the Traveling Salesman Problem (e.g., 5 cities). Ask them to apply the nearest-neighbor heuristic and then calculate the total distance. Then, ask them to identify one way this heuristic might fail to find the shortest path.