Air Miles Find the best route. Maths and transport Planning the best routes for your company to fly or drivePlanning the best routes for your company.

Slides:



Advertisements
Similar presentations
Constraint Satisfaction Problems
Advertisements

State Space Representation and Search
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
What is the computational cost of automating brilliance or serendipity? (Computational complexity & P vs NP) COS 116, Spring 2012 Adam Finkelstein.
What is the computational cost of automating brilliance or serendipity? (Computational complexity and P vs NP question) COS 116: 4/12/11 Sanjeev Arora.
Applying Machine Learning to Circuit Design David Hettlinger Amy Kerr Todd Neller.
Why does Rudolph have a shiny nose? A mathematical look at Christmas Chris Budd.
One Hull of A Rain Forest Green Computing Computer Science Neil Gordon January
Local search algorithms
Local search algorithms
By checking routes for air traffic conflicts, wind conditions and airspace constraints, Computers can automatically tell an airlines operations center.
1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.
Nature’s Algorithms David C. Uhrig Tiffany Sharrard CS 477R – Fall 2007 Dr. George Bebis.
Iterative Improvement Algorithms
1 Chapter 5 Advanced Search. 2 l
Travelling Salesman Problem an unfinished story...
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Iterative Improvement Algorithms For some problems, path to solution is irrelevant: just want solution Start with initial state, and change it iteratively.
Computer Science Prof. Bill Pugh Dept. of Computer Science.
Artificial Intelligence in Information Processing Genetic Algorithms by Theresa Kriese for Distributed Data Processing.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
SAVE MONEY AND SAVE THE ENVIRONMENT ENVIRONMENTALLY FRIENDLY AS A COMPANY By: Anna Wilkin.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
Pre-Algebra 8-5 Estimating with Percents Learn to estimate with percents.
Pawel Drozdowski – November Introduction GA basics Solving simple problem GA more advanced topics Solving complex problem Question and Answers.
Random Number Generators CISC/QCSE 810. What is random? Flip 10 coins: how many do you expect will be heads? Measure 100 people: how are their heights.
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
1 Growth of Functions CS 202 Epp, section ??? Aaron Bloomfield.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
1 Computing with DNA L. Adelman, Scientific American, pp (Aug 1998) Note: This ppt file is based on a student presentation given in October, 1999.
Future Flight Design. Engineering design process: Step 1: Define The Problem Step 1: Define The Problem Step 2: Generate Ideas Step 2: Generate Ideas.
Windy Cities
An Introduction to Artificial Life Lecture 4b: Informed Search and Exploration Ramin Halavati In which we see how information.
CS440 Computer Science Seminar Introduction to Evolutionary Computing.
COSC 4426 Topics in Computer Science II Discrete Optimization Good results with problems that are too big for people or computers to solve completely
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Lawrence Snyder University of Washington, Seattle © Lawrence Snyder 2004 What can a computer be commanded to do?
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
Thursday, May 9 Heuristic Search: methods for solving difficult optimization problems Handouts: Lecture Notes See the introduction to the paper.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
A Simple Example The Traveling Salesman Problem: Find a tour of a given set of cities so that each city is visited only once the total distance traveled.
Percent Word Problems Mrs. Kuznia Math 8 Day 12. Word Problems  To solve word problems with percents? –we are going to set up a proportion to solve.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Transportation Logistics Professor Goodchild Spring 2011.
Word Problems: Distance, rate and time Type A: Same – Direction of travel A train leaves a train station at 1 pm. It travels at an average rate.
Pre-Algebra 8-5 Estimating with Percents Warm-up.
Local search algorithms In many optimization problems, the state space is the space of all possible complete solutions We have an objective function that.
Optimization Problems
Sam & Tom, inc ®™. Air traveling takes to long, costs too much, and pollutes the air. Going from A------to------>B is way too slow and costly.
To change the sample image, select the picture and delete it. Now click the Pictures icon in the placeholder to insert your own image. Click Send to.
What is a Cryocar? It is a liquid nitrogen powered vehicle. Propulsion systems are cryogenic heat engines in which a cryogenic substance is used as a.
Math 20-1 Chapter 6 Rational Expressions and Equations 6.4 Solve Rational Equations Teacher Notes.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
“Life in the future (2050)” Made by (впишите имя) 2011
Optimization Problems
Genetic Algorithms.
Minimal Spanning Trees and Graphs
Network Models Chapter 12
Air Miles Find the best route.
Genetic Algorithms and TSP
Optimization Problems
Tour of Texas 50 largest cites (with airports) Application of Simulated Annnealing to the Traveling Salesman Problem (NP-hard)
The N-Queens Problem Search The N-Queens Problem Most slides from Milos Hauskrecht.
Solution methods for NP-hard Discrete Optimization Problems
Presentation transcript:

Air Miles Find the best route

Maths and transport Planning the best routes for your company to fly or drivePlanning the best routes for your company to fly or drive Detecting when people pose a threat to security on the Tube - CCTV analysisDetecting when people pose a threat to security on the Tube - CCTV analysis Designing new technologies to make transport faster and more energy efficientDesigning new technologies to make transport faster and more energy efficient

The travelling salesman problem Given a number of cities and the costs of travelling from any city to any other city, what is the least-cost round-trip route that visits each of the cities?

Air miles

Scaling up With these nine cities it’s not too hard to work out some possible cheapest routes.With these nine cities it’s not too hard to work out some possible cheapest routes. With 90 cities you’d use a computer, but how long would it take?With 90 cities you’d use a computer, but how long would it take? For 9 cities, possible routes.For 9 cities, possible routes. For 90 cities, 90! = 90 x 89 x 88 x … x 1For 90 cities, 90! = 90 x 89 x 88 x … x 1 = 1.49 x routes. = 1.49 x routes.

A “good enough” answer When you were choosing your route you didn’t have time to check every routeWhen you were choosing your route you didn’t have time to check every route Instead, you may have tried a route which looked sensible and made small changes to see if they made a cheaper routeInstead, you may have tried a route which looked sensible and made small changes to see if they made a cheaper route

Computer methods Modern methods can find solutions for extremely large problems – millions of cities! – within a few minutes.Modern methods can find solutions for extremely large problems – millions of cities! – within a few minutes. Such solutions have a high probability of being just two or three percent away from the best solution.Such solutions have a high probability of being just two or three percent away from the best solution.

Biology, physics and all that jazz What makes a good method for solving problems like finding the cheapest route?What makes a good method for solving problems like finding the cheapest route? Mathematicians have taken inspiration from biology, physics and even jazz music to find good methods.Mathematicians have taken inspiration from biology, physics and even jazz music to find good methods.

Method 1: Survival of the Fittest Pick some routes at randomPick some routes at random Keep the best of thoseKeep the best of those Create a new generation by breeding routes togetherCreate a new generation by breeding routes together Throw away the bad routesThrow away the bad routes Have some random mutations each generationHave some random mutations each generation Thousands of generations later, you get good routes!Thousands of generations later, you get good routes!

Method 2: Simulated annealing Annealing: heat a material like steel or glass and then cool it, to make it softer.Annealing: heat a material like steel or glass and then cool it, to make it softer. Simulated annealing exposes a "solution" to "heat" and cools producing a better solution.Simulated annealing exposes a "solution" to "heat" and cools producing a better solution.

Method 3: Harmony search In jazz music each musician tunes their notes to find a best harmony all together.In jazz music each musician tunes their notes to find a best harmony all together. You can imagine each city having preferred previous and next destinations that “sound better”. It’s possible to make this work mathematically!

Where’s this maths used? Water distributionWater distribution Computer network designComputer network design Environmental projectsEnvironmental projects Design of traffic networksDesign of traffic networks Music compositionMusic composition Sudoku puzzle solvingSudoku puzzle solving Timetabling softwareTimetabling software