应用改进LK算法求解固定货架拣选优化问题  

Solving the Fixed Shelf Order-Picking Optimization Problem Using the Modified LK Algorithm

作　　者：田伟[1] 田国会[1] 张攀[1] 李晓磊[1] 

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

出　　处：《计算机应用》2004年第6期167-170,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60104009);山东省自然科学基金资助项目(Z2000G01)

摘　　要：针对自动化立体仓库中固定货架拣选作业要求速度快、效率高的特点,分析和研究了一种新型改进Lin Kernighan(LK)算法,并将其应用于固定货架拣选优化问题。仿真实验结果表明,该算法能够大大降低时间和空间的计算复杂度,快速、稳定地找出最优解,满足了多次作业时待拣选货物数目在较大范围内变动的要求,尤其是满足了中大规模作业的要求。According to the requirements of the order-picking processes of the fixed shelves, which need high speed and high efficiency in the automated warehouse, a new modified Lin-Kernighan(LK) algorithm is analyzed and applied in this paper. The results of simulation indicate that the algorithm can reduce the computational complexity of time and space greatly, and can also find out the optimum solution quickly and steadily. The varied requirements of the number of the order-picking points in wide range according to different tasks can be satisfied, especially for middle-large scale work.

关 键 词：自动化立体仓库 固定货架 LK算法 拣选优化 

分 类 号：F253[经济管理—国民经济]