基于启发式算法的乏燃料装料排期计划研究  

Study on Spent Fuel Charging Scheduling based on Heuristic Algorithm

作　　者：苏康 黎知行 史骥 李仕元 景顺平 Su Kang;Li Zhixing;Shi Ji;Li Shiyuan;Jing Shunping(China Nuclear Power(Beijing)Simulation Technology Co.,Ltd.,Shenzhen 518031,China;CGNPC Uranium Resources Co.,Ltd.,Beijing 100029,China)

机构地区：[1]中广核(北京)仿真技术有限公司,深圳518031 [2]中广核铀业发展有限公司公司,北京100029

出　　处：《核安全》2022年第5期81-87,共7页Nuclear Safety

摘　　要：乏燃料运输计划中的装料排期环节受到各种因素的影响,给人工制订运输计划带来了挑战。人工计划受到人因的经验与能力的限制,难以全面统筹运输过程中的各种影响因素,导致整个计划可执行性显著降低,且会耗费大量的人力与物力。针对装料排期环节的业务逻辑抽象建模,以最小化装料任务完成时间和最大化外运紧迫性为目标,以容器数量上限、乏燃料组件状态、作业面的数量和各种时间窗为约束条件,建立了混合整数规划模型。考虑到问题的规模与求解的时效性,设计了一种基于有限规则的启发式算法进行模型求解,并利用离散仿真软件对算法的结果进行了验证。The loading and scheduling aspects of the spent fuel transport plan are subject to various constraints that make manual transport planning a challenge.At the same time,manual planning is limited by the experience and capability of the staff and is unable to fully consider the various influences on the transport process,resulting in a much less executable plan and a significant drain on human and material resources.In this paper,the business logic of the loading scheduling process is abstractly modeled,and a mixed integer programming model is developed with the two objectives of minimizing the completion time of the loading task and maximizing the urgency of the outbound transportation,considering the upper limit of the number of containers,the state of the spent fuel assemblies,the number of operating surfaces and various time windows.A finite rule-based heuristic algorithm was designed to solve the model considering the size of the problem and the timeliness of the solution,and the results of the algorithm were finally validated using discrete simulation software.

关 键 词：乏燃料 装料排期 优先规则 启发式算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]