120 likes | 227 Vues
Explore the Travelling Salesperson Problem with a courier making deliveries to multiple towns in Hertfordshire from Luton for maximum efficiency. Learn about operational research case studies at LearnAboutOR.com.
E N D
What’s the problem? www.LearnAboutOR.com
You are a courier… www.LearnAboutOR.com
You make deliveries… You are based in Luton You want to make deliveries at a number of towns in Hertfordshire before returning to the depot what route should you take? www.LearnAboutOR.com
What do we need? A map! www.LearnAboutOR.com
LETCHWORTH HITCHIN STEVENAGE LUTON HATFIELD HERTFORD ST ALBANS POTTERS BAR Something like this… www.LearnAboutOR.com
LETCHWORTH 3 HITCHIN 6.5 6.5 STEVENAGE 8 11 LUTON 14 HATFIELD HERTFORD 9 12 6.5 10.5 ST ALBANS 9.5 10.5 POTTERS BAR With the distances www.LearnAboutOR.com
Let’s summarise the problem We want to leave Luton and visit every town on our map then return to Luton covering the least possible distance www.LearnAboutOR.com
This is an example of aTravelling Salesperson Problem www.LearnAboutOR.com
The Travelling Salesperson Problem The aim is to visit every vertex of the network and return to the starting vertex using the route that has the minimum total weight www.LearnAboutOR.com
Another example where this is used Supermarket home delivery service www.LearnAboutOR.com
What next? Over the next few lessons, we will look at ways of approaching problems of this type… www.LearnAboutOR.com