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

Slides:



Advertisements
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.
Advertisements

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
The Chinese Postman Problem Route Planning Map Colouring
Operational Research (O.R.) case studies. What’s the problem?
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.
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:
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.
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.
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.
> >
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 Shortest Path Problem
MAP BASED ROUTING IN LARGE SCALE URBAN VEHICLE NETWORKS.
A Sample portion of a lesson
Graph Theory Hamilton Paths and Hamilton Circuits.
UNIT 3 THINKING MATHEMATICALLY BY BLITZER Hamilton Paths and Hamilton Circuits.
Operational Research (O.R.) case studies. What’s the problem?
Representing and Using Graphs
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.
Chinese postman problem
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Lesson Reflection for Chapter 14 Section 6 Pre-Algebra Learning Goal Students will understand collecting, displaying, & analyzing data.
Chapter 2: Business Efficiency Lesson Plan
CS 200 Algorithms and Data Structures
Towards Online Shortest Path Computation. Abstract The online shortest path problem aims at computing the shortest path based on live traffic circumstances.
Key School Home Pond Car Tennis Court.
TSP – Upper Bounds and Lower Bounds Initial problem : Upper Bound A salesman based in Stockton needs to visit shops based in Darlington, Billingham, Middlesbrough,
Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Chapter 1: Urban Services Lesson Plan
6.1 Hamilton Circuits and Hamilton Path
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.
Unit 1: The World in Spatial Terms Lesson 8: Reading a Road Map.
Vehicle Routing Problems
EULER PATHS & CHINESE POSTMAN SOL: DM.2 CLASSWORK WORKSHEET HOMEWORK (DAY 59) WORKSHEET.
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.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Unit 2 Hamiltonian Circuits. Hamiltonian Circuit: A tour that starts at a vertex of a graph and visits each vertex once and only once, returning to where.
Fleury's Algorithm Euler Circuit Algorithm
The travelling salesman problem Finding an upper bound using minimum spanning trees Find a minimum spanning tree using Prim’s algorithm or Kruskal’s algorithm.
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
Shana Norman Dec 11, 2003 Final Project
Hamilton Paths and Hamilton Circuits
Distance between places on a map
Minimum Spanning Tree Chapter 13.6.
Introduction (with applications) ADT & terminology
Shortest Path Graph represents highway system Edges have weights
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Decision Maths Dijkstra’s Algorithm.

6.1 Hamilton Circuits and Hamilton Path
In-Class Exercise: The Exponential Distribution
What’s this?. What’s this? Which is more effective? Why?
Louisiana Travels.
A path that uses every vertex of the graph exactly once.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
Hamiltonian Circuits and Paths Vocabulary
Networks Kruskal’s Algorithm
Police HQ, Aykley Heads, Durham, DH1 5TT
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
The travelling salesman problem
Presentation transcript:

Operational Research (O.R.) case studies

What’s the problem?

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

Which route should you take?

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 find a route that goes down every road and returns to the starting point that is as short as possible

This is an example of a Route Inspection Problem

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

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

Over the next few lessons, we will look at ways of approaching problems of this type… What next?