Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

In “Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm,” Uit het Broek, Schrotenboer, Jargalsaikhan, Roodbergen, Coelho present generic branch-and-cut framework to solve routing problems with multiple depots on directed graphs. They new valid inequalities that eliminate subtours, enforce tours be linked the same depot, bounds number of customers in vehicle tour. This is embedded scheme also contains generalized adapted versions are well known for related problems. The authors show tighten root node relaxations considerably. combination simple but effective upper-bound procedure, only requiring MIP solver smart reduction problem size, overall solves instances considerably larger size optimality than have been reported literature.