节点文献

基于蚁群算法的双分区仓库拣货路径的优化

Picking routing optimization for in 2-block warehouses based on ant colony algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 刘建胜熊峰陈景坤熊君星

【Author】 Liu Jiansheng;Xiong Feng;Chen Jingkun;Xiong Junxing;School of Mechanical and Electronic Engineering,Nanchang University;

【机构】 南昌大学机电工程学院

【摘要】 为提高现代仓库作业中拣货这一核心环节的效率,研究了仓库拣货路径的优化,提出了根据双分区仓库中拣货路径的特点,采用蚁群算法优化求解的拣货路径算法,并通过仿真将该算法的性能与传统穿越策略、S形启发式算法进行了比较。比较结果表明,以蚁群算法优化路径问题可以明显减少路径的距离,具有良好的实用性。

【Abstract】 To improve the efficency of goods picking,the key link of the hole operation of a modern warehouse,a study of picking routing optimization was conducted. According to the characteristics of the picking routing problem of a2-block warehouse,the ant colony algorithm was applied to optimization of the picking routing problem,and an effective ant colony algorithm for optimized picking routing was achieved. Its performance was compared with the traditional passing strategy,S-shape algorithm and genetic algorithm by simulation. The simulation results show that the ant colony algorithm can reduce the routing distance significantly,with the better practicality and effectiveness.

【关键词】 物流拣货车辆路径蚁群算法
【Key words】 logisticspickingvehicle routingant colony algorithm
【基金】 国家自然科学基金(51565036)资助项目
  • 【文献出处】 高技术通讯 ,Chinese High Technology Letters , 编辑部邮箱 ,2017年01期
  • 【分类号】F253.9;TP18
  • 【被引频次】18
  • 【下载频次】654
节点文献中: 

本文链接的文献网络图示:

本文的引文网络