Week 9 Optimisation What is optimisation?

Slides:



Advertisements
Similar presentations
Hard Problems Some problems are hard to solve. No polynomial time algorithm is known Most combinatorial optimization problems are hard Popular NP-hard.
Advertisements

CS6800 Advanced Theory of Computation
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.
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)
Lecture 1: Introduction to the Course of Optimization 主講人 : 虞台文.
Complexity Theory CSE 331 Section 2 James Daly. Reminders Project 4 is out Due Friday Dynamic programming project Homework 6 is out Due next week (on.
A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.
Ch 13 – Backtracking + Branch-and-Bound
CS10 The Beauty and Joy of Computing Lecture #23 : Limits of Computing Thanks to the success of the Kinect, researchers all over the world believe.
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.
Genetic Algorithms and Ant Colony Optimisation
EE4E,M.Sc. C++ Programming Assignment Introduction.
EECS 203: It’s the end of the class and I feel fine. Graphs.
Scott Perryman Jordan Williams.  NP-completeness is a class of unsolved decision problems in Computer Science.  A decision problem is a YES or NO answer.
IT 60101: Lecture #201 Foundation of Computing Systems Lecture 20 Classic Optimization Problems.
Complexity Classes (Ch. 34) The class P: class of problems that can be solved in time that is polynomial in the size of the input, n. if input size is.
Graph Theory Hamilton Paths and Hamilton Circuits.
Ch.12 Machine Learning Genetic Algorithm Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
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.
Spring 2015 Mathematics in Management Science Traveling Salesman Problem Approximate solutions for TSP NNA, RNN, SEA Greedy Heuristic Algorithms.
Object Oriented Programming Assignment Introduction Dr. Mike Spann
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
DP TSP Have some numbering of the vertices We will think of all our tours as beginning and ending at 1 C(S, j) = length of shortest path visiting each.
Hard problems in computer science Prof. Noah Snavely CS1114
1 Genetic Algorithms and Ant Colony Optimisation.
G ENETIC A LGORITHM. S IMULATED E VOLUTION We need the following Representation of an individual Fitness Function Reproduction Method Selection Criteria.
Hard Problems Some problems are hard to solve.  No polynomial time algorithm is known.  E.g., NP-hard problems such as machine scheduling, bin packing,
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Hard Problems Sanghyun Park Fall 2002 CSE, POSTECH.
CS10: The Beauty and Joy of Computing Lecture #22 Limits of Computing Warning sign posted at Stern Hall. Also, Apple releases new operating.
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
“One ring to rule them all” Analogy (sort of) Lord of The Rings Computational Complexity “One problem to solve them all” “my preciousss…”
The Beauty and Joy of Computing Lecture #23 Limits of Computing Researchers at Facebook and the University of Milan found that the avg # of “friends” separating.
Lecture 7 Jianjun Hu Department of Computer Science and Engineering University of South Carolina CSCE350 Algorithms and Data Structure.
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
By: Christophe Dufour Chrishon Adams Mischael Joseph.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
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.
Ch3 /Lecture #4 Brute Force and Exhaustive Search 1.
Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.
Exhaustive search Exhaustive search is simply a brute- force approach to combinatorial problems. It suggests generating each and every element of the problem.
Hard Problems Some problems are hard to solve.  No polynomial time algorithm is known.  E.g., NP-hard problems such as machine scheduling, bin packing,
Solving Complex Problems
What is Data Mining? What is Market Basket Analysis? Give an example
Weighted Graphs and traveling Salesperson problem
Hard Problems Some problems are hard to solve.
EMIS 8373: Integer Programming
Hard Problems Introduction to NP
Week 11 - Monday CS221.
Unsolvable Problems December 4, 2017.
1 The Travelling Salesman Problem (TSP) H.P. Williams Professor of Operational Research London School of Economics.
Genetic Algorithms and TSP
Integer Programming (정수계획법)
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Approximation Algorithms
Design & Analysis of Algorithms Combinatorial optimization
Integer Programming (정수계획법)
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Classwork Worksheet Homework (day 67) worksheet
CSC 380: Design and Analysis of Algorithms
Artificial Intelligence CIS 342
Hard Problems Some problems are hard to solve.
CSC 380: Design and Analysis of Algorithms
CSC 380: Design and Analysis of Algorithms
Traveling Salesman Problems Nearest Neighbor Method
Alex Bolsoy, Jonathan Suggs, Casey Wenner
Presentation transcript:

Week 9 Optimisation What is optimisation? Examples/uses from business & industry? What is the Travelling Salesman Problem? What is the best PROVEN solution?

(TSP) Travelling Salesman Problem: A travelling salesman has to visit a number of cities (all & once) then return home, like a tour. We want to find the shortest route. For two cities it’s trivial, go from A to B and back to A. There’s only one possible tour A B  A. For 3 cities it’s fairly easy A  B, B  C, C  A (but you can go ABCA or ACBA, they’re the same length, so they’re the same ‘tour’ i.e. there’s only 1 tour). How many tours are there for 4 cities? How many for 5? What’s the formula/equation? What is the highest PROVEN solution you can find for TSP?

TSP Calculate the number of possible solutions for 6 cities The Traveling Salesman Problem is typical of a large class of “hard” optimization problems. The problem quickly ‘explodes’ in difficulty, like a polynomial  It has applications in science, business and engineering. For example, in the manufacture of a circuit board, it is important to determine the best order in which a laser will drill thousands of holes. An efficient solution to this problem reduces production costs for the manufacturer. Calculate the number of possible solutions for 6 cities

The Knapsack problem

0-1 Knapsack The knapsack problem is a problem in combinatorial optimization. Given a set of items, each with a Cost and a Value, determine the number of each item to include in a collection so that the total cost is less than a given limit and the total value is as large as possible. A similar problem often appears in business, combinatorics, complexity theory, cryptography and applied mathematics. The decision problem form of the knapsack problem is the question “can a value of at least V be achieved without exceeding the cost C?” There are many examples from business & industry e.g. paper mills which produce huge rolls of paper and cut to order, customers want different size and length rolls… 1% wastage could equal $1M. http://en.wikipedia.org/wiki/Cutting_stock_problem Example in Australia, water management Scheduling What does the 0-1 mean?

Which items should be chosen to maximize the value while still keeping the overall weight under or equal to 15 kg?

The Knapsack applet (on the LMS)

Brute force or naïve method Pros and cons of this method?

The Genetic Algorithm What is a genotype? Crossover? Mutation?

The results

Genetics Ever heard of a Liger = tiger/lion (or a tigon). What does a 400kg liger eat for breakfast? …whatever he wants. Is this an example of crossover or mutation? How about this ‘peppered’ moth. It used to look like the one on the left, then the Industrial Revolution came along…

Crossover Mutation Or, 11001011 + 11011111 = 11001111 Take part of one ‘parent’ and part of the other and join them together. Or, 11001011 + 11011111 = 11001111 Mutation 11001111  11001110 

To do Knapsack exercise From last session… Data visualisation Namevoyager: http://domino.research.ibm.com/comm/wwwr_thinkresearch.nsf/pages/20050901_baby.shtml Is this data mining? Gapminder & Google ‘Motion Charts’ www.gapminder.org