Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published byAmari Nokes Modified over 9 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 work for a local council… You want to make some roads in the town centre into a pedestrian precinct so that pedestrians can walk safely between all the key places in the centre www.LearnAboutOR.com

4 But you want to keep costs as low as possible www.LearnAboutOR.com

5 Which roads should you pedestrianise? www.LearnAboutOR.com

6 What do we need? A map www.LearnAboutOR.com

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

8 With the distances

9 Let’s summarise the problem We want to connect all the places on the map with the least possible total distance of road www.LearnAboutOR.com

10 This is an example of finding a Minimum Spanning Tree www.LearnAboutOR.com

11 Minimum Spanning Tree The aim is to connect every vertex of the network using the edges having the least possible total weight www.LearnAboutOR.com

12 Another example where this is used By companies installing pipelines or cables to work out the most efficient way of connecting them up 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

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

Similar presentations

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.
Operational Research (O.R.) case studies. What’s the problem? www.LearnAboutOR.com.

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

Operational Research (O.R.) case studies. What’s the problem?
Math for Liberal Studies.  A cable company wants to set up a small network in the local area  This graph shows the cost of connecting each pair of cities.

Math for Liberal Studies.  A cable company wants to set up a small network in the local area  This graph shows the cost of connecting each pair of cities.
Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.

Minimum Spanning Trees (MSTs) Prim's Algorithm For each vertex not in the tree, keep track of the lowest cost edge that would connect it to the tree This.
Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.

Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
MINIMAL CONNECTOR PROBLEMS Problem: A cable TV company is installing a system of cables to connect all the towns in a region. The numbers in the network.

MINIMAL CONNECTOR PROBLEMS Problem: A cable TV company is installing a system of cables to connect all the towns in a region. The numbers in the network.
Prim’s Algorithm from a matrix A cable TV company is installing a system of cables to connect all the towns in the region. The numbers in the network are.

Prim’s Algorithm from a matrix A cable TV company is installing a system of cables to connect all the towns in the region. The numbers in the network are.
Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network using the lowest possible.

Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network using the lowest possible.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.

7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
Graph Algorithms: Minimum Spanning Tree 1 2 3 4 6 5 10 1 5 4 3 2 6 1 1 8 We are given a weighted, undirected graph G = (V, E), with weight function w:

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.

CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Minimum Spanning Trees CIS 606 Spring 2010. Problem A town has a set of houses and a set of roads. A road connects 2 and only 2 houses. A road connecting.

Minimum Spanning Trees CIS 606 Spring Problem A town has a set of houses and a set of roads. A road connects 2 and only 2 houses. A road connecting.
Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.

Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.
Chapter 9: Graphs Basic Concepts

Chapter 9: Graphs Basic Concepts
Minimum Spanning Trees

Minimum Spanning Trees
Minimum Spanning Tree Algorithms. What is A Spanning Tree? u v b a c d e f Given a connected, undirected graph G=(V,E), a spanning tree of that graph.

Minimum Spanning Tree Algorithms. What is A Spanning Tree? u v b a c d e f Given a connected, undirected graph G=(V,E), a spanning tree of that graph.

Similar presentations

Ads by Google