摘要
对多配送中心车辆路径问题进行描述,并建立该问题的数学模型,设计了求解多配送中心车辆路径问题的两阶段算法。第一阶段把多配送中心车辆路径问题转化成单配送中心车辆路径问题,提出基于边界客户分配法的转化策略;第二阶段对单配送中心车辆路径问题进行求解,采用禁忌搜索算法进行优化求解,最后表明算法的有效性和可行性。
The multi-depot vehicle routing problem is described and the mathematic model is built in this paper.Moreover,the two-phase algorithm for the problem is designed.In the first phase,the multi-depot vehicle routing problem is divided into several single-depot vehicle routing problems by using the tactics of borderline customers＇ distribution method.In the second phase,the several single-depot vehicle routing problems are solved by using Taboo search algorithm.Finally,the computational results demonstrate the efficiency and feasibility of the two-phase algorithm.
出处
《三明学院学报》
2010年第6期517-520,共4页
Journal of Sanming University
关键词
物流
车辆路径
多配送中心
两阶段算法
logistics
vehicle routing
multi-depots
two-phase algorithm
