Yan-ping Jiang, Yan Zhang, Zhan Gao, Ting-wen Zheng
{"title":"Logic-based Benders decomposition for doctor-patient matching and scheduling considering chronic patients’ online consultation time preference","authors":"Yan-ping Jiang, Yan Zhang, Zhan Gao, Ting-wen Zheng","doi":"10.1016/j.cor.2025.107207","DOIUrl":null,"url":null,"abstract":"<div><div>We study a doctor-patient matching and scheduling problem, incorporating chronic patients’ preferences for online consultation time. We establish a multi-objective optimization model of 0–1 integer programming to solve the issue of doctor-patient matching and scheduling simultaneously. The objective is to maximize the satisfaction of doctors and patients of chronic diseases and the number of matches on the platform. To address this model, it is reconstructed into a single-objective optimization model based on the <span><math><mi>ε</mi></math></span>-constraint method. On this basis, we propose a logic-based Benders decomposition with a logic-based cutting inequality. Furthermore, the effectiveness of the proposed algorithm is verified via numerical experiments. The results show that the proposed logic-based Benders decomposition has a significant advantage in computing time. Finally, management implications are provided based on sensitivity analysis.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107207"},"PeriodicalIF":4.3000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825002357","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
We study a doctor-patient matching and scheduling problem, incorporating chronic patients’ preferences for online consultation time. We establish a multi-objective optimization model of 0–1 integer programming to solve the issue of doctor-patient matching and scheduling simultaneously. The objective is to maximize the satisfaction of doctors and patients of chronic diseases and the number of matches on the platform. To address this model, it is reconstructed into a single-objective optimization model based on the -constraint method. On this basis, we propose a logic-based Benders decomposition with a logic-based cutting inequality. Furthermore, the effectiveness of the proposed algorithm is verified via numerical experiments. The results show that the proposed logic-based Benders decomposition has a significant advantage in computing time. Finally, management implications are provided based on sensitivity analysis.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.