摘要
多行程车辆路径问题是标准车辆路径问题的一个变体,每个车辆在运行期间可以使用不止一次.对于这种NP-HARD问题,提出了1个改进变邻域搜索算法并设计了4个邻域结构用于求解和制定多行程路径问题的调度规划.该算法测试了1组标准实例问题,获得的解决方法与文献中提出的5种算法进行比较,并得到了较好的结果.
The vehicle routing problem with multiple paths is a variant of the standard VRP,where each vehicle can be used more than once during the working period.For this NP-Hard problem,this paper proposes an improved variable neighborhood search algorithm in which four neighborhood structure are designed to find the planning of paths.The algorithm is tested on a set of benchmark problems and the obtained solutions are compared with five previously proposed algorithms.Encouraging results are obtained.
出处
《武汉理工大学学报（交通科学与工程版）》
2017年第1期27-31,共5页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
河南省科技攻关基金项目资助(142102210231)
关键词
车辆路径问题
多行程
变邻域搜索
抖动
vehicle routing
multipath
variable neighborhood search
shaking
作者简介
宋强（1971-）：男,副教授,博士生,主要研究领域为计算机控制技术与算法优化
