1. Operational Research (O.R.) case studies

2. What’s the problem? www.LearnAboutOR.com

3. You are a van driver… You are in Milton Keynes and you have a delivery to make in Hoddesdon You want to find the shortest route there www.LearnAboutOR.com

4. Which route should you take? www.LearnAboutOR.com

5. What do we need? A map! www.LearnAboutOR.com

6. Something like this… LETCHWORTH STEVENAGE HERTFORD POTTERS BAR HITCHIN LUTON ST ALBANS HATFIELD HODDESDON CHESHUNT BEDFORD WELWYN MILTON KEYNES BOREHAMWOOD www.LearnAboutOR.com

7. With the distances www.LearnAboutOR.com

8. Distance matrix (in miles) MKLUBEHILESTWEHASABOPBCHHEHO MK-2120----------- LU21-208----14----- BE20 -1823--------- HI-818-3610-20----- LE--233-7-------- ST---67-7-----11- WE---10-7-6----7- HA------6-966-9- SA-14-20---9-8---- BO-------68-4--- PB-------6-4-8-- CH----------8--6 HE-----1179-----5 HO-----------65- www.LearnAboutOR.com

9. Let’s summarise the problem We want to find a route from Milton Keynes to Hoddesdon that is as short as possible www.LearnAboutOR.com

10. This is an example of where we need to use Dijkstra’s Algorithm www.LearnAboutOR.com

11. Dijkstra’s Algorithm finds the route between any two nodes of a network with the least possible total weight www.LearnAboutOR.com

12. Another example of where this is used In a Satellite Navigation System www.LearnAboutOR.com

13. Over the next few lessons, we will look at ways of approaching problems of this type… What next? www.LearnAboutOR.com