利用启发式算法和遗传算法求解病人缺席情况下的预约排期问题

W. Chua, N. A. A. Rahmin, A. Nawawi
{"title":"利用启发式算法和遗传算法求解病人缺席情况下的预约排期问题","authors":"W. Chua, N. A. A. Rahmin, A. Nawawi","doi":"10.23939/mmc2022.01.065","DOIUrl":null,"url":null,"abstract":"The existence of an efficient appointment schedule is important in the healthcare system since it can minimize patient waiting time, resource idle time, and resource overtime and, hence, optimize the utilization and productivity of healthcare organization. In this research, the overbooking technique is implemented to compensate for patient no-show behavior. The aims of this research are to identify the maximum number of patients that can be assigned to a time slot by examining the effects of multiple assignment and to construct a near-optimal overbooking appointment schedule. Heuristics procedure and genetic algorithm are used in this research. From the results obtained, the number of patients that can be assigned to a time slot is found to be at most three. This information can reduce the conflict which may occur when the patients arrive simultaneously. The results also show that the genetic algorithm has a better performance than the heuristics procedure in solving this problem.","PeriodicalId":37156,"journal":{"name":"Mathematical Modeling and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving overbooking appointment scheduling problem under patient no-show condition using heuristics procedure and genetic algorithm\",\"authors\":\"W. Chua, N. A. A. Rahmin, A. Nawawi\",\"doi\":\"10.23939/mmc2022.01.065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The existence of an efficient appointment schedule is important in the healthcare system since it can minimize patient waiting time, resource idle time, and resource overtime and, hence, optimize the utilization and productivity of healthcare organization. In this research, the overbooking technique is implemented to compensate for patient no-show behavior. The aims of this research are to identify the maximum number of patients that can be assigned to a time slot by examining the effects of multiple assignment and to construct a near-optimal overbooking appointment schedule. Heuristics procedure and genetic algorithm are used in this research. From the results obtained, the number of patients that can be assigned to a time slot is found to be at most three. This information can reduce the conflict which may occur when the patients arrive simultaneously. The results also show that the genetic algorithm has a better performance than the heuristics procedure in solving this problem.\",\"PeriodicalId\":37156,\"journal\":{\"name\":\"Mathematical Modeling and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Modeling and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23939/mmc2022.01.065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Modeling and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23939/mmc2022.01.065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

有效的预约安排在医疗保健系统中非常重要,因为它可以最大限度地减少患者等待时间、资源空闲时间和资源超时时间,从而优化医疗保健组织的利用率和生产力。在本研究中,采用超额预约技术来补偿患者的不来诊行为。本研究的目的是通过检查多重分配的影响来确定可以分配到一个时间段的最大患者数量,并构建一个接近最优的超额预约时间表。本研究采用了启发式算法和遗传算法。从得到的结果来看,可以分配到一个时间段的患者数量最多为3个。这些信息可以减少当病人同时到达时可能发生的冲突。结果还表明,遗传算法在求解该问题时比启发式算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Solving overbooking appointment scheduling problem under patient no-show condition using heuristics procedure and genetic algorithm
The existence of an efficient appointment schedule is important in the healthcare system since it can minimize patient waiting time, resource idle time, and resource overtime and, hence, optimize the utilization and productivity of healthcare organization. In this research, the overbooking technique is implemented to compensate for patient no-show behavior. The aims of this research are to identify the maximum number of patients that can be assigned to a time slot by examining the effects of multiple assignment and to construct a near-optimal overbooking appointment schedule. Heuristics procedure and genetic algorithm are used in this research. From the results obtained, the number of patients that can be assigned to a time slot is found to be at most three. This information can reduce the conflict which may occur when the patients arrive simultaneously. The results also show that the genetic algorithm has a better performance than the heuristics procedure in solving this problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematical Modeling and Computing
Mathematical Modeling and Computing Computer Science-Computational Theory and Mathematics
CiteScore
1.60
自引率
0.00%
发文量
54
期刊最新文献
Analytical images of Kepler's equation solutions and their applications Fractional Brownian motion in financial engineering models Multi-criteria decision making based on novel distance measure in intuitionistic fuzzy environment Stability analysis of a fractional model for the transmission of the cochineal Modeling the financial flows impact on the diagnosis of an enterprise's economic security level
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1