We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAmari Nokes
Modified over 2 years ago
Operational Research (O.R.) case studies
What’s the problem?
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
But you want to keep costs as low as possible
Which roads should you pedestrianise?
What do we need? A map
Something like this… C E D H FG A B
With the distances
Let’s summarise the problem We want to connect all the places on the map with the least possible total distance of road
This is an example of finding a Minimum Spanning Tree
Minimum Spanning Tree The aim is to connect every vertex of the network using the edges having the least possible total weight
Another example where this is used By companies installing pipelines or cables to work out the most efficient way of connecting them up
Over the next few lessons, we will look at ways of approaching problems of this type… What next?
Operational Research (O.R.) case studies. What’s the problem?
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
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.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
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.
Prims Algorithm for finding a minimum spanning tree A Starting at vertex A, choose the edge.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Dear teacher, We wanted to apologize for the technical issues that EDpuzzle has experienced today. We have teachers in our team and understand how frustrating.
Minimum spanning trees Aims: To know the terms: tree, spanning tree, minimum spanning tree. To understand that a minimum spanning tree connects a network.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.4 Trees.
Graph Theory Trees. WHAT YOU WILL LEARN Trees, spanning trees, and minimum-cost spanning trees.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
1) Find and label the degree of each vertex in the graph.
Minimum Spanning tree Prim’s algorithm 1.Select any vertex 2.Select the shortest edge connected to that vertex 3.Select the shortest edge which connects.
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.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Trees Dr. Yasir Ali. A graph is called a tree if, and only if, it is circuit-free and connected. A graph is called a forest if, and only if, it is circuit-free.
ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.
AMUSEMENT PARK PROJECT MODULE 1 GRAPH THEORY. PART I – EULER CIRCUITS DUE AT THE BEGINNING OF CLASS ON FRIDAY, SEPTEMBER 26 TH.
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
Decision Maths Networks Kruskals Algorithm Wiltshire Networks A Network is a weighted graph, which just means there is a number associated with each.
Graphs David Kauchak cs302 Spring Admin HW 12 and 13 (and likely 14) You can submit revised solutions to any problem you missed Also submit your.
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.
MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.
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.
Operational Research (O.R.) case studies
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.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
The Minimum Connector Problem: Finding the shortest way to link all the vertices in a graph. Method: Find a minimum spanning tree An example would be joining.
Chapter 9: Graphs Basic Concepts Mark Allen Weiss: Data Structures and Algorithm Analysis in Java Lydia Sinapova, Simpson College.
Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
What Do You Hear? Beginning Sounds /i/, /t/, /n/.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 7 The Mathematics of Networks 7.1Trees 7.2Spanning Trees 7.3 Kruskal’s.
CSE 373: Data Structures and Algorithms Lecture 21: Graphs V 1.
Chinese postman problem BY LAKSHMA REDDY KUSAM. Outline : Real world problem Graph construction Graph problem Graph traversability Solution.
CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.
Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Minimum Spanning Trees By Ian Graves. MST A minimum spanning tree connects all nodes in a given graph A MST must be a connected and undirected graph A.
Minimum Spanning Trees: Chapter 6s The Modern Corp. Problem Modern Corporation has decided to have a state-of-the-art fiber-optic network installed to.
© 2017 SlidePlayer.com Inc. All rights reserved.