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

More documents

Recommendations

Info

Solving the CVRP - cuts • Cuts – all from Lysgaard, Letchford & Eglese (2004): – Capacity, framed capacity, strengthened comb, 2 edges hypotour, homogeneous multistar • A new family of inequalities: – subtour-depot
Disjunctive cuts for the CVRP • Step 1: all ”normal cuts” are separated. Repeat as long as violated cuts are identified. • Step 2: Construct cut-finding LP based on compact formulation and already identified cuts. Solve. • Step 3: Optional: Improve cut-finding LP by column generation. Generate columns from capacity inequalities.
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: Compact formulation
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 and 40: Results - ESPPCC Gap (%) Cap cuts 0
Page 41 and 42: Effects of parameters Gap (%) Gap c
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?