首页> 外文会议>Evolutionary Computation in Combinatorial Optimization >Efficient Local Search Limitation Strategies for Vehicle Routing Problems
【24h】

Efficient Local Search Limitation Strategies for Vehicle Routing Problems

机译:车辆路径问题的有效本地搜索限制策略

获取原文
获取原文并翻译 | 示例

摘要

In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful memetic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.
机译:在本文中,我们研究了五种不同的策略来限制车辆路径问题中的局部搜索邻域。车辆路线问题涉及将一组运输订单分配给一组车队,以及为每辆车安排停靠点的顺序,以最大程度地减少运输成本。所研究的策略应用于三个标准邻域,并在最近建议的功能强大的模因算法中实现。针对26个众所周知的基准问题的实验结果表明,在不降低解决方案质量的前提下,速度提高了近80%。相反,在12种情况下获得了新的最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号