| 有时间窗的集货送货一体化车辆路径规划启发式算法研究 |
| |
| 引用本文： | 霍佳震,张磊. 有时间窗的集货送货一体化车辆路径规划启发式算法研究[J]. 物流技术, 2004, 0(5): 64-66 |
| |
| 作者姓名： | 霍佳震 张磊 |
| |
| 作者单位： | 同济大学,经济与管理学院,上海,200092 |
| |
| 摘 要： | 通过对模型的分析、分解和过滤,结合实际情况,以修正的Clarke-Wright节约启发式算法为基础进行插入式排序,以解决带有时间窗口的集货和送货一体化车辆路径规划问题(pickup-delivery problem)。
|
| 关 键 词： | 第三方物流 C-W算法 车辆路径规划(VRP) PDP |
| 文章编号： | 1005-152X(2004)05-0064-03 |
| 修稿时间： | 2004-02-06 |
Study on Heuristic Algorithm for Picking-delivery Problem with Time Window Constraint |
| |
| HUO Jia-zhen,ZHANG Lei. Study on Heuristic Algorithm for Picking-delivery Problem with Time Window Constraint[J]. Logistics Technology, 2004, 0(5): 64-66 |
| |
| Authors: | HUO Jia-zhen ZHANG Lei |
| |
| Abstract: | Based on analysis, decomposition and Clarke-Wright algorithm, the paper uses a saving/Inserting algorithm to solve the picking-delivery problem with time window constraint, and analyzes it with an example. |
| |
| Keywords: | TPL C-W algorithm vehicle route planning picking-delivery problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
