基于贪心策略的一对多集送货车辆路径优化  

VRP of One-to-many Collecting and Delivering Vehicles Based on Greedy Strategy

作　　者：闵嘉宁[1,2] 

机构地区：[1]无锡太湖学院,江苏无锡214064 [2]西北大学经济管理学院,陕西西安710127

出　　处：《物流技术》2015年第13期163-166,共4页Logistics Technology

基　　金：江苏省教育厅项目(13KJD520009;14KJB520036)

摘　　要：针对集货点和送货点一对多的车辆路径优化问题,研究了基于贪心策略的两阶段路径算法TSGSA,求解了有最大行驶里程约束、时间窗约束、开放式、一对多集送货车辆路径问题;建立了数学模型,并用实例验证了算法的可行性和有效性。在此基础上,讨论了时间窗约束对路径优化的影响,展示了从开放式运行模式转变为封闭式运行模式算法的变化和运算结果。研究表明利用TSGSA算法可获得较好的优化结果。In this paper, for the purpose of the routing problem of the vehicles servicing multiple collection and delivery points, we studied the two-stage greedy selection algorithm （TSGSA）, solved the open-ended one-to-many collecting and delivering vehicle routing problem with travel distance and time window constraints, and then through an empirical case, demonstrated the feasibility and validity of the algorithm. On such basis, we discussed the influence of the time window constraint on the optimization result and then presented the change from the open-ended operation mode to the close-ended operation mode.

关 键 词：路径优化 贪心策略 一对多集送货 时间窗约束 

分 类 号：F252.14[经济管理—国民经济]