| 求解带时间窗的客户需求可分条件下的车辆路径问题 |
| |
| 引用本文： | 侯立文,谭家美,赵元.求解带时间窗的客户需求可分条件下的车辆路径问题[J].中国管理科学,2007,15(6):46-51. |
| |
| 作者姓名： | 侯立文 谭家美 赵元 |
| |
| 作者单位： | 1. 上海交通大学安泰管理学院, 上海200052;
2. 上海海事大学交通运输学院, 上海200135 |
| |
| 基金项目： | 国家自然科学基金;交通部科研项目 |
| |
| 摘 要： | 物流运输中的车辆路径问题历来是一个重要的理论和实际问题,在同时考虑客户需求可分以及客户方和配送中心时间窗限制的前提下,重新构造了问题模型,并结合蚂蚁算法中转移概率的改进和最大-最小蚂蚁系统,设计了问题求解过程和分割点选取规则,计算结果显示出算法的可行性。另外还与客户需求不可分的情况进行了对比,从而说明在大规模物流运输需求下,可分能带来更好的效果。
|
| 关 键 词： | 车辆路径问题 最大-最小蚂蚁系统 客户需求可分 时间窗 |
| 文章编号： | 1003-207(2007)06-0046-06 |
| 收稿时间： | 2006-10-23 |
| 修稿时间： | 2006年10月23 |
Solving Vehicle Routing Problem with Split Deliveries and Time Window Constraints |
| |
| HOU Li-wen,TAN Jia-mei,ZHAO Yuan.Solving Vehicle Routing Problem with Split Deliveries and Time Window Constraints[J].Chinese Journal of Management Science,2007,15(6):46-51. |
| |
| Authors: | HOU Li-wen TAN Jia-mei ZHAO Yuan |
| |
| Institution: | 1. Antai School of Management, Shanghai Jiaotong University, Shanghai 200052, China;
2. College of Transport and Communication, Shanghai Maritime University, Shanghai 200135, China |
| |
| 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. |
| |
| Keywords: | vehicle routing problem max-minant system split deliveries time windows |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《中国管理科学》浏览原始摘要信息 |
| 点击此处可从《中国管理科学》下载免费的PDF全文 |
|
