期刊文献+

汽车零部件入厂物流循环取货路径规划 被引量:2

下载PDF
导出
摘要 该文采用禁忌搜索算法对汽车零部件入厂物流的循环取货作业进行路径规划。基于循环取货的要求设计数学模型,并根据问题的特点来设计禁忌搜索算法中的编码、搜索邻域、选择禁忌表等,对路径进行求解。运用禁忌搜索算法求解循环取货问题的路径,通过比较可知,禁忌搜索得出总路径长度比扫描法得出的路径缩短了8.83%,比传统直送模式缩短了64.72%,并大大提高了汽车装载率。通过对数据结果的分析表明,循环取货能大幅降低物流成本,实现准时化生产;该文设计的数学模型和构造禁忌搜索算法是可行的,能高效地解决路径规划问题。
出处 《中国新技术新产品》 2021年第20期126-129,共4页 New Technology & New Products of China
基金 2021年黑龙江省大学生创新创业训练计划项目(项目编号:S202110225240)。
  • 相关文献

参考文献2

二级参考文献30

  • 1钟石泉,杜纲,贺国光.有时间窗的开放式车辆路径问题及其遗传算法[J].计算机工程与应用,2006,42(34):201-204. 被引量:25
  • 2Nagata Y, Brgtysy O, Dullaert W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows [J]. Computers & Operations Research, 2010,37(4) : 724-737.
  • 3Schneider M, Sand B, Stenger A. A note on the time travel approach for handling time windows in vehicle routing problems[J]. Computers Operations Research, 2013, 40 (10) : 2564-2568.
  • 4Zhang Z, Qin H, Zhu W, et al. The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach[J]. European Journal of Operational Research, 2012 (220) : 295-304.
  • 5Ngueveu S U,Prins C, Wolfler Calvo R. An effective memetic algorithm for the cumulative capacitated vehicle routing problem[J]. Computers & Operations Research, 2010,37 (11) : 1877-1885.
  • 6Liberatore F, Righini G, Salani M. A column generation algorithm for the vehicle routing problem with soft time windows[J]. A Quarterly Journal of Operations Research, 2011,1(9) :49-82.
  • 7Tan K C, Lee L H, Zhu Q L, et al. Heuristic methods for vehicle routing problem with time windows [J ]. Artificial intelligence in Engineering, 2001,15 (3) : 281-295.
  • 8Baker B M, Ayechew M A. A genetic algorithm for the vehicle routing problem[J]. Computers & Operations Research,2003, 30(5) : 787-800.
  • 9Ropke S, Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows[J]. Transportation science, 2006,40 (4) : 455-472.
  • 10Ibaraki T, Imahori S, Kubo M, et al. Effective local search algorithms for routing and scheduling problems with general time-window constraints[J]. Transportation Science, 2005, 39 (2) : 206-232.

共引文献13

同被引文献27

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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