吉林大学学报(信息科学版) ›› 2026, Vol. 44 ›› Issue (3): 649-655.

• • 上一篇    下一篇

基于模拟退火的门诊候诊时间最短化排班算法

周宗宁1,2, 叶六奇1,2, 栗 健3   

  1. 1. 安徽中医药大学医药经济管理学院,合肥230012;2. 数据科学与中医药创新发展中心,安徽省哲学社会科学重点实验室, 合肥230012; 3. 浙江师范大学 计算机科学与技术学院,浙江金华321004
  • 收稿日期:2026-02-25 出版日期:2026-06-02 发布日期:2026-06-02
  • 通讯作者: 叶六奇(1972— ), 男, 合肥人, 安徽中医药大学副教授, 博士, 主要从事中医药经济管理,医院管理研究,(Tel)86-18755129618(E-mail)1955838868@qq.com。 E-mail:1955838868@qq.com
  • 作者简介:周宗宁(2001— ), 男, 安徽六安人, 安徽中医药大学硕士研究生, 主要从事社会医学与卫生事业管理研究, (Tel)86- 13615604735(E-mail)1580913534@ qq. com
  • 基金资助:
    安徽省研究生质量工程基金资助项目(2023szsfkc086); 安徽省教育厅人文社科重大基金资助项目(2022AH040070)

Shift Scheduling Algorithm for Minimizing Outpatient Waiting Time Based on Simulated Annealing

ZHOU Zongning1,2, YE Liuqi1,2, LI Jian3   

  1. 1. School of Pharmaceutical Economics and Management, Anhui University of Chinese Medicine, Hefei 230012, China; 2. Data Science and Traditional Chinese Medicine Innovation and Development, Anhui Provincial Key Laboratory of Philosophy and Social Sciences, Hefei 230012, China; 3. School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China
  • Received:2026-02-25 Online:2026-06-02 Published:2026-06-02

摘要: 为合理调配医生资源实现门诊候诊时间最短化进而提升患者就诊体验与医院运营效率提出了基于模拟退火的门诊候诊时间最短化排班算法。该算法基于排队论预测门诊候诊队列长度与单位时间段候诊时间, 并定义了以候诊时间最短为目标的排班优化决策函数。为确保决策目标的可行性与合理性为算法嵌入了多维度约束条件包括医生工作时间和技能匹配约束。引入模拟退火算法通过循环生成新解-判定-接受-抛弃”迭代的马尔科夫链对决策函数进行求解进而输出最佳排班方案。实验结果表明经模拟退火算法排班后, 能将患者的候诊时间控制到16 min以内为医生的科学排班提供了实践参考。

关键词: 模拟退火, 门诊候诊, 时间最短化, 排班方案

Abstract:  In order to allocate doctor resources reasonably, minimize outpatient waiting time, and improve patient experience and hospital operation efficiency, a simulated annealing based outpatient waiting time minimization scheduling algorithm is proposed. This algorithm is based on queuing theory to predict the length of outpatient waiting queues and the waiting time per unit time period, and to define a scheduling optimization decision function with the goal of minimizing waiting time. To ensure the feasibility and rationality of the decision-making objectives, multi-dimensional constraints are embedded in the algorithm, including constraints on doctors’ working time and doctor skill matching. Simulated annealing algorithm is introduced to solve the decision function and output the optimal scheduling plan through a Markov chain that iteratively generates new solutions, determines, accepts, and discards. The experimental results show that after simulating annealing algorithm scheduling, the waiting time of patients can be controlled within 16 minutes, providing practical reference for doctors’ scientific scheduling.

Key words: simulated annealing, outpatient waiting, time minimization, scheduling plan

中图分类号: 

  • TP391