| 有时限取送混合车辆路径问题的模型及其禁忌搜索算法研究 |
| |
| 引用本文： | 王艳玲,郎茂祥,王刚. 有时限取送混合车辆路径问题的模型及其禁忌搜索算法研究[J]. 物流技术, 2008, 27(9) |
| |
| 作者姓名： | 王艳玲 郎茂祥 王刚 |
| |
| 作者单位： | 北京交通大学,交通运输学院,北京,100044 |
| |
| 摘 要： | 研究了带时间窗的取送混合车辆路径问题.问题中,每个客户带有取货和送货两个时间窗,每个客户处的取货和送货任务可以通过访问一次全部完成,也可以分两次访问分别完成送货和取货任务.在对该类问题进行描述和取送一体化战略的基础上,建立了有时限取送混合车辆路径问题的数学模型.通过设计一种新的解的表示方法构造了该问题的禁忌搜索算法.实验计算结果表明,用该禁忌搜索算法求解有时限取送混合车辆路径问题,不仅可以取得很好的计算结果,而且收敛速度较快,计算结果也较稳定.
|
| 关 键 词： | 物流工程 时间窗 取送混合车辆路径问题 禁忌搜索算法 |
Study on the Model and Tabu Search Algorithm for Delivery and Pickup Vehicle routing Problem with Time Windows |
| |
| WANG Yon-ling,LANG Mao-xiang,WANG Gang. Study on the Model and Tabu Search Algorithm for Delivery and Pickup Vehicle routing Problem with Time Windows[J]. Logistics Technology, 2008, 27(9) |
| |
| Authors: | WANG Yon-ling LANG Mao-xiang WANG Gang |
| |
| Abstract: | The paper studies the delivery and pickup vehicle routing problem with time windows.In the problem,each customer has two time windows and the pickup/delivery at each customer can be fulfilled by being visited once or twice.On the basis on describing the problem and the pickup/delivery integrated tactics,the delivery/pickup vehicle routing problem with time windows is modeled.A tabu search algorithm for the problem is designed by using a new solution indicating method. |
| |
| Keywords: | logistics engineering time window pickup/delivery vehicle routing problem tabu search algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
