|
|||||
|
|
| 铁路行包配送车辆路径问题模型及算法 | |
| 引用本文： | 卜雷,尹传忠,赵宜.铁路行包配送车辆路径问题模型及算法[J].同济大学学报(自然科学版),2007,35(8):1069-1073. |
| 作者姓名： | 卜雷 尹传忠 赵宜 |
| 作者单位： | 1. 同济大学,交通运输工程学院,上海,200331 2. 上海海事大学,交通运输学院,上海,200135 3. 深圳大学,经济学院,广东,深圳,518060 |
| 摘 要： | 铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题.结合该问题特点,建立数学优化模型.求解算法中采用基于最近邻居的启发式方法产生尽可能好的初始解,并通过构造合理的邻域结构,引入适合的罚函数评价解的质量,随机选取禁忌长度的禁忌搜索算法优化初始解.以5台车辆、21个配送点的实例进行仿真计算,计算结果表明,模型及算法有效可行. |
| 关 键 词： | 物流配送 车辆路径 送货同时集货 禁忌搜索 优化模型 铁路行包 |
| 文章编号： | 0253-374X（2007）08-1069-05 |
| 修稿时间： | 2005-11-25 |
Model and Algorithm of Vehicle Routing Problem on Railway Baggage and Parcel |
|
| BU Lei,YIN Chuanzhong,ZHAO Yi.Model and Algorithm of Vehicle Routing Problem on Railway Baggage and Parcel[J].Journal of Tongji University(Natural Science),2007,35(8):1069-1073. | |
| Authors: | BU Lei YIN Chuanzhong ZHAO Yi |
| Institution: | 1. School of Transportation Engineering,Tongii University,Shanghai 200331 ,China; 2. School of Traffic and Transport, Shanghai Maritime University, Shanghai 200135, China ; 3. School of Economics, Shenzhen University, Shenzhen 518060, China |
| Abstract: | Vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up. An optimum model with the consideration of the characteristics of this problem is set up. In the algorithm, an initial solution is obtained by a nearest neighbor heuristic, and initial solution by tabu search algorithm which constructing reasonable neighborhood, introducing appropriate punishment function and selecting tabu length randomly. Simulation calculation of five vehicles and twenty-one delivery spots shows that this model and algorithm are effective and feasible. |
| Keywords: | logistics delivery vehicle routing problem simultaneous delivery and pick up tabu research optimum model railway baggage and parcel |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |