|
|||||
|
|
| 基于需求划分的带软时间窗的路径优化方法 | |
| 引用本文： | 魏俊华,王安麟,童毅.基于需求划分的带软时间窗的路径优化方法[J].公路交通科技,2005,22(10):163-166. |
| 作者姓名： | 魏俊华 王安麟 童毅 |
| 作者单位： | 1. 上海交通大学机械学院机电设计与自动化技术研究所,上海,200030 2. 同济大学机械工程学院,上海,200092 3. 上海科道物流有限公司,上海,200030 |
| 摘 要： | 针对带有时间窗约束的车辆路径问题(Vehicle Routing Problem With Time Windows,VRPTW)的NP特征,以非完全连通配送网络为研究对象,用带有软时间窗约束的整体配送费用最小为目标,提出了一种基于需求的城市动态划分方法,有效的减少了路径的组合规模,并且用遗传算法将其实现,通过改进的Dijkstra算法求取其基于动态划分的最优配送路径集,最后计算示例验证了本文方法的有效性。 |
| 关 键 词： | 动态划分 时间窗 路径优化 遗传算法 |
| 文章编号： | 1002-0268(2005)10-0163-04 |
| 收稿时间： | 2004-07-06 |
| 修稿时间： | 2004年7月6日 |
The Optimal Approach of Vehicle Route with Time Window Based on Genetic Algorithm: Dynamic Partition of Demand |
|
| WEI Jun-hua,WANG An-lin,TONG Yi.The Optimal Approach of Vehicle Route with Time Window Based on Genetic Algorithm: Dynamic Partition of Demand[J].Journal of Highway and Transportation Research and Development,2005,22(10):163-166. | |
| Authors: | WEI Jun-hua WANG An-lin TONG Yi |
| Institution: | 1. School of Mechanical Engineering, Shanghai Jiaotong University, Shanghai, 200030, China; 2. School of Mechanical Engineering, Tongji University, Shanghai 200092, China; 3. Shanghai COTAO Logistics Technologies Co., Ltd, Shanghai 200030, China |
| Abstract: | Aiming at the NP characteristic of VRPTW(Vehicle Routing Problem with Time Windows),with unentire connection network as the study object,and minimal total cost with time windows as the optimal target,this paper presented an approach of cities dynamic partition based on demands,which reduced the combination scale of vehicle routes.Furthermore,the genetic algorithm of this approach was structured.The optimal route set based on demand partition was obtained through improved Dijkstra algorithm.The simulating result indicates that the dynamic partition method of demand is effective. |
| Keywords: | Dynamic partition Time window Route optimal Genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |