期刊文献+

基于遗传算法的带时间窗车辆路径问题模型

下载PDF
导出
摘要 通过引入惩罚函数,建立适应度函数的带时间窗车辆路径问题的遗传算法模型,确认先后级与编码、得到原始集体、确定终止准则,得出带时间窗车辆路经问题最优解。结果表明:遗传算法因为提升了检索速度,并通过不断的轮换、穿插、变形获取最佳适应度,不断完善初始解,使得在解决带时间窗车辆路径问题取得了很好的成效。
作者 苏扬
出处 《现代商贸工业》 2017年第3期197-198,共2页 Modern Business Trade Industry
  • 相关文献

参考文献3

二级参考文献15

  • 1田延硕,刘晓云.一种提高局部搜索能力的混合遗传算法[J].电子科技大学学报,2006,35(2):232-234. 被引量:5
  • 2李军.有时间窗的车辆路线安排问题的启发式算法[J].系统工程,1996,14(5):45-50. 被引量:56
  • 3Geonwook Jeon, Herman R Leep, Jae Young Shim. A vehicle rou- ting problem solved by using a hybrid genetic algorithm[ J]. Com- puters & Industrial Engineering, 2007,53:680 -692.
  • 4Ziauddiu Ursani, et al. Localized genetic algorithm for vehicle rou- ting problem with time windows [ J ]. Applied Soft Computing, 2011 ,l 1:5375 - 5390.
  • 5Yves Rochat, Eric D Taillard. Probabilistic diversification and in- tensification in local search for vehicle routing problem[ J-. Journal of Heuristic, 1995,1:147 - 167.
  • 6Yannis Marinakis. Multiple phase neighborhood search - GRASP for the capacitated vehicle routing problem [ J ]. Expert Systems with Applications, 2012,39:6807 - 6815.
  • 7Thomas A Feo, Mauricio G C Resende. Greedy randomized adap- tive search procedures[J]. Journal of Global Optimization, 1995,6 (1995) :109 - 134.
  • 8Yannis Marinakis, Athanasion Migdalas. Expanding neighborhood GRASP for the traveling salesman problem [ J ]. Computational Optimization and Applications, 2005,32(2005 ) :231 -257.
  • 9Jari Kytfijoki, et al. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems [ J ]. Com- puters & Operations Research, 2007,3g :2743 -2757.
  • 10Bruce L Golden, S Raghavan, Edward A Wasil. The vehicle rou- ting problem [ M ]. NewYork: Springer - Verlag New York Inc, 2010.

共引文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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