BranchAndBound分支定界摘要.pptVIP

Branch and BoundSearching Strategies;Branch-and-bound strategy;Branch-and-bound strategy;Personnel Assignment Problem ;e.g. A partial ordering of jobs After topological sorting, one of the following topologically sorted sequences will be generated: One of feasible assignments: P1→J1, P2→J2, P3→J3, P4→J4;A Solution Tree;Cost matrix ;Cost matrix ;A reduced cost matrix can be obtained: subtract a constant from each row and each column respectively such that each row and each column contains at least one zero. Total cost subtracted: 12+26+3+10+3 = 54 This is a lower bound of our solution. ;Branch-and-Bound for the Personnel Assignment Problem;The traveling salesperson optimization problem;The traveling salesperson optimization problem;The basic idea ;Splitting;The traveling salesperson optimization problem; Table 6-5 Another Reduced Cost Matrix. ? ;Lower bound;Total cost reduced: 84+7+1+4 = 96 (lower bound)? decision tree: The Highest Level of a Decision Tree. If we use arc 3-5 to split, the difference on the lower bounds is 17+1 = 18. ;For the right subtree;For the left subtree;Upper bound;;Preventing an arc ;The 0/1 knapsack problem ;The 0/1 knapsack problem;How to find the upper bound?;The 0/1 knapsack problem;How to find the lower bound?;The knapsack problem;How to expand the tree?; 0/1 Knapsack Problem Solved by Branch-and-Bound Strategy ;;The A* algorithm ;Reasoning;Reasoning;The A* algorithm;The A* algorithm;The A* algorithm;The A* algorithm;The A* algorithm;The A* algorithm;The A* algorithm;The A* Algorithm