期刊文献+

“货箱到人”系统单工作台任务调度问题的混合遗传自适应大规模邻域搜索算法

A Hybrid Genetic Search and Adaptive Large Neighborhood Search Algorithm for the Single-Depot Task Scheduling Problem of the Carton Transfer Unit System
在线阅读 下载PDF
导出
摘要 针对“货箱到人”仓储系统单工作台任务调度问题,特别是在多路径混合下的实际调度场景,研究探讨了特殊的多行程混合回程的车辆路径问题。首先,考虑开闭混合的路径模式,构建了旨在最小化机器人去/回程混合任务最大完成时间的整数线性规划模型。其次,基于模型中机器人执行出/入库任务的取放特征,提出混合遗传自适应大规模邻域搜索算法。该算法通过遗传算法的种群管理机制改进自适应大规模邻域搜索算法,以避免其过早陷入局部最优,同时平衡邻域搜索收敛速度与种群收敛性。最后,通过不同规模仿真算例的模拟与对比分析,验证了所提模型与方法的有效性,并与不同基线方法进行实验对比。结果表明,该算法在收敛性、稳定性及收敛速度方面均有显著提升。研究成果可为“货箱到人”仓储系统中机器人单工作台任务调度研究提供方法参考与决策支持。 Focusing on the practical scheduling scenario of a single workstation task scheduling problem of“carton-transfer-unit”warehouse system under multi-path hybrid environments,this paper investigates a special multi-trip mixed return vehicle routing problem.First,considering a hybrid path mode that includes both open and closed routes,it proposes an integer linear programming model to minimize the maximum completion time of mixed outbound and inbound tasks for robots.Next,based on the pick-andplace characteristics of robots performing,it integrates the population management mechanism of genetic algorithms to improve the adaptive large neighborhood search process,aiming to avoid premature convergence to local optima while balancing the trade-off between the convergence speed of neighborhood search and population diversity.Finally,the proposed model and method are numerically validated by simulations and comparative analysis using test instances of various scales.Experimental results against several baseline methods demonstrate that the proposed algorithm significantly improves convergence,stability,and convergence speed.The findings provide methodological reference and decision support for robot task scheduling in single-workstation settings in“carton-transfer-unit”warehouse systems.
作者 余玉刚 刘伟廷 罗云琪 YU Yugang;LIU Weiting;LUO Yunqi(School of Management,University of Science and Technology of China,Hefei 230026,China;International Institute of Finance,University of Science and Technology of China,Hefei 230000,China;Anhui Provincial Key Laboratory of Digital Intelligence Supply Chain,Hefei 230000,China)
出处 《系统管理学报》 北大核心 2025年第4期994-1010,共17页 Journal of Systems & Management
基金 国家自然科学基金资助项目(72091215/72091210,72371233,72101245) 安徽省博士后科研活动资助项目(2024C981)。
关键词 半自动存储检索系统 多路径混合式 遗传算法 大规模邻域搜索算法 semi-automatic storage and retrieval system multi-path hybrid genetic algorithm large neighborhood search algorithm
  • 相关文献

参考文献5

二级参考文献31

  • 1Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science, 1959,10(6) : 80- 91.
  • 2Lenstra J, Rinnooy K. Complexity of vehicle routing and scheduling problems[J]. Networks, 1981 (11):221-227.
  • 3Cheng R, Gen M. Vehicle routing problem with fuzzy due-time using genetic algorithms[J]. Japanese Journal of Fuzzy Theory and Systems, 1995,7(5): 1050-1061.
  • 4Dror M, Trudeau P. Savings by split delivery routing [J]. Transportation Science, 1989,23(2) :141-145.
  • 5Belenguer J M, Martinez M C, Mota E. A lower bound for the split delivery vehicle routing problem [J]. Operations Research, 2000,48(5) :801-810.
  • 6Jin M Z, Liu K, Bowden R O. A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem [ J ]. International Journal of Production Economics, 2007,105(1) :228-242.
  • 7Holland J H. Adaptation in nature and artificial systems[M]. The University of Michigan Press, 1975.
  • 8胡志华,孙志强,郭晓汾.基于模糊预约时间窗的车辆调度问题研究[J].交通科技与经济,2008,10(2):94-97. 被引量:4
  • 9王志坚,王晓博,李一军.一体化集货和配送车辆路径问题的混合遗传启发式算法[J].系统管理学报,2009,18(3):338-343. 被引量:9
  • 10崔雪丽,朱道立,马良.模糊约定时间车辆路径问题及其蚂蚁算法求解[J].系统工程学报,2009,24(4):489-493. 被引量:14

共引文献47

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部