计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (24): 1-3.

• 博士论坛 • 上一篇    下一篇

应急物流的分批配送规划及蚁群优化求解

徐志宇1,彭嘉臻2,许维胜1   

  1. 1.同济大学 电子与信息工程学院,上海 201804
    2.特拉华大学 交通工程系,美国 19716
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-08-21 发布日期:2011-08-21

Split delivery routing of emergency logistics and ant colony optimization

XU Zhiyu1,PENG Jiazhen2,XU Weisheng1   

  1. 1.School of Electronics and Information Engineering,Tongji University,Shanghai 201804,China
    2.Department of Transportation,University of Delaware,DE 19716,USA
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

摘要: 针对应急物流的特点,建立分批配送车辆路径规划(SDVRP)模型,实现三大目标:(1)未满足需求最少化;(2)总配送时间最短化;(3)各灾点失衡度最低化。以加权求和的方式转化为单一优化目标,分批配送也节约了救援路径数/车辆数。借鉴并改进最大-最小蚁群算法,设定信息素增量的上下限,避免了结果陷入局部最优。给出数值算例,验证了模型和算法的有效性。

关键词: 分批配送车辆路径规划(SDVRP), 多目标优化(MOP), 应急物流, 最大-最小蚂蚁系统(MMAS)

Abstract: The Split Delivery Vehicle Routing Problem(SDVRP) is applied for emergency logistics and a model is established,which aims at the minimization of (1)the unsatisfied demand,(2)the total delivery time and(3)the supply unbalance among disaster areas.The weighted aggression is performed to compromise the multiple objectives to a single one.Since the dynamic demands of disaster areas are split then satisfied,the number of relief tours and vehicles is reduced.Inspired by the Max-Min Ant System(MMAS),it sets the upper and lower limits for the increment of pheromone so as to avoid the local optima.A numeric example is presented to validate the effectiveness of the proposed model and algorithm.

Key words: Split Delivery Vehicle Routing Problem(SDVRP), Multi-objective Optimization(MOP), emergency logistics, Max-Min Ant System(MMAS)