关于仓库货物堆垛机拣选调度自动化研究  

Research on Stacker's Automation Order Picking Scheduling of AS/RS Goods

作　　者：夏莉[1] 侯世旺[2] 温海骏[1] 

机构地区：[1]中北大学机械与动力工程学院,山西太原030051 [2]怀化学院商学院,湖南怀化418000

出　　处：《计算机仿真》2016年第3期318-322,共5页Computer Simulation

基　　金：山西省青年科技研究基金项目(2013021021-2);教育部人文社会科学研究青年基金项目(13YJC630049)

摘　　要：研究立体仓库的堆垛机拣选调度自动化问题,可提高企业的仓储拣选效率,节约成本。在求解含周转箱约束的离散、多批量的单元格式仓库货物拣选作业模型上,针对遗传算法收敛速度过慢的问题,将模拟退火算法与遗传算法相结合,求解堆垛机的最小运行路径。首先利用遗传算法寻优保留适应度均值较好的一代,求出一代最优解,并作为模拟退火算法的初始种群,再通过模拟退火算法寻优找到新的当代最优解。结合应用案例,分别设计遗传算法、模拟退火算法和混合算法的程序,用MATLAB软件分别进行仿真,对实验结果进行分析,结果表明改进模型和混合算法是可行和有效的。Researching the problem of stacker＇ s automation picking scheduling, aimed at improving the working efficiency of the storage picking efficiency and saving cost of enterprises. Considering of the picking operations char- acters of discrete, multi-batch in AS/RS, this paper proposed a mathematical model of picking route within the con- straints of turn over box capacity in order to minimize the total running distance of stacker for some given order. Ai- ming at the slow convergence speed of genetic algorithm （GA）, a new algorithm combined GA with simulated annea- ling （SA） was developed. By taking the optimal solution of each generation of GA as the initial solution of SA, a bet- ter solution can be obtained by SA and then be passed into the next generation of GA for further iterative computation. Finally, fbr a same application case, GA, SA and hybrid algorithm of SA and GA were designed and simulated in MATLAB environment. The results illustrate the feasibility and validity of the proposed approach.

关 键 词：遗传模拟退火 自动化仓库 拣选路径 

分 类 号：TH128[机械工程—机械设计及理论]