分析并推证出单巷道固定货架的拣选优化问题可归结于对称或非对称旅行售货商问题，研究了一种新型的改进LinKernighan (LK)算法，并将其应用于固定货架的货物拣选优化过程中。实验仿真结果表明，用该算法能降低固定货架对称和非对称拣选优化时间和空间计算的复杂度，快速、稳定地找出最优解，满足了多次作业时待拣选货物数目变动范围较大的要求。

The order-picking optimization of single-line fixed shelf similar to the symmetric and asymmetric traveling salesman problem is analyzed and proved. Then a new modified Lin-Kernighan (LK) algorithm is studied and applied it to the order-picking processes of the fixed shelves. The results of simulation indicate that the algorithm can reduce the computational complexity of time and space greatly, and also can find out the optimum solution quickly and steadily. The variation of the number of the order-picking points in wide range required by different tasks can be satisfied as well.