Detour Dual Optimal Inequalities for Column Generation with Application to Routing and Location
Julian Yarkony, Naveed Haghani, Amelia Regan

TL;DR
This paper introduces Detour Dual Optimal Inequalities (DOI) to accelerate column generation in logistics problems like vehicle routing and facility location, improving convergence without weakening LP relaxations.
Contribution
The paper proposes a novel Detour-DOI method that enhances column generation efficiency by allowing low-cost swap operations, applicable to various logistics optimization problems.
Findings
Detour-DOI speeds up convergence of column generation.
Applicable to vehicle routing and facility location problems.
Maintains strength of linear programming relaxation.
Abstract
We consider the problem of accelerating column generation (CG) for logistics optimization problems using vehicle routing as an example. Without loss of generality, we focus on the Capacitated Vehicle Routing Problem (CVRP) via the addition of a new class of dual optimal inequalities (DOI) that incorporate information about detours from the vehicle routes. These inequalities extend the Smooth-DOI recently introduced in the literature for the solution of certain classes of set-covering problems by CG. The Detour-DOI introduced in this article permit low cost swap operations between items on a given active route with items near to other items on that route to estimate (and bound) the values of the dual variables. Smooth-DOI in contrast only permit low cost swap operations between nearby items. The use of Detour-DOI permits a faster convergence of CG without weakening the linear programming…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Facility Location and Emergency Management · Optimization and Packing Problems
