摘要
在对多配送中心车辆调度问题进行直观描述的基础上,建立了该问题的数学模型。提出了采用距离最近分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略.基于求解单配送中心车辆调度问题的禁忌搜索算法,设计了求解多配送中心车辆调度问题的算法,并进行了实验计算.计算结果表明,用本文设计的算法求解多配送中心车辆调度问题,不仅可以取得很好的计算结果,而且算法的计算效率较高,收敛速度较快,计算结果也较稳定.
On the basis of intuitionistic description of the multi-depot vehicle scheduling problem, many mathematic models of the problem is built in this paper. The solving tactics of dividing a multi-depot vehicle scheduling problem into several single-depot vehicle scheduling problems by using the minimum distance distribution method is presented. The algorithm for the multi-depot vehicle scheduling problem is designed based on the taboo search algorithm for single-depot vehicle scheduling problem. The computational results demonstrates that the high quality solutions to the multi-depot vehicle scheduling problem can be obtained by using the new algorithm and the algorithm is also efficient and robust.
出处
《交通运输系统工程与信息》
EI
CSCD
2006年第5期65-69,共5页
Journal of Transportation Systems Engineering and Information Technology
关键词
多配送中心车辆调度问题
模型
算法
multi-depot vehicle scheduling problem
model
algorithm
