A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing

A branch-price-and-cut algorithm is developed for a complex maritime inventory-routing problem with varying storage capacities and production/consumption rates at facilities. The resulting mixed-integer pricing problem is solved exactly and efficiently using a dynamic program that exploits certain extremal characteristics of the pricing problem. The formulation is tightened by using the problem's boundary conditions in preprocessing and to restrict the set of columns that are produced by the pricing problem. Branching schemes and cuts are introduced that can be implemented efficiently and that preserve the structure of the pricing problem. Some of the cuts are inspired by the capacity cuts known for the vehicle-routing problem, whereas others specifically target fractional solutions brought about by individual vessels competing for limited inventory at load ports and limited storage capacity at discharge ports. The branch-price-and-cut approach solves practically sized problems motivated by the operations of an oil company to optimality, and it provides reasonable bounds for larger instances.