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

计算机科学 启发式 工作量 帕累托原理 模拟退火 数学优化 启发式 多目标优化 约束规划 车辆路径问题 背景(考古学) 调度(生产过程) 解算器 运筹学 算法 人工智能 布线(电子设计自动化) 机器学习 随机规划 数学 操作系统 生物 古生物学 程序设计语言 计算机网络
作者
Wenheng Liu,Mahjoub Dridib,Amir M. Fathollahi‐Fard,Amir Hajjam El Hassani
出处
期刊:Swarm and evolutionary computation [Elsevier BV]
卷期号:86: 101507-101507 被引量:16
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
1秒前
芹菜大王发布了新的文献求助10
1秒前
3秒前
lin发布了新的文献求助10
4秒前
Orange应助code_Z采纳,获得10
5秒前
Xun完成签到,获得积分10
5秒前
周大人完成签到 ,获得积分10
6秒前
Cloud_zhou完成签到,获得积分10
7秒前
英吉利25发布了新的文献求助10
7秒前
vc应助felix采纳,获得30
7秒前
隐形便当发布了新的文献求助10
8秒前
luochenglin完成签到,获得积分10
10秒前
10秒前
Akim应助wonder采纳,获得10
11秒前
zzz发布了新的文献求助20
11秒前
cris完成签到,获得积分10
13秒前
顾矜应助code_Z采纳,获得10
14秒前
15秒前
冯俊杰发布了新的文献求助10
16秒前
领导范儿应助cong采纳,获得10
16秒前
眯眯眼的黎昕完成签到 ,获得积分10
17秒前
愉快小凝完成签到,获得积分10
17秒前
科研通AI6.2应助左右脑采纳,获得10
17秒前
18秒前
19秒前
SciGPT应助ziiiiiii7采纳,获得10
19秒前
Ava应助hh采纳,获得10
21秒前
zzz发布了新的文献求助10
21秒前
22秒前
魔幻的惜灵完成签到 ,获得积分10
22秒前
22秒前
22秒前
22秒前
FashionBoy应助科研通管家采纳,获得10
23秒前
SunGuangkai发布了新的文献求助10
23秒前
23秒前
顾矜应助科研通管家采纳,获得10
23秒前
23秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
HYDROLYSE ACIDE DE QUELQUES DIOXASPIROCYCLANES 1314
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Navigating Normative Orders. Interdisciplinary Perspectives 800
1 Peter and Christ's Descent to the Dead in Its Early Christian Reception 700
Organizational Behavior 510
Management and the Arts 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7747863
求助须知:如何正确求助?哪些是违规求助? 9296136
关于积分的说明 20233622
捐赠科研通 7329210
什么是DOI,文献DOI怎么找? 3308722
关于科研通互助平台的介绍 2460470
邀请新用户注册赠送积分活动 2320668