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

More documents

Recommendations

Info

Best methods for the CVRP currently • Fukasawa, Longo, Lysgaard, Poggi de Aragão, Reis, Uchoa, Werneck (2005) – Solves most instances to optimality • Baldacci, Christofides, Mingozzi (2008) – Solves fewer instances to optimality but is faster on the instances that both methods solve.
Best methods for the CVRP • FLLPRUW05 = Fukasawa, Longo, Lysgaard, Poggi de Aragão, Reis, Uchoa, Werneck (2005), Pentium IV (2.4 GHz) • Disjunctive cuts code run on AMD Opteron (2.4 GHz) FLLPRUW05 Disj. cuts BB time BB time Nodes (s) Nodes (s) A-set (average) 115 2050 146 1549 E-n76-k7 1712 46520 1280 22117 E-n76-k8 1031 22891 980 22685 E-n76-k10 4292 80722 2644 30451 E-n76-k14 6678 48637 - -
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 and 40: Results - ESPPCC Gap (%) Cap cuts 0
Page 41: Effects of parameters Gap (%) Gap c
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?