• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于家庭医疗保健规划的混合整数规划与启发式分解技术

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.

作者信息

Laesanklang Wasakorn, Landa-Silva Dario

机构信息

ASAP Research Group, School of Computer Science, The University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham, NG8 1BB UK.

出版信息

Ann Oper Res. 2017;256(1):93-127. doi: 10.1007/s10479-016-2352-8. Epub 2016 Oct 24.

DOI:10.1007/s10479-016-2352-8
PMID:31258236
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC6560490/
Abstract

We tackle home healthcare planning scenarios in the UK using decomposition methods that incorporate mixed integer programming solvers and heuristics. Home healthcare planning is a difficult problem that integrates aspects from scheduling and routing. Solving real-world size instances of these problems still presents a significant challenge to modern exact optimization solvers. Nevertheless, we propose decomposition techniques to harness the power of such solvers while still offering a practical approach to produce high-quality solutions to real-world problem instances. We first decompose the problem into several smaller sub-problems. Next, mixed integer programming and/or heuristics are used to tackle the sub-problems. Finally, the sub-problem solutions are combined into a single valid solution for the whole problem. The different decomposition methods differ in the way in which sub-problems are generated and the way in which conflicting assignments are tackled (i.e. avoided or repaired). We present the results obtained by the proposed decomposition methods and compare them to solutions obtained with other methods. In addition, we conduct a study that reveals how the different steps in the proposed method contribute to those results. The main contribution of this paper is a better understanding of effective ways to combine mixed integer programming within effective decomposition methods to solve real-world instances of home healthcare planning problems in practical computation time.

摘要

我们运用结合了混合整数规划求解器和启发式算法的分解方法,来处理英国的家庭医疗保健规划场景。家庭医疗保健规划是一个难题,它整合了调度和路径规划等方面。对于现代精确优化求解器而言,解决这些问题的实际规模实例仍然是一项重大挑战。尽管如此,我们提出了分解技术,以利用此类求解器的强大功能,同时仍然提供一种实用的方法,为实际问题实例生成高质量的解决方案。我们首先将问题分解为几个较小的子问题。接下来,使用混合整数规划和/或启发式算法来处理这些子问题。最后,将子问题的解决方案组合成整个问题的一个有效解决方案。不同的分解方法在生成子问题的方式以及处理冲突任务分配的方式(即避免或修复)上有所不同。我们展示了所提出的分解方法获得的结果,并将其与其他方法获得的解决方案进行比较。此外,我们进行了一项研究,揭示了所提出方法中的不同步骤是如何对这些结果产生影响的。本文的主要贡献在于更好地理解了在有效分解方法中结合混合整数规划的有效方式,以便在实际计算时间内解决家庭医疗保健规划问题的实际实例。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/573bb61c0706/10479_2016_2352_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/5876c4994ff1/10479_2016_2352_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/8ec47906222a/10479_2016_2352_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/f5339e19db5b/10479_2016_2352_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/573bb61c0706/10479_2016_2352_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/5876c4994ff1/10479_2016_2352_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/8ec47906222a/10479_2016_2352_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/f5339e19db5b/10479_2016_2352_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/dded/6560490/573bb61c0706/10479_2016_2352_Fig5_HTML.jpg

相似文献

1
Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.用于家庭医疗保健规划的混合整数规划与启发式分解技术
Ann Oper Res. 2017;256(1):93-127. doi: 10.1007/s10479-016-2352-8. Epub 2016 Oct 24.
2
A model for solving the prescribed burn planning problem.一种解决规定火烧规划问题的模型。
Springerplus. 2015 Oct 21;4:630. doi: 10.1186/s40064-015-1418-4. eCollection 2015.
3
A heuristic approach to the task planning problem in a home care business.居家护理业务中任务规划问题的启发式方法。
Health Care Manag Sci. 2020 Dec;23(4):556-570. doi: 10.1007/s10729-020-09509-1. Epub 2020 Jul 25.
4
An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports.一种针对集装箱港口出现的海滨作业组合混合整数规划模型的进化方法。
Ann Oper Res. 2019;272(1):69-98. doi: 10.1007/s10479-017-2539-7. Epub 2017 May 22.
5
A Hybrid Heuristic-Exact Optimization for Large-Scale Home Health Care Problem.一种用于大规模家庭医疗保健问题的混合启发式精确优化方法。
IEEE/ACM Trans Comput Biol Bioinform. 2024 Jul-Aug;21(4):1129-1140. doi: 10.1109/TCBB.2023.3327499. Epub 2024 Aug 8.
6
A set-covering based heuristic algorithm for the periodic vehicle routing problem.一种基于集合覆盖的周期性车辆路径问题启发式算法。
Discrete Appl Math. 2014 Jan 30;163(Pt 1):53-64. doi: 10.1016/j.dam.2012.08.032.
7
Efficient Minimum Flow Decomposition via Integer Linear Programming.通过整数线性规划实现有效的最小流量分解。
J Comput Biol. 2022 Nov;29(11):1252-1267. doi: 10.1089/cmb.2022.0257. Epub 2022 Oct 18.
8
A clustering metaheuristic for large orienteering problems.一种用于大规模定向问题的聚类启发式算法。
PLoS One. 2022 Jul 22;17(7):e0271751. doi: 10.1371/journal.pone.0271751. eCollection 2022.
9
Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.一种双目标校车调度问题的精确算法和元启发式算法
PLoS One. 2015 Jul 15;10(7):e0132600. doi: 10.1371/journal.pone.0132600. eCollection 2015.
10
A heuristic algorithm for medical staff's scheduling problems with multiskills and vacation control.一种带有多技能和休假控制的医务人员排班问题的启发式算法。
Sci Prog. 2021 Sep;104(3_suppl):368504211050301. doi: 10.1177/00368504211050301.

引用本文的文献

1
Nurse-patient relationship for multi-period home health care routing and scheduling problem.多时段家庭医疗护理路径和调度问题中的护患关系。
PLoS One. 2022 May 27;17(5):e0268517. doi: 10.1371/journal.pone.0268517. eCollection 2022.