> Operational Research >> Integer Programming >>> Branch and Bound method

Slides:

Advertisements

Similar presentations

PERMUTATIONS AND COMBINATIONS

Advertisements

Branch and Bound See Beale paper. Example: Maximize z=x1+x2 x2 x1.

Traveling Salesperson Problem

DMOR Branch and bound. Integer programming Modelling logical constraints and making them linear: – Conjuction – Disjunction – Implication – Logical constraints.

Techniques for Dealing with Hard Problems Backtrack: –Systematically enumerates all potential solutions by continually trying to extend a partial solution.

Lecture 10: Integer Programming & Branch-and-Bound

Branch & Bound Algorithms

Search Techniques MSc AI module. Search In order to build a system to solve a problem we need to: Define and analyse the problem Acquire the knowledge.

Route Planning Branch & Bound CIS548 November 15, 2006.

Instructor Neelima Gupta Table of Contents Lp –rounding Dual Fitting LP-Duality.

Branch and Bound Searching Strategies

Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.

1 Branch and Bound Searching Strategies 2 Branch-and-bound strategy 2 mechanisms: A mechanism to generate branches A mechanism to generate a bound so.

Branch and Bound Algorithm for Solving Integer Linear Programming

5-1 Chapter 5 Tree Searching Strategies. 5-2 Breadth-first search (BFS) 8-puzzle problem The breadth-first search uses a queue to hold all expanded nodes.

Jin Zheng, Central South University1 Branch-and-bound.

Linear Programming Applications

ECE669 L10: Graph Applications March 2, 2004 ECE 669 Parallel Computer Architecture Lecture 10 Graph Applications.

Permutation A permutation is an arrangement in which order matters. A B C differs from B C A.

Integer programming Branch & bound algorithm ( B&B )

Branch & Bound UPPER =  LOWER = 0.

S /1/2015 Math 2 Honors - Santowski 1.  Use the Fundamental Counting Principle to determine the number of outcomes in a problem.  Use the idea.

NP-Complete Problems and how to go-on with them Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou,

Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.

Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.

Exact methods for ALB ALB problem can be considered as a shortest path problem The complete graph need not be developed since one can stop as soon as in.

If the integral cannot be evaluated, we can use an approximate method.

WOOD 492 MODELLING FOR DECISION SUPPORT

Search by partial solutions.  nodes are partial or complete states  graphs are DAGs (may be trees) source (root) is empty state sinks (leaves) are complete.

Permutations S /4/ Math 2 Honors - Santowski.

Ch. 6: Permutations!.

Arrangements, Permutations & Combinations

Minimal Spanning Tree Problems in What is a minimal spanning tree An MST is a tree (set of edges) that connects all nodes in a graph, using.

15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.

Divide and Conquer Optimization problem: z = max{cx : x  S}

PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.

Integer LP In-class Prob

Lesson 11: Nodal Analysis II

Imposing Constraints from the Source Tree on ITG Constraints for SMT Hirofumi Yamamoto, Hideo Okuma, Eiichiro Sumita National Institute of Information.

Branch and Bound Algorithms Present by Tina Yang Qianmei Feng.

Lecture.6. Table of Contents Lp –rounding Dual Fitting LP-Duality.

5-1 Copyright © 2013 Pearson Education Integer Programming: The Branch and Bound Method Module C.

Easy Substitution Assignment. 1. What are the steps for solving with substitution?

Algebra 1 Predicting Patterns & Examining Experiments Unit 7: You Should Probably Change Section 2: Making Arrangements.

Prabhas Chongstitvatana 1 Backtracking Eight queens problem 1 try all possible C 64 8 = 4,426,165,368 2 never put more than one queen on a given row, vector.

Branch and Bound Searching Strategies

Chapter 6 Optimization Models with Integer Variables.

Solving IPs – Implicit Enumeration Similar to Binary IP Branch and Bound General Idea: Fixed variables – those for which a value has been fixed. Free Variable.

Permutations and Combinations

Organic Molecule Building Block

1. Draw the precedence diagram.

ASSIGNMENT NO.-2.

5.2 Mixed Integer Linear Programming

Integer Programming Set up the mathematical programming problem to choose the set of capital investments to make that will maximize the Net Present Value.

دانشگاه شهیدرجایی تهران

A Brief Overview of Black-box Optimization.

Branch and Bound.

تعهدات مشتری در کنوانسیون بیع بین المللی

بسمه تعالی کارگاه ارزشیابی پیشرفت تحصیلی

Within Subjects (Participants) Designs

Branch and Bound Searching Strategies

ENGM 435/535 Integer Programming.

6.1 Counting Principles and Permutations

5.2 Mixed Integer Linear Programming

EMIS 8373: Integer Programming

We have the following incomplete B&B tree:

Branch-and-Bound Algorithm for Integer Program

The Shapley-Shubik Power Index

5.2 Mixed Integer Linear Programming

THANK YOU for helping make tonight possible

Presentation transcript:

> Operational Research >> Integer Programming >>> Branch and Bound method

Person-Task Problem 1.4 people {A,B,C,D} and 4 tasks {1,2,3,4} 2.The table below shows the number of minutes for each person to complete each task. 3.Each person does one task. 4.Each task needs an assigned a person. 5.Minimize total time taken. 6.How do we assign people to tasks? 7.E.g. ACDB = = 18 minutes in total. Task 1Task 2Task 3Task 4 Person A9545 Person B4356 Person C3132 Person D2426 2/16/20162John Woodward Branch and Bound

Example of Bounding Function 1.Example, calculate best value given partial assignment A??? 2.(A does task 1, other tasks are not yet assigned)? 3.The cost of assigning person A to task 1 is 9 minutes 4.Best unassigned person for 5.2 is C (1), 3 is D (2), 4 is C (2) in (minutes) 6.Note that C is assigned twice! 7.Total time = ( ) = 14 minutes. 8.We want to minimize so the bounding function is an underestimate. 2/16/20163John Woodward Branch and Bound

Branch and Bound Stage 1 Task 3Task 2Task 1Task 0 Incumbent (best complete) solution None yet A9545 B4356 C3132 D2426 PRUNED FEASIBLE PRUNED & FESIBLE 2/16/20164John Woodward Branch and Bound

Branch and Bound Stage 2 ACDC=14 BCDC=9 CBDA=13 DCCC=8 Task 3Task 2Task 1Task 0 Incumbent (best complete) solution CBDA = A9545 B4356 C3132 D2426 PRUNED FEASIBLE PRUNED & FESIBLE Feasible so is1 st incumbent. There is no point growing this node any more. promising Pruned as > 13 2/16/20165John Woodward Branch and Bound

Branch and Bound Stage 3 DCAA=12 DBCC=10 DACC=12 ACDC=14 BCDC=9 CBDA=13 DCCC=8 Task 3Task 2Task 1Task 0 Incumbent (best complete) solution CBDA = A9545 B4356 C3132 D2426 PRUNED FEASIBLE PRUNED & FESIBLE No new feasible solutions, therefore no new incumbent 2/16/20166John Woodward Branch and Bound

Branch and Bound Stage 4 DCAA=12 DBCC=10 DACC=12 BDCC=13 BCDA=12 BADC=13ACDC=14 BCDC=9 CBDA=13 DCCC=8 Task 3Task 2Task 1Task 0 Incumbent (best complete) solution BCDA = A9545 B4356 C3132 D2426 PRUNED FEASIBLE PRUNED & FESIBLE Pruned as > 12 Feasible but Pruned as > 12 promising 2/16/20167John Woodward Branch and Bound

Branch and Bound Stage 5 DBAC=11 DBCA=13 DCAA=12 DBCC=10 DACC=12 BDCC=13 BCDA=12 BADC=13ACDC=14 BCDC=9 CBDA=13 DCCC=8 Task 3Task 2Task 1Task 0 Incumbent (best complete) solution DBAC = A9545 B4356 C3132 D2426 PRUNED FEASIBLE PRUNED & FESIBLE Pruned 2/16/20168John Woodward Branch and Bound

The End Thank you for you attention Any questions. 2/16/20169John Woodward Branch and Bound