摘要
引入自适应大规模邻域搜索算法进行带时间窗的车辆路径问题的求解,通过移除和插入规则,分别在客户层级和路线层级上,不断地摧毁和重建解决方案,并通过局部优化策略来提高解的质量,最终得到最优的解决方案。结果表明,相较于传统的启发式算法,该算法求解此类问题的速度更快、结果更好。
In this paper, we introduced the adaptive large-scale neighborhood search algorithm into the solution of the vehicle routing problem with time window, next through the local optimization strategy, obtained the optimal solution, and at the end, by comparing it with the solution obtained using the traditional heuristic algorithm, demonstrated its superiority.
出处
《物流技术》
2015年第11期156-158,173,共4页
Logistics Technology
关键词
车辆路径问题
时间窗
自适应大规模邻域搜索算法
毁坏重建原则
vehicle routing problem
time window
adaptive large-scale neighborhood search algorithm
destruction and rebuilding principle
