120 likes | 231 Vues
This case study explores the Route Inspection Problem, where a snowplow driver faces the challenge of clearing roads efficiently after heavy snowfall. The goal is to determine the most effective route that covers every road in the town center and returns to the starting point, minimizing total distance traveled. Practical applications of this problem extend beyond snowplowing to traffic wardens inspecting roads, demonstrating the relevance of operational research in route optimization. Over upcoming lessons, we will delve into strategies for solving these types of problems.
E N D
What’s the problem? www.LearnAboutOR.com
You are the driver of a snowplough… There has been a heavy snowfall overnight You want to clear the roads in the town centre as quickly as possible And then return to your base www.LearnAboutOR.com
Which route should you take? www.LearnAboutOR.com
What do we need? A map! www.LearnAboutOR.com
E C A B F G H D Something like this… www.LearnAboutOR.com
With the distances www.LearnAboutOR.com
Let’s summarise the problem We want to find a route that goes down every road and returns to the starting point that is as short as possible www.LearnAboutOR.com
This is an example of aRoute Inspection Problem www.LearnAboutOR.com
The Route Inspection Problem To find a minimum weight route that travels along each edge of a network at least once and returns to the starting vertex www.LearnAboutOR.com
Another example where this is used By a traffic warden who wants to inspect all the roads in an area www.LearnAboutOR.com
What next? Over the next few lessons, we will look at ways of approaching problems of this type… www.LearnAboutOR.com