论文标题
多台车辆调度问题启发式方法
Multiple-Depot Vehicle Scheduling Problem Heuristics
论文作者
论文摘要
在运输系统的计划过程中，多部门车辆调度问题（MDVSP）非常重要。它包括为一组车辆分配一组旅行，以最大程度地减少一定的总成本。我们基于经典的整数线性编程公式和图理论方法，为MDVSP介绍了三个快速可靠的启发式方法，以固定从整数解决方案收集的不可行的子量。使用大量基准实例进行了广泛的实验表明，与其他现有启发式方法相比，我们的启发式方法更快，可以给出良好甚至更好的结果。
The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is very important in the planning process of transport systems. It consists in assigning a set of trips to a set of vehicles in order to minimize a certain total cost. We introduce three fast and reliable heuristics for MDVSP based on a classical integer linear programming formulation and on graph theoretic methods of fixing the infeasible subtours gathered from an integer solution. Extensive experimentations using a large set of benchmark instances show that our heuristics are faster and give good or even better results compared with other existing heuristics.
