基于混合遗传算法的固定货架拣选问题求解  

Research on fixed shelf order-picking problem using hybrid genetic algorithm

作　　者：郭春花[1] 胡咏梅[1] 付延安[1] 姜晓娜[1] 

机构地区：[1]山东大学控制科学与工程学院,济南250061

出　　处：《计算机工程与应用》2007年第30期196-198,共3页Computer Engineering and Applications

基　　金：山东省自然科学基金(the Natural Science Foundation of Shandong Province of China under Grant No.Y2004G05)。

摘　　要：针对自动化立体仓库固定货架系统拣选路径优化问题的特点,分析并设计了一种新型混合遗传算法。构造初始种群时加入了一种补充算法,遗传操作采用了一种受贪婪算法启发的交叉算子和倒位变异算子,显著改善了原有遗传算法的搜索能力。仿真结果表明该遗传算法在执行时间和优化效果两方面均能很好的满足作业要求。According to the requirements of the order-picking problem of the fixed shelve in the automated warehouse,a kind of rapid and efficient hybrid genetic algorithm is analyzed and designed.A compensatory algorithm is presented for the construction of the initial population and a cross arithmetic operators and converse mutation arithmetic operators enlightened by greedy algorithm are for the operation.The ability of local searching of general genetic algorithm is prominently improved.The simulation indicates that this method can acquire good results, satisfying the demands of the work as to efficiency and optimization results.

关 键 词：固定货架拣选 补充算法 贪婪算法 混合遗传算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]