Open vehicle routing problem based on kernel route tabu search algorithm
Open vehicle routing problem based on kernel route tabu search algorithm
复制标题
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Du Gang
中科院分区：
文献类型：
--
作者：
Du Gang
提出了一种开放车辆路径问题(OVRP)，提出了核路径的概念和原理，基于核路径，设计了求解容量和距离约束的OVRP的禁忌搜索算法。该算法利用改进的通用插入(GENI)产生初始解，并基于核路径原理进行邻域运算。设计了三个邻域来扩展搜索空间。利用容量约束来控制每条路径的分布点数量，利用罚函数来处理距离。该算法用于求解多个OVRP问题，并与其他文献中的最佳结果进行了比较，分析结果证明了该算法求解OVRP的有效性。
An Open Vehicle Routing Problem(OVRP) was presented.The concept and principles of kernel route were proposed.Based on kernel route,a tabu search algorithm was designed to solve OVRP with capacity and distance constraints.This algorithm used improved GENeralized Insertion(GENI) to produce the initial solution and conduct the neighborhood operations based on kernel route principle.Three neighborhoods were designed to extend the search space.Capacity constraint was used to control the number of distribution points in each route,and penalty function was used to deal with distance constraint.The algorithm was used to solve many OVRP problems,and results were compared with the best results in other literatures.The analysis results demonstrated the effectiveness of this algorithm to solve OVRP.