CAJ | 학술논문

针对需要在多个巷道中移动作业的订单拣选问题，设计了存储仓库布置图的数据结构，通过事先把节点之间的最短距离和最短路线计算出来，然后在求订单中任意两个货位间的最短距离时，借助其邻接节点来求。在此基础上设计了一种混合遗传算法来求解问题，并对每一代的最优个体使用Lin-Kernighan算法进行优化。实验结果表明改进的混合遗传算法所求得的解的质量以及收敛速度都有较大提高。该方法可用于超市、书店等需要拣选设备或人员在多巷道间移动拣选的情况。
침대수요재다개항도중이동작업적정단간선문제，설계료존저창고포치도적수거결구，통과사선파절점지간적최단거리화최단로선계산출래，연후재구정단중임의량개화위간적최단거리시，차조기린접절점래구。재차기출상설계료일충혼합유전산법래구해문제，병대매일대적최우개체사용Lin-Kernighan산법진행우화。실험결과표명개진적혼합유전산법소구득적해적질량이급수렴속도도유교대제고。해방법가용우초시、서점등수요간선설비혹인원재다항도간이동간선적정황。
This paper proposes a method to solve the order-picking problems which needs traveling in multiple aisles. This paper defines a data structure to store warehouse layout; The shortest distance and route between every two nodes can be calculated. The distance between two storage points can be computed by their adjacent nodes. A hybrid genetic algorithm is proposed and Lin-Kernighan algorithm is used to improve the best chromosome of every generation. Experi-mental results show that the solution quality and convergence rate is improved greatly. This method can be used in super-market, book store and other situations where operators or picking vehicles must walk in multiple aisles to pick orders.