已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

A customized adaptive large neighborhood search algorithm for solving a multi-objective home health care problem in a pandemic environment

计算机科学 大流行 2019年冠状病毒病(COVID-19) 算法 人工智能 医学 疾病 病理 传染病(医学专业)
作者
Wenheng Liu,Mahjoub Dridib,Amir M. Fathollahi-Fard,Amir Hajjam El Hassani
出处
期刊:Swarm and evolutionary computation [Elsevier]
卷期号:86: 101507-101507
标识
DOI:10.1016/j.swevo.2024.101507
摘要

This paper addresses a home health care routing and scheduling problem (HHCRSP) specifically focusing on the context of a pandemic environment. The investigated HHCRSP involves assigning appropriate caregivers to patients and optimizing caregiver routes while minimizing total travel costs, workload differences among caregivers, and negative patient preferences. The problem accounts for synchronized visits, lunch breaks, time windows, and special pandemic constraints (e.g., maximum total contact times for each caregiver and multi-trip routes). To our knowledge, this is the first study to address these constraints and goals simultaneously in the HHCRSP. To solve the problem, we propose a customized algorithm, AMOALNS, which combines archived multi-objective simulated annealing (AMOSA) with adaptive large neighborhood search (ALNS). Our AMOALNS generates a new solution iteratively through problem-specific heuristics within ALNS, employing a multi-objective optimization framework to intelligently disrupt and repair feasible solutions. The adaptive updating of heuristic weights is determined by the domination relation between the newly generated solution and non-dominated solutions stored in the archive of AMOSA. To show the performance of the AMOALNS through extensive experiments, we compare it with the epsilon constraint method and other state-of-the-art multi-objective algorithms in the literature. Additionally, we use Pareto front analysis to aid decision-makers in comprehending the shape of the Pareto front and making informed choices based on their preferences. The trade-off analysis shows that minimizing total travel costs is the hardest to achieve, and optimizing workload balancing is worthwhile. Also, most of the non-dominated solutions can simultaneously achieve low workload balancing and high preference of patients. Finally, the sensitivity analyses reveal that the time windows classifications and instances sizes have significant impact on the compromising solutions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
春禾娜娜完成签到 ,获得积分10
1秒前
星期八的日常完成签到,获得积分10
1秒前
科目三应助萤火虫采纳,获得10
3秒前
个性小海豚完成签到 ,获得积分10
10秒前
Ddddd完成签到,获得积分10
10秒前
哇咔咔完成签到 ,获得积分10
19秒前
杰小程完成签到 ,获得积分10
20秒前
PeGe完成签到,获得积分10
20秒前
22秒前
脑洞疼应助科研通管家采纳,获得10
23秒前
桐桐应助科研通管家采纳,获得10
23秒前
烟花应助科研通管家采纳,获得10
23秒前
Owen应助科研通管家采纳,获得10
23秒前
赘婿应助科研通管家采纳,获得10
23秒前
李爱国应助优秀如雪采纳,获得10
26秒前
一溙完成签到,获得积分10
28秒前
31秒前
哈哈哈完成签到,获得积分10
33秒前
烟花应助哈哈哈采纳,获得10
41秒前
伶俐寒凡完成签到 ,获得积分10
44秒前
Maestro_S应助一鸣采纳,获得10
44秒前
乐乐应助超级月光采纳,获得10
44秒前
老婶子完成签到,获得积分10
48秒前
Harlotte完成签到 ,获得积分10
49秒前
ganggangfu完成签到,获得积分0
49秒前
54秒前
56秒前
58秒前
58秒前
58秒前
son发布了新的文献求助20
59秒前
萤火虫完成签到,获得积分10
1分钟前
优秀如雪发布了新的文献求助10
1分钟前
ganggang完成签到,获得积分0
1分钟前
萤火虫发布了新的文献求助10
1分钟前
1分钟前
思源应助啦啦啦啦啦啦啦采纳,获得10
1分钟前
NexusExplorer应助司徒天动采纳,获得10
1分钟前
皇甫琛发布了新的文献求助10
1分钟前
xyyyy完成签到 ,获得积分10
1分钟前
高分求助中
The Illustrated History of Gymnastics 800
The Bourse of Babylon : market quotations in the astronomical diaries of Babylonia 680
Peripheral Blood miR-148 Serves as a Novel Biomarker in Ulcerative Colitis Patients 500
Division and square root. Digit-recurrence algorithms and implementations 500
機能營養學前瞻(3 Ed.) 300
Problems of transcultural communication 300
Zwischen Selbstbestimmung und Selbstbehauptung 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2505319
求助须知:如何正确求助?哪些是违规求助? 2157942
关于积分的说明 5523500
捐赠科研通 1878422
什么是DOI,文献DOI怎么找? 934310
版权声明 563975
科研通“疑难数据库(出版商)”最低求助积分说明 499048