Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad

More documents

Recommendations

Info

Results Time limit: 2 hour 83 of the instances Have been solved in the literature (however, not in two hours) Solved (of 86) Cap cuts 67 Cap cuts+Disj. Cuts 68 All std cuts 68 All cuts (+DC) 68 ESPPCC - All std cuts - ESPPCC - All cuts (+DC) 61
Effects of parameters Gap (%) Gap closed (%) Time sep. (s) Cap only 0.94 Std. disj cuts. 0.57 40 77 No strength 0.62 34 54 No col. Gen. 0.72 23 14 no CG no str. 0.77 18 12 No node set disj. 0.57 40 71 Aggressive 0.46 51 243 Reduced set of instances (A-set)
Page 1 and 2: Disjunctive cuts in branch-and-but-
Page 3 and 4: Motivation • Our goal: Solve diff
Page 5 and 6: Motivation: Branch-cut-and-price
Page 7 and 8: Our candidate: Disjunctive cuts in
Page 9 and 10: Our IP problem (compact formulation
Page 11 and 12: Our IP problem (compact formulation
Page 15 and 16: Objective x 2 x 1 1 2 3 4 5 6 7
Page 17: Objective x 2 x 1 1 2 3 4 5 6 7
Page 24: Separation algorithm
Page 29 and 30: Compact formulation
Page 31 and 32: Disjunctive cuts for the CVRP • S
Page 33 and 34: Solving the CVRP - Pricing • Shor
Page 35 and 36: Results - SPPCC-2CE Gap (%) Gap clo
Page 37 and 38: Results - SPPCC-2CE Gap (%) Gap clo
Page 39: Results - ESPPCC Gap (%) Cap cuts 0
Page 43 and 44: Best methods for the CVRP • FLLPR
Page 45 and 46: Used in a framework that does autom

Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad

Create successful ePaper yourself

Delete template?

Save as template?