期刊文献+

求解车辆路径问题的改进扰动机制的ILS算法 被引量:1

Iterated Local Search Algorithm with Improved Perturbation Mechanism for Vehicle Routing Problem
下载PDF
导出
摘要 针对车辆路径问题,提出一种改进的迭代局部搜索(ILS)算法。该算法基于破坏再重建(Ruin and Recreate)的思想,设计了一种新的扰动机制。扰动过程包含破坏和重建两个阶段,即先使用一种兼顾随机性和相关性的破坏方法对解进行破坏,并引入扰动因子控制解的破坏强度,然后再随机选择基本贪婪插入和改进贪婪插入算法完成解的修复。利用国际标准测试案例对常规扰动机制和改进后的扰动机制进行了测试,并与量子进化算法、蜂群算法进行了比较,实验结果表明改进后的ILS算法更加有效。 This paper proposed an iterated local search(ILS)algorithm with a new perturbation mechanism for vehicle routing problem.The perturbation mechanism is based on ruin and recreating principle,which includes destroying and repair procedures.The best local neighborhood solution is firstly destroyed by a method which takes randomness and correlation into account.In the destroying process,aperturbation factor is also introduced into the perturbation mechanism to control the strength of destroying.And then the destroyed solution is repaired by randomly selecting basic greedy insertion and regret greedy insertion algorithms.The experiments on the benchmark instances prove that the developed algorithm is more effective when compared with quantum evolutionary algorithm and artificial bee colony.
出处 《计算机科学》 CSCD 北大核心 2016年第1期264-269,共6页 Computer Science
基金 国家自然科学基金项目(41401461) 河南省教育厅自然科学重点项目(15A520009)资助
关键词 车辆路径问题 迭代局部搜索 破坏再重建 元启发 Vehicle routing problem Iterated local search Ruin and recreate Metaheuristic
  • 相关文献

参考文献18

  • 1Toth P, Vigo D. The vehicle routing problem [M]//The vehicle routing problem:Society for Industrial and Applied Mathematic Philadelphia. 2002 : 245-247.
  • 2Gendreau M, Potvin J Y. The Vehicle Routing Problem: Latest Advances and New Challenges [M]. New York:Springer,2008: 143-169.
  • 3Laporte G. Fifty years of vehicle routing [J]. Transportation Science, 2009,43 (4) : 408-416.
  • 4Gendreau M,Potvin J Y. Handbook of Metaheuristics(2nd Edi- tion) [ M]. New York: Springer, 2010 : 368-370.
  • 5Vidal T,Crainic T G,Gendreau M,et al. Heuristics for multi-at- tribute vehicle routing problems: A survey [J]. European Jour- nal of Operational Research, 2013,231 (1) : 1-21.
  • 6陈萍,黄厚宽,董兴业.基于多邻域的车辆路径优化迭代局部搜索算法[J].北京交通大学学报,2009,33(2):1-5. 被引量:5
  • 7Penna P H V, Subramanian A, Ochi L S. An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem [J]. Journal of Heuristics,2013,19(2): 201-232.
  • 8Subramanian A, Penna P H V, Uehoa E, et al. A hybrid algo- rithm for the Heterogeneous Fleet Vehicle Routing Problem [J]. European Journal of Operational Research, 2012 (221 ) : 285- 295.
  • 9Subramanian A, Drummond L M A, Bentes C, et al. A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery[J]. Computers & Operations Research, 2010,37(11) : 1899-1911.
  • 10Michallet J, Prins C, Amodeo L, et al. Multi-start iterated local search for the periodic vehicle routing problem with time win- dows and time spread constraints on services[J]. Computers Operations Research, 2014,41 ( 1 ) : 196-207.

二级参考文献35

  • 1肖健梅,李军军,王锡淮.求解车辆路径问题的改进微粒群优化算法[J].计算机集成制造系统,2005,11(4):577-581. 被引量:49
  • 2肖健梅,黄有方,李军军,王锡淮.基于离散微粒群优化的物流配送车辆路径问题[J].系统工程,2005,23(4):97-100. 被引量:25
  • 3Dantzig G B, Ramser J H. The Truck Dispatching Problem[J]. Management Science, 1959,6(1) : 80 - 91.
  • 4Garey M R, Johnson D S. Computer and Intractability: A Guide to the Theory of NP-Completeness[ M ]. San Francisco: W.H. Freeman & Company, 1979.
  • 5Cordeau J F, Gendreau M, Hertz A, et al. New Heuristics for the Vehicle Routing Problem[ C]// Logistics Systems: Design and Optimization. New York: Springer, 2005 : 275 - 297.
  • 6Ergun O, Orlin J B, Steele-Feldman A. Creating Very Large Scale Neighborhoods Out of Smaller Ones by Compounding Moves[J]. Journal of Heuristics, 2006, 12(1 - 2) : 115 - 140.
  • 7Derigs U, Kaiser R. Applying the Attribute Based Hill Climber Heuristic to the Vehicle Routing Problem[J]. European Journal of Operational Research, 2007, 177 (2) : 719 - 732.
  • 8Pisinger D, Ropke S. A General Heuristic for Vehicle Routing Problems[J]. Computers & Operations Research, 2007, 34(8): 2403-2435.
  • 9Lin S W, Lee Z J, Ying K C, et al. Applying Heuristics for Capacitated Vehicle Routing problem[J]. Expert Systems with Applications, 2009, 36(2) : 1505 - 1512.
  • 10Clarke G, Wright J W. Scheduling of Vehicles From A Central Depot to A Number of Delivery Points[J]. Operations Research, 1964, 12(4) : 568 - 581.

共引文献65

同被引文献27

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部