基于时间窗约束的多人多储位拣选路径优化模型及改进遗传算法应用研究  

Optimal model of multi-person and multi-location picking path based on time window constraint and application of improved genetic algorithm

作　　者：胡小建[1,2] 周琼 宋旭东[3] 阚涛 HU Xiaojian;ZHOU Qiong;SONG Xudong;KAN Tao(School of Management,Hefei University of Technology,Hefei 230009,China;Key Laboratory of Process Optimization and Intelligent Decision-making,Ministry of Education,Hefei 230009,China;Anhui Winners Industrial Automation Co.,Ltd.,Hefei 230000,China)

机构地区：[1]合肥工业大学管理学院,安徽合肥230009 [2]过程优化与智能决策教育部重点实验室,安徽合肥230009 [3]安徽维德工业自动化有限公司,安徽合肥230000

出　　处：《计算机集成制造系统》2022年第11期3354-3364,共11页Computer Integrated Manufacturing Systems

基　　金：安徽省科技重大专项资助项目(202003a05020039)。

摘　　要：针对目前主要的单人单储位拣选路径规划研究现状,以安徽BY零件库为研究对象,考虑实际存在的多人同时拣选与多储位问题(MLP),建立多储位下的多人拣选路径优化模型。首先确定拣选的人数;然后针对多人拣选路径优化模型提出一种基于时间窗约束的改进遗传算法(TWC-IGA)进行模型的求解,由IGA优化路径并得到拣货路径集合,再利用时间窗约束和两阶段策略进行路径的冲突预测、避障与动态局部调整;最后,通过仿真实验与遗传算法、贪心算法进行对比,验证文中所提的TWC-IGA的稳定性与收敛速度更好,结果更优,极大地提高拣选效率,对实际拣选具有有效性。Taking Anhui BY's parts library as the research object,Aiming at the current research status of single-person and single-storage picking path planning,the actual existing multi-person simultaneous picking and Multi-Location Problem(MLP)was considered,and the multiple storage and multi-person picking path optimization model was established.The number of picking people was first determined.For the multi-person picking path optimization model,an Improved Genetic Algorithm for Time Window Constraints(TWC-IGA)was proposed to solve the model.The path was optimized by IGA and the picking route collection was obtained.Then the time window constraints and two-stage strategy was used for route conflict prediction,obstacle avoidance and dynamic local adjustment.Through the simulation experiments,the proposed model was compared with genetic algorithms and greedy algorithms.The result showed that the stability and convergence speed of the proposed model were better,and the picking efficiency was greatly improved,which was effective for actual picking.

关 键 词：多人拣选 多储位 订单拣选 路径优化 时间窗约束 改进遗传算法 路径冲突 

分 类 号：F252[经济管理—国民经济] TP391.9[自动化与计算机技术—计算机应用技术]