高技术通讯2017，Vol.27Issue(1)：72-80,9.DOI:10.3772/j.issn.1002-0470.2017.01.009
基于蚁群算法的双分区仓库拣货路径的优化
Picking routing optimization for in 2-block warehouses based on ant colony algorithm
摘要
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 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.关键词
物流/拣货/车辆路径/蚁群算法Key words
logistics/picking/vehicle routing/ant colony algorithm引用本文复制引用
刘建胜,熊峰,陈景坤,熊君星..基于蚁群算法的双分区仓库拣货路径的优化[J].高技术通讯,2017,27(1):72-80,9.基金项目
国家自然科学基金(51565036)资助项目. （51565036）
