摘要
时相关车辆路径问题是研究时变路网环境下的车辆路径优化问题。首先,分别采用阶跃函数和分段连续函数描述不同路径上的跨时段行驶速度和威胁度,将路径时间指标和路径威胁指标表示成时相关函数;其次,为提高搜索效率,对传统A*算法进行改进,在启发函数中增加了最短路径中当前结点的父结点信息,构造了包含里程指标、时间指标和威胁指标的时相关启发函数;最后,构造了包含100个结点、190条路径的车辆机动保障路网模型,通过仿真验证了该算法的有效性。
Time- dependent vehicle routing problem （TDVRP） is concerned with vehicle routing optimization in road networks with fluctuant link travel time. Firstly, Time - dependent functions about routing time cost and routing threat cost are introduced. Secondly, a time - dependent heuristic function including routing distance cost, routing time cost and routing threat cost is constructed, and an im- proved A ＊ algorithm is promoted for TDVRP, where the farther information is included in the algorithm to improve search efficiency. Finally, a road network of vehicle support in troop transportation involving 100 nodes and 190 roads is constructed, and the algorithm is validated by using simulations.
出处
《控制工程》
CSCD
北大核心
2012年第5期750-752,756,共4页
Control Engineering of China
关键词
时相关车辆路径问题
启发式算法
威胁
时相关启发函数
time -dependent vehicle routing problem
heuristic algorithm
threat
time -dependent heuristic function
