摘要
为了缩短健康体检排队等待时间、预测待检项目整体顺序,以X算法、精确覆盖、广义覆盖、Dancing Links作为理论基础,提出了应用Dancing Links X解决体检时间广义覆盖问题的方法。通过构建以服务时间成本、排队等待时间成本的总成本最小化为目标的Dancing Links X三重约束来搜索可行性解,并摘选最小值。以此模型完成的规划体检顺序,实现了对体检路线的预测,表明基于Dancing Links X三重约束的智能导检路径优化模型可以对待检项目顺序及时间节点预测,为导检的智能化研究提供新思路。
In order to shorten the waiting time of physical examination and predict the overall order of the items to be examined,taking X algorithm,precise coverage,generalized coverage and Dancing Links as the theoretical basis,a method of applying Dancing Links X to solve the generalized coverage problem of physical examination time is proposed.By constructing the Dancing Links X triple constraint aiming at minimizing the total cost of service time cost and queuing time cost,the feasible solution is searched and the minimum value is selected.The planned physical examination sequence completed by this model realizes the prediction of physical examination route,which shows that the intelligent physical examination route optimization model based on Dancing Links X triple constraint can predict the order and time nodes of the items to be examined,providing the intelligent research of physical examination guidance with a new idea.
作者
付冰
胡云
周作建
Fu Bing;Hu Yun;Zhou Zuojian(School of Artificial Intelligence and Information Technology,Nanjing University of Chinese Medicine,Nanjing,Jiangsu 210046,China)
出处
《计算机时代》
2022年第3期61-64,69,共5页
Computer Era
关键词
智能导检
Dancing
Links
X算法
广义覆盖
精确覆盖
intelligent physical examination guidance
Dancing Links
X algorithm
generalized coverage
accurate coverage
