Previously in Chapter 6 Using binary variables Unintended options Lack of sensitivity analysis.

Slides:



Advertisements
Similar presentations
Makespan with Sequence Dependent Setup Time (MSDST) 1|s jk |C max.
Advertisements

Branch and Bound See Beale paper. Example: Maximize z=x1+x2 x2 x1.
CS6800 Advanced Theory of Computation
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
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.
1 MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, 2005.
CSCI 573 Linear and Mixed Integer Programming Sven Koenig.
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
The 2 Period Travelling Salesman Problem Applied to Milk Collection in Ireland By Professor H P Williams,London School of Economics Dr Martin Butler, University.
Vehicle Routing & Scheduling: Part 1
Lecture 1: Introduction to the Course of Optimization 主講人 : 虞台文.
Math443/543 Mathematical Modeling and Optimization
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Designing Algorithms February 2nd. Administrativia Lab assignments will be due every Monday Lab access –Searles 128: daily until 4pm unless class in progress.
Vehicle Routing & Scheduling
Designing Algorithms Csci 107 Lecture 3. Administrativia Lab access –Searles 128: daily until 4pm unless class in progress –Searles 117: 6-10pm, Sat-Sun.
Previously… Formulating optimization problems –notation –LPs –binary variables LP sensitivity analysis.
Imagine that I am in a good mood Imagine that I am going to give you some money ! In particular I am going to give you z dollars, after you tell me the.
Genetic Algorithms: Solving the Traveling Salesman Problem Thomas Abtey SUNY Oswego.
EAs for Combinatorial Optimization Problems BLG 602E.
Linear Programming Applications
State-Space Representation Read Chapter 3. Searches you use MapQuest –road maps Google –documents CiteSeer –research documents.
Chapter 2: Business Efficiency Lesson Plan Business Efficiency  Visiting Vertices-Graph Theory Problem Hamiltonian Circuits  Vacation Planning Problem.
The Travelling Salesman Problem (TSP)
1 Network Models Chapter 4 2 For a given network find the path of minimum distance, time, or cost from a starting point, the start node, to a destination,
Copyright R. Weber Search in Problem Solving ISYS 370 Dr. R. Weber.
EECS 203: It’s the end of the class and I feel fine. Graphs.
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 6 Business Analytics with Integer Programming Business Analytics with.
Graph Theory Topics to be covered:
Notes 6IE3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Welcome to MM305 Unit 6 Seminar Larry Musolino
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Columbia Express Algorithms and heuristics used by shipping company Yoon Keun Ane Jeongwho Lee Co- Express.
Integer Linear Programming Terms Pure integer programming mixed integer programming 0-1 integer programming LP relaxation of the IP Upper bound O.F. Lower.
Traveling Salesman Problem (TSP)
Transportation Logistics Professor Goodchild Spring 2011.
Integer Programming (정수계획법)
Chapter 7 Nonlinear Optimization Models. Introduction The objective and/or the constraints are nonlinear functions of the decision variables. Select GRG.
CSCI 2670 Introduction to Theory of Computing November 17, 2005.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
1.3 Modeling with exponentially many constr. Integer Programming
I can describe the differences between Hamilton and Euler circuits and find efficient Hamilton circuits in graphs. Hamilton Circuits I can compare and.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Exhaustive search Exhaustive search is simply a brute- force approach to combinatorial problems. It suggests generating each and every element of the problem.
EMIS 8373: Integer Programming Combinatorial Optimization Problems updated 27 January 2005.
SAT problem SAT – Boolean satisfiability problem
1 The Travelling Salesman Problem (TSP) H.P. Williams Professor of Operational Research London School of Economics.
Chapter 2: Business Efficiency Lesson Plan
Traveling Salesman Problem
Chapter 2: Business Efficiency Lesson Plan
2 TSP algorithms: (1) AP+B&B, (2) min spanning tree.
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
Branch and Bound See Beale paper.
Integer Programming (정수계획법)
Chapter 2: Business Efficiency Business Efficiency
Heuristic Algorithms via VBA
Neural Networks Chapter 4
Integer Programming (정수계획법)
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
Solver via VBA IE 469 Spring 2019.
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Presentation transcript:

Previously in Chapter 6 Using binary variables Unintended options Lack of sensitivity analysis

Agenda Quiz logistics Finish binary variables –Traveling salesman problem Nonlinear functions –Finishes optimization –(Will come back to chapter 5 later.)

Quiz Survey Should I move it?11 Yes, 3 No Most preferredAcceptable Mon-Tue46 Tue-Wed49 Wed-Thur39 Thur-Fri39 Fri-Sat16

Quiz Tue 11am to Wed 11am office hours Mon 4-5 moving Wed office hours to Tue 4-5

Agenda Quiz logistics Finish binary variables –Traveling salesman problem Nonlinear functions –Finishes optimization –(Will come back to chapter 5 later.)

Traveling Salesman Problem Chicago Detroit Atlanta

Traveling Salesman Problem Data: Cities and Distances Goal: minimize travel time to tour all cities (visit each city exactly once)

Traveling Salesman Problem (TSP) Famous problem Vehicle Routing Job Sequencing (p207) –5 tasks that need to be done on a machine –Setup time for a task depends on the task that just completed

Job Sequencing task 1 task 2 task 3 task 4 task 5 start/finish

Solving TSP 1.Setup an assignment problem

Solving TSP 1.Setup an assignment problem 2.Any subtours (loops of length k<n) ?

Solving TSP 1.Setup an assignment problem 2.Any subtours (loops of length k<n) ? 3.Add subtour constraints sum of variables ≤ k-1 now binary variables needed

Solving TSP 1.Setup an assignment problem 2.Any subtours (loops of length k<n) ? 3.Add subtour constraints sum of variables ≤ k-1 now binary variables needed 4.Repeat (go to stop 2) often you finish quickly (though no guarantees)

Nonlinear functions product terms –chemical processes –area, volume –variance log terms –utility functions –entropy

Nonlinear Functions Sensitivity Analysis –Like a derivative Sqrt() function –Help the solver by defining it for x<0 Solution may depend on starting point –Solvers use hill-climbing methods

Nonlinear Example Given a set of rectangular boxes, how many can you fit into a container?