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

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

作　　者：刘建胜[1] 熊峰[1] 陈景坤[1] 熊君星[1] 

机构地区：[1]南昌大学机电工程学院,南昌330031

出　　处：《高技术通讯》2017年第1期72-80,共9页Chinese High Technology Letters

基　　金：国家自然科学基金(51565036)资助项目

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

关 键 词：物流 拣货 车辆路径 蚁群算法 

分 类 号：F253.9[经济管理—国民经济] TP18[自动化与计算机技术—控制理论与控制工程]