Crowdsourcing Home Healthcare Service: Matching Caretakers With Caregivers for Jointly Rostering and Routing

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-12-17 DOI:10.1109/TSC.2024.3517344
Chun-Cheng Lin;Yi-Chun Peng;Zhen-Yin Annie Chen;Pei-Yu Liu
{"title":"Crowdsourcing Home Healthcare Service: Matching Caretakers With Caregivers for Jointly Rostering and Routing","authors":"Chun-Cheng Lin;Yi-Chun Peng;Zhen-Yin Annie Chen;Pei-Yu Liu","doi":"10.1109/TSC.2024.3517344","DOIUrl":null,"url":null,"abstract":"In this work, we introduce crowdsourcing home healthcare service (CHHS) systems, where caregivers (including nurses, personal care attendants, and housekeepers) from different locations (rather than centralized institutions) offer diverse home healthcare services to caretakers at home. Powered by cloud computing, the CHHS system enables real-time, dynamic, and large-scale matching between caretakers and caregivers based on their preferences and constraints, and determines caregivers’ rostering and routing plans, involving the NP-hard nurse rostering problem (NRP) and the vehicle routing problem (VRP). This work firstly creates a mathematical programming model to jointly roster and route for the CHHS, maximizing the matching scores of caregivers and caretakers based on the preferred features through analytic hierarchy process (AHP), and minimizing caregivers’ overtime and routing costs, under constraints of caregiver skills, regulations, and vehicle routing. The proposed matching score mechanism assigns weights to caretaker preferences, enhancing pairing with preferred caregivers and reducing dissatisfaction. This work proposes a hybrid genetic algorithm with variable neighborhood search (GAVNS), respectively tailored to handle the rostering and routing aspects of CHHS. Simulation indicates that the GAVNS lowers costs by approximately 38% and 26% in rural and city cases, respectively, and outperforms standalone GA and VNS, achieving a 3% additional cost reduction and consistently yielding feasible solutions.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"18 1","pages":"126-139"},"PeriodicalIF":6.2000,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10804680/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, we introduce crowdsourcing home healthcare service (CHHS) systems, where caregivers (including nurses, personal care attendants, and housekeepers) from different locations (rather than centralized institutions) offer diverse home healthcare services to caretakers at home. Powered by cloud computing, the CHHS system enables real-time, dynamic, and large-scale matching between caretakers and caregivers based on their preferences and constraints, and determines caregivers’ rostering and routing plans, involving the NP-hard nurse rostering problem (NRP) and the vehicle routing problem (VRP). This work firstly creates a mathematical programming model to jointly roster and route for the CHHS, maximizing the matching scores of caregivers and caretakers based on the preferred features through analytic hierarchy process (AHP), and minimizing caregivers’ overtime and routing costs, under constraints of caregiver skills, regulations, and vehicle routing. The proposed matching score mechanism assigns weights to caretaker preferences, enhancing pairing with preferred caregivers and reducing dissatisfaction. This work proposes a hybrid genetic algorithm with variable neighborhood search (GAVNS), respectively tailored to handle the rostering and routing aspects of CHHS. Simulation indicates that the GAVNS lowers costs by approximately 38% and 26% in rural and city cases, respectively, and outperforms standalone GA and VNS, achieving a 3% additional cost reduction and consistently yielding feasible solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
众包家庭医疗保健服务:将护理人员与护理人员配对,共同登记和路由
在这项工作中,我们引入了众包家庭医疗保健服务(CHHS)系统,来自不同地点(而不是集中机构)的护理人员(包括护士、个人护理人员和管家)为家中的护理人员提供各种家庭医疗保健服务。CHHS系统在云计算的支持下,可以根据看护人和护理人员的偏好和约束条件进行实时、动态和大规模的匹配,并确定护理人员的值班和路由计划,涉及NP-hard护士值班问题(NRP)和车辆路由问题(VRP)。本研究首先建立了一个数学规划模型,在护理人员技能、法规和车辆路线的约束下,通过层次分析法(AHP)建立基于首选特征的护理人员和护理人员匹配分数最大化的数学规划模型,并最小化护理人员的加班和路线成本。提出的匹配评分机制为看护人偏好分配权重,增强与首选照顾者的配对,减少不满。本文提出了一种基于可变邻域搜索(GAVNS)的混合遗传算法,分别针对CHHS的调度和路由问题进行了定制。仿真表明,在农村和城市情况下,GAVNS分别降低了约38%和26%的成本,优于独立的GA和VNS,实现了3%的额外成本降低,并始终产生可行的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
MicroInspect: A Progressive Framework for Metric-Level Root Cause Localization in Microservices When Blockchain Meets Tor: Enabling Automatically Distributed Blind Choosing of Relay Nodes in Anonymous Communication BIPPO: Budget-Aware Independent PPO for Energy-Efficient Federated Learning Services Calling the Shots: Constraint-Aware Honeypoint Orchestration for Cloud-Native Anomaly Response Budget-Aware Cost-Efficient Edge AI Inference for Data Streams Via Blockchain-Empowered Auctions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1