摘要
考虑仓库作业能力和库存物资品种,构建以任务完成时间为目标的供应保障任务分配模型,运用COPT求解器和遗传算法对模型进行求解。算例实验表明:随着算例规模的增大,求解器求解时间迅速增加,遗传算法能够在相对较短时间内得到最优任务分配,使得完成供应时间最短,从而提高供应保障的时效性。
Considering the warehouse operational capacity and inventory variety,a supply support task assignment model with task completion time as the goal was constructed.The model was solved using the COPT solver and genetic algorithm.The example experiment shows that with the increase of the scale of the example,the solver’s solving time increases rapidly,and genetic algorithm can obtain the optimal task assignment in a relatively short time,which makes the completion of supply time shortest,thereby improving the timeliness of supply support.
作者
张育铭
刘世伦
王兵
金峰
ZHANG Yuming;LIU Shilun;WANG Bing;JIN Feng(Army Academy of Armored Forces,Beijing 100072,China)
出处
《装甲兵学报》
2023年第4期58-64,共7页
Journal of Armored Forces
关键词
供应保障
排序调度
遗传算法
supply support
scheduling
genetic algorithm