3 4 8 7 12 10 9 10 3 6 10 8 2 7 0 0 UPPER LOWER 0 Branch amp Bound 3 4 8 7 12 10 9 10 3 6 10 8 ID: 324060
Download Presentation The PPT/PDF document "Branch & Bound" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Branch & Bound
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
0
UPPER =
LOWER =
0Slide2
Branch & Bound
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
2
0
UPPER =
LOWER =
2Slide3
Branch & Bound
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
3
2
0
UPPER =
LOWER =
3Slide4
Branch & Bound
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
4
3
2
0
UPPER =
4
LOWER =
4Slide5
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
3
4
3
2
0
UPPER =
3
LOWER =
3
Branch & BoundSlide6
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
3
4
3
6
2
0
UPPER =
3
LOWER =
6
Branch & BoundSlide7
3
4
8
7
12
10
9
10
3
6
10
8
2
7
0
UPPER =
3
LOWER =
7
3
4
3
6
2
7
0
Branch & BoundSlide8
Tasks are created
dynamically
Upper bound is sharedLower bound is localHalve set of feasible tours:
Explore only those paths that visit city 1 before city 2.
Branch & BoundIllustrated on Traveling Salesman ProblemSlide9
0
1
3
2
1
1
1
1
4
4
0:
0
01:
1
02:
4
03:
1
1
4
1
012:
2
013:
5
1
4
0123:
3
1
01230:
4
1
031:
5
032:
2
4
1
032:
2
Partial tour 0, 3, 2
with cost lower bound =
2
LEGEND
TSP instance
Search Tree
Halve the set offeasible tours:Only visit tours where city 1 occurs before city 2.Slide10
0
1
3
2
1
1
1
1
4
4
0:
0
01:
1
02:
4
03:
1
1
4
1
012:
2
013:
5
1
4
0123:
3
1
01230:
4
1
031:
5
032:
2
4
1
032:
2
Partial tour 0, 3, 2
with cost lower bound =
2
LEGENDupper bound =
TSP instance
Search Tree