有容量限制的自动化立体仓库堆垛机路径规划优化方法  

Optimization Method for AR/RS Stacker Path Planning with Capacity Limit

作　　者：曾强[1] 张泽斌[1] 杨龙飞[1] 

机构地区：[1]河南理工大学能源科学与工程学院,河南焦作454000

出　　处：《机械设计与制造》2015年第1期172-176,共5页Machinery Design & Manufacture

基　　金：河南省教育厅科学技术研究项目(12B120005);河南理工大学博士基金项目(B2011-088)

摘　　要：针对自动化立体仓库堆垛机拣选的路径规划问题,为了实现提高堆垛机运行效率的目的,提出了一种优化方法。首先,针对有容量限制的堆垛机拣选路径规划问题,将其转化为多个旅行商问题的组合问题,构建了一种以出库时间最短为目标的堆垛机拣选路径规划优化模型。其次,采用整数编码,以有重复的整数串代表个体,采用分段交叉和单点交换变异实现遗传进化,使用改进的遗传算法对模型加以求解。最后,通过案例分析验证了所提方法的有效性。Aiming at the AR/RS stacker picking path planning problem,in order to achieve the increase of stacker operating efficiency,an optimization method was proposed.Firstly,considering the capacity limit,the stacker picking path planning problem was transformed into a multiple travelling salesman problem and a mode,with the goal of the shortest outbound time,was established.Secondly,using the integer encoding method,the individuals could be expressed as a string of repeated numbers,a segmented crossover and single point exchange mutation operator was used to implement genetic evolution.An improved genetic algorithm was presented to solve the model Finally,the effectiveness of the scheduling method proposed was validated by case study.

关 键 词：堆垛机 容量限制 路径规划 旅行商问题 遗传算法 

分 类 号：TH16[机械工程—机械制造及自动化] C93-03[经济管理—管理学]