Compact Formulations for Split Delivery Routing Problems
针对拆分配送路径问题，提出了避免使用车辆或访问次数索引变量的紧凑型公式，能处理带时间窗的变体，计算实验表明其性能优于现有紧凑公式，并开发了分支切割算法，首次证明95个实例的最优性。
Split delivery routing problems are concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost, where a customer can be served by more than one vehicle if beneficial. They generalize traditional variants of routing problems and have applications in commercial and humanitarian logistics. Previously, formulations involving only commonly used arc-based variables have provided only relaxations for split delivery variants, as the possibility of visiting customers more than once introduces modeling challenges. The only known compact formulations are based on variables indexed by vehicle or by visit number and perform poorly when using general-purpose integer programming software. We present compact formulations that avoid the use of these types of variables and that can model split delivery routing problems with and without time windows. Computational experiments demonstrate their superior performance over existing compact formulations. We also develop a branch-and-cut algorithm that balances the efficiency derived from a relaxed formulation with the strength derived from one of the proposed formulations and demonstrate its efficacy on a large set of benchmark instances. The algorithm solves 95 instances to proven optimality for the first time and improves the best known lower and/or upper bound for many other instances.