摘要
本文对有时间窗的车辆调度问题进行了分析,提出了以网络优化为基础的启发式算法.算法中引入重载点,把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题.利用最小费用最大流算法求解有确定开始时间的车辆调度问题,再根据检验数来调整开始时间值.并用实例进行了验证.最后对算法的适用性及进一步应用进行了讨论.
In this paper,based on the analysis for characteristics of vehicle scheduling problem with timw windows (TWVSP), a network optimum heuristics is presented. In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP). The STVSP is solved by the algorithm of the minimum-cost maximum flow,then the time is adjusted according to the increased objective function coefficient. An example is applied to this algorithm. Finally, the adaptability and more application of this method is discussed.
出处
《系统工程》
CSCD
1999年第2期66-71,共6页
Systems Engineering
基金
国家自然科学基金资助目(编号79700019)
关键词
车辆调度
时间窗
重载点
启发式算法
货物运输
Vehicle scheduling, Time windows, LOADED POINT, Increased objective function coefficient
