模拟退火算法求解排队中的加急问题  

Simulated Annealing Algorithm for Emergency Queuing Problem

作　　者：邓梦怡 吴旺春 胡春筠[1] 俞龙[1] 胡菁 DENG Mengyi;WU Wangchun;HU Chunjun;YU Long;HU Jing(College of Electronic Information Engineering and Artificial Intelligence,South China Agricultural University,Guangzhou 510640)

机构地区：[1]华南农业大学电子信息工程与人工智能学院,广州5106401

出　　处：《现代计算机》2021年第21期59-63,71,共6页Modern Computer

摘　　要：快递中转站作为物流行业的重要节点,其工作效率直接影响物流速度。快递中转站在优化分配机器工作时需要考虑快件平均等待时长以及快件的加急情况。本文在原有随机排队论的基础上加以补充完善,并以时间为约束条件,设置快件的优先级优化加急快件针对不同的优先级建立综合的多目标规划模型,再将多目标转化为单目标,结合模拟退火算法的多次迭代运算求解得最优解,并通过方案对比得出本文提出的方案排队时间更加稳定合理、工作效率较高,这更有利于机器做出及时的调度,从而实现对机器调度的优化。As an important node in the logistics industry,the efficiency of express transfer station directly affects the logistics speed.It is necessary to consider the average waiting time and the urgent situation of express when the express transfer station optimizes the allocation of machine work.This study is based on the original random queuing theory.The priority of express is set as the constraint condition,and the multi-ob⁃jective programming model is established according to different priority.Then,the multi-objective is transformed into a single objective,and the optimal solution is obtained by multiple iterations of simulated annealing algorithm.And through the comparison with other schemes,it is concluded that the queuing time of the scheme proposed in this paper is more stable and reasonable,and the work efficiency is higher.This is more conducive to the machine to make timely scheduling,so as to achieve the optimization of machine scheduling.

关 键 词：物流 快递 随机排队论 多目标规划 模拟退火算法 

分 类 号：F252[经济管理—国民经济] TP18[自动化与计算机技术—控制理论与控制工程] O226[自动化与计算机技术—控制科学与工程]