Developing Branch-Price-and-Cut Solver for Periodic Vehicle Routing Problems

• Established a tailored branch-price-and-cut optimization solver using C++ to address several variants of periodic vehicle routing problems (multiple day trips, multiple depots,service choice, time windows, heterogeneous fleets)

• Proposed a novel exact solution approach for a routing problem called ”periodic vehicle routing with multiple day trips”, which arises in the Linde PLC supply chain operations, for the first time in the literature

• Developing a branch-price-and-cut approach for solving robust periodic vehicle routing problems with order uncertainty under various serving policies (In progress)