An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems
研究了结合车辆路径与卡车司机调度的组合问题，考虑司机工时法规约束，提出了首个能证明最优性的分支定价算法。
In most developed countries working hours of truck drivers are constrained by hours of service regulations. When optimizing vehicle routes, trucking companies must consider these constraints to assure that drivers can comply with the regulations. This paper studies the combined vehicle routing and truck driver scheduling problem (VRTDSP), which generalizes the well-known vehicle routing problem with time windows by considering working hour constraints. A branch-and-price algorithm for solving the VRTDSP is presented. This is the first algorithm that solves the VRTDSP to proven optimality.