在对多配送中心配送车辆调度问题进行直观描述的基础上,建立了该问题的数学模型,提出了采用聚类分析最短距离分配法将多配送中心车辆调度问题动态地分解为多个单配送中心车辆调度问题进行求解的策略。基于求解单配送中心车辆调度问题的竞争决策算法,设计了多配送中心车辆调度问题的分层算法,并进行了实验计算。计算比对结果表明,用本文设计的算法求解多配送中心物流配送车辆调度问题,不仅可以取得很好的计算结果,算法的计算效率较高,计算结果也较稳定,而且在聚类属性方面具有很好的扩展性。
Based on intuitive description of the multi-depot vehicle scheduling problem,mathematical model of the problem is built in this paper.Via shortest distance attribute based cluster analysis,the multi-depot vehicle scheduling problem is decomposed into multiple single-depot vehicle scheduling problems.And then a hierarchical algorithm for the multi-depot vehicle scheduling problem is designed on top of the competitive decision algorithm(CDA)for single-depot vehicle scheduling problem.The computational results demonstrate that the high quality solutions can be obtained by using the proposed algorithm.The algorithm is efficient and robust;moreover,the attributes of clustering in cluster analysis have good extensibility.