Nuffield Free-Standing Mathematics Activity

Slides:



Advertisements
Similar presentations
© Nuffield Foundation 2012 © Rudolf Stricker Nuffield Free-Standing Mathematics Activity House price moving averages.
Advertisements

Nuffield Free-Standing Mathematics Activity
Shortest Paths Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 9.6 Based on slides from Chuck Allison, Michael T.
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Modelling a test drive © Rudolf Stricker.
Reducibility Class of problems A can be reduced to the class of problems B Take any instance of problem A Show how you can construct an instance of problem.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
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)
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
Math443/543 Mathematical Modeling and Optimization
Shortest path algorithm. Introduction 4 The graphs we have seen so far have edges that are unweighted. 4 Many graph situations involve weighted edges.
The Traveling Salesperson Problem
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.
WEB SCIENCE: ANALYZING THE WEB. Graph Terminology Graph ~ a structure of nodes/vertices connected by edges The edges may be directed or undirected Distance.
Take a Tour with Euler Elementary Graph Theory – Euler Circuits and Hamiltonian Circuits Amro Mosaad – Middlesex County Academy.
Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity What’s it worth? © Rudolf Stricker.
Graph Theory Hamilton Paths and Hamilton Circuits.
© Nuffield Foundation 2012 Nuffield Mathematics Activity DISCUSS regression and correlation CC Rudolf Stricker.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
CS440 Computer Science Seminar Introduction to Evolutionary Computing.
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Chinese Postman Algorithm Aims: To be able to use the Chinese Postman Algorithm for: all even vertices. 2 odd vertices. Starting and ending at the same.
Chinese postman problem
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.
6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.
Connected Components Fun with graphs, searching, and queues.
Branch and bound branch and bound methods economize the search for the best trees by backing out of dead alleys.
TSP – Upper Bounds and Lower Bounds Initial problem : Upper Bound A salesman based in Stockton needs to visit shops based in Darlington, Billingham, Middlesbrough,
The Travelling Salesperson Problem A salesperson needs to visit London, Nottingham, Manchester and Leeds, he lives in Birmingham. Find the shortest route.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.
Decision Maths 1 Shortest path algorithm Dijkstra’s Algorithm A V Ali :
Source: CSE 214 – Computer Science II Graphs.
By: Christophe Dufour Chrishon Adams Mischael Joseph.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13B The Traveling Salesman Problem.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
AS Decision Maths Tips for each Topic. Kruskal and Prim What examiner’s are looking for A table of values in the order that they are added and the total.
Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.
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.
Lower bound algorithm. 1 Start from A. Delete vertex A and all edges meeting at A. A B C D 4 5 E Find the length of the minimum spanning.
Limitation of Computation Power – P, NP, and NP-complete
Hamilton Paths and Hamilton Circuits
Solving Complex Problems
Weighted Graphs and traveling Salesperson problem
Shortest Path Problems
DISCUSS regression and correlation
Nuffield Free-Standing Mathematics Activity
GRAPH-THEORY AND APPLICATIONS
Shortest Paths Discrete Mathematics and Its Applications (7th Edition)
Measuring inflation using Laspeyres index
Discrete Mathematics and Its Applications (5th Edition)
Graph Theory.
Genome Assembly.
Nuffield Free-Standing Mathematics Activity
Decision Maths Dijkstra’s Algorithm.
Shortest Paths Discrete Mathematics and Its Applications (7th Edition)
Nuffield Free-Standing Mathematics Activity
Free-Standing Mathematics Activity
Nuffield Free-Standing Mathematics Activity
Approximation Algorithms
Discrete Mathematics and Its Applications (5th Edition)
The travelling salesman problem
Shortest Paths Discrete Mathematics and Its Applications (8th Edition)
Traveling Salesman Problems Nearest Neighbor Method
Shortest Paths Discrete Mathematics and Its Applications (7th Edition)
Nuffield Free-Standing Mathematics Activity
Shortest Paths Discrete Mathematics and Its Applications (7th Edition)
Presentation transcript:

Nuffield Free-Standing Mathematics Activity Sight-seeing tour © Rudolf Stricker

Sight-seeing tour Many cities have sightseeing tours for their tourists. How do you decide on the route for a sightseeing tour? Think about ... Do you want to travel between places of interest by the shortest route? Is the route itself of interest? Do you want the route to be of the shortest possible distance or the shortest time?

Sight-seeing tour ccKenneth Allen To solve this type of problem you may need to use the ... Chinese Postman Algorithm to minimise the distance travelled when every edge of a network needs to be visited Travelling Salesman Algorithm to minimise the distance travelled when every vertex of a network needs to be visited

Reflect on your work Describe your approach to this problem. Which algorithm(s) did you use? How can you evaluate your route to decide if you have found the best possible tour? © Nuffield Foundation 2012

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.