| 需求可分的车辆路径问题模型与算法 |
| |
| 引用本文： | 谢秉磊,胡小明,张一喆.需求可分的车辆路径问题模型与算法[J].运筹与管理,2012,21(3):72-76. |
| |
| 作者姓名： | 谢秉磊 胡小明 张一喆 |
| |
| 作者单位： | 1. 哈尔滨工业大学深圳研究生院,广东深圳,518055
2. 哈尔滨工业大学经济与管理学院,黑龙江哈尔滨,150001 |
| |
| 基金项目： | 国家软科学研究计划资助项目，国家自然科学基金资助项目 |
| |
| 摘 要： | 需求可分的车辆路径问题(SDVRP)无论是从运输距离还是派车数量上,都可进一步优化传统的车辆路径问题。为了降低SDVRP的求解难度,本文在分析最优解性质的基础上,加强模型的约束条件,将原模型转变为等价的改进SDVRP,并在使用蚂蚁算法求解改进SDVRP模型的过程中,采用开发新路径和2-opt相结合的方法,以避免出现迭代停滞的现象。实验表明,算法计算结果稳定,最差解与最好解的偏差仅为1.80%。
|
| 关 键 词： | 物流管理 车辆路径问题 蚂蚁算法 需求可分 |
A Model and Algorithm to Solve Vehicle Routing Problem with Split Delivery |
| |
| XIE Bing-lei
,
HU Xiao-ming
,
ZHANG Yi-zhe.A Model and Algorithm to Solve Vehicle Routing Problem with Split Delivery[J].Operations Research and Management Science,2012,21(3):72-76. |
| |
| Authors: | XIE Bing-lei HU Xiao-ming ZHANG Yi-zhe |
| |
| Institution: | zhe2(1.Shenzhen Graduate School,Harbin Institute Technology,Shenzhen 518055,China;2.School of Economics and Management,Harbin Institute Technology,Harbin 150001,China) |
| |
| Abstract: | Vehicle routing model with split delivery(SDVRP)can optimize further traditional vehicle routing problem in both transportation distance and the number of dispatching vehicle.To reduce the difficulty with the solution to SDVRP,based on analyzing properties of the optimal solution,the original model is transformed to the equivalent modified SDVRP through enforcing constraints of the original model.In the process of solving the modified SDVRP model with ant colony algorithm,exploring new routes and 2-opt are combined to avoid premature convergence.The experiments demonstrate that the computing results are stable: The bias between the worst solution and the best solution is only 1.80%. |
| |
| Keywords: | logistics management vehicle routing problem ant colony algorithm split deliveries |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
