Decomposition Techniques For Vehicle Routing

Abstract

We will review basic decomposition techniques for mixed integer linear programming including Dantzig-Wolfe and Benders decomposition and then see how they can be used to develop high-performance algorithms for solving routing and scheduling problems.

Short bio

Edward Lam develops algorithms and solvers for combinatorial optimization, with applications to large-scale operations planning problems in logistics, transportation and warehousing. His research integrates integer programming, constraint programming, and heuristic search via decomposition methods to solve larger problems faster than standard approaches, with several of his solvers achieving world-leading performance on benchmark problems.