主管：中国科学院
主办：中国优选法统筹法与经济数学研究会
　　　中国科学院科技战略咨询研究院
中国管理科学

中国管理科学 ›› 2007, Vol. 15 ›› Issue (6): 46-51.

• 论文 • 上一篇    下一篇

求解带时间窗的客户需求可分条件下的车辆路径问题

侯立文1, 谭家美2, 赵元1   

  1. 1. 上海交通大学安泰管理学院, 上海200052;
    2. 上海海事大学交通运输学院, 上海200135
  • 收稿日期:2006-10-23 修回日期:2007-11-26 出版日期:2007-12-31 发布日期:2007-12-31
  • 作者简介:侯立文(1972- ),男(汉族),山西人,上海交通大学安泰管理学院,副教授,博士,研究方向:决策分析和系统仿真.
  • 基金资助:

    国家自然科学基金资助项目(70501020);交通部资助项目

Solving Vehicle Routing Problem with Split Deliveries and Time Window Constraints

HOU Li-wen1, TAN Jia-mei2, ZHAO Yuan1   

  1. 1. Antai School of Management, Shanghai Jiaotong University, Shanghai 200052, China;
    2. College of Transport and Communication, Shanghai Maritime University, Shanghai 200135, China
  • Received:2006-10-23 Revised:2007-11-26 Online:2007-12-31 Published:2007-12-31

PDF (PC)

1810

被引次数

26

摘要： 物流运输中的车辆路径问题历来是一个重要的理论和实际问题,在同时考虑客户需求可分以及客户方和配送中心时间窗限制的前提下,重新构造了问题模型,并结合蚂蚁算法中转移概率的改进和最大—最小蚂蚁系统,设计了问题求解过程和分割点选取规则,计算结果显示出算法的可行性。另外还与客户需求不可分的情况进行了对比,从而说明在大规模物流运输需求下,可分能带来更好的效果。

关键词: 车辆路径问题, 最大—最小蚂蚁系统, 客户需求可分, 时间窗

Abstract: Vehicle routing problem in logistic industry is always considered as one of important theoretical and practical issues. This paper redesigned the model of the problem based on split deliveries of customer demand and time window assigned to customer and distribution center. And the new rule to select split points related to customer places is also demonstrated in order to decide the computing process. Thus the Max-Min ant system incorporated with improved transition probability of basic ant algorithm is employed to compute the model. The result indicated that not only the algorithm is feasible and valid but also adoption of split deliveries does justify the mode compared with non-split deliveries vehicle routing problem.

Key words: vehicle routing problem, max-minant system, split deliveries, time windows

中图分类号: