Presentation is loading. Please wait.

Presentation is loading. Please wait.

Operational Research (O.R.) case studies. What’s the problem? www.LearnAboutOR.com.

Published bySolomon Little Modified over 8 years ago

Similar presentations

Presentation on theme: "Operational Research (O.R.) case studies. What’s the problem? www.LearnAboutOR.com."— Presentation transcript:

1 Operational Research (O.R.) case studies

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

3 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

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

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

6 Something like this… www.LearnAboutOR.com C E D H FG A B

7 With the distances www.LearnAboutOR.com

8 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

9 This is an example of a Route Inspection Problem www.LearnAboutOR.com

10 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

11 Another example where this is used By a traffic warden who wants to inspect all the roads in an area www.LearnAboutOR.com

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

Download ppt "Operational Research (O.R.) case studies. What’s the problem? www.LearnAboutOR.com."

Similar presentations

Measuring distance on a map Measuring distance on a map is one of the most important skills to develop. If you can accurately measure the distance you.

Measuring distance on a map Measuring distance on a map is one of the most important skills to develop. If you can accurately measure the distance you.
Decision Maths Networks Kruskals Algorithm Wiltshire Networks A Network is a weighted graph, which just means there is a number associated with each.

Decision Maths Networks Kruskals Algorithm Wiltshire Networks A Network is a weighted graph, which just means there is a number associated with each.
Problem solving with graph search

Problem solving with graph search
The Chinese Postman Problem Route Planning Map Colouring

The Chinese Postman Problem Route Planning Map Colouring
Operational Research (O.R.) case studies. What’s the problem? www.LearnAboutOR.com.

Operational Research (O.R.) case studies. What’s the problem?
Discrete Maths Chapter 5: Route Inspection Lesson 1: Chinese Postman.

Discrete Maths Chapter 5: Route Inspection Lesson 1: Chinese Postman.
Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.

Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.
Graphs CSC 220 Data Structure. Introduction One of the Most versatile data structures like trees. Terminology –Nodes in trees are vertices in graphs.

Graphs CSC 220 Data Structure. Introduction One of the Most versatile data structures like trees. Terminology –Nodes in trees are vertices in graphs.
B cd a e f g h i j k One answer is; a-g-c-b-f-e-i-k-h-d-j-a Year 2 Warm Up 10/21/10 State a Hamilton Circuit for the following figure:

B cd a e f g h i j k One answer is; a-g-c-b-f-e-i-k-h-d-j-a Year 2 Warm Up 10/21/10 State a Hamilton Circuit for the following figure:
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.
9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)

9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)
What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.

What is the first line of the proof? a). Assume G has an Eulerian circuit. b). Assume every vertex has even degree. c). Let v be any vertex in G. d). Let.
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.

Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.

Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
131.123.247.253 -> 131.123.246.52 -> 131.123.11.254 131.123.8.1 131.123.11.254 131.123.247.253 131.123.246.52.

> >
Algorithms on graphs In Decision Mathematics, a graph consists of points (called vertices or nodes) which are connected by lines (edges or arcs). Eg in.

Algorithms on graphs In Decision Mathematics, a graph consists of points (called vertices or nodes) which are connected by lines (edges or arcs). Eg in.
The Travelling Salesman Algorithm A Salesman has to visit lots of different stores and return to the starting base On a graph this means visiting every.

The Travelling Salesman Algorithm A Salesman has to visit lots of different stores and return to the starting base On a graph this means visiting every.
The Shortest Path Problem

The Shortest Path Problem
MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.

MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.

Similar presentations

Ads by Google