摘要
考虑到多类型护理人员、护理连续性以及随机时间约束的周期性家庭护理分配问题,将其分解为一个分配子问题以及若干个路径优化子问题,即每个路径优化子问题对应于每个护理人员每天的访问顺序,提出了基于禁忌搜索和整数规划的混合算法以及最远插入算法对这两个子问题求解.通过随机生成的算例对所提出的混合算法测试,结果表明所提出算法的可行性与有效性.同时,将多类型护理人员和护理连续性约束松弛,定量地比较和分析了这两种约束对总成本的影响,为管理人员提供了科学的决策理论与依据.
A home caregiver assignment problem with the constraints of multi-type caregivers,the continuity of care and stochastic times is addressed in this paper.The problem is decomposed into an assignment sub-problem and several routing sub-problems,and each routing sub-problem corresponds to the daily route of each caregiver.The two types of sub-problems are solved by the hybrid algorithm based on tabu search and integer programming and the farthest insertion heuristic,respectively.The effectiveness of the proposed hybrid algorithm is validated by testing randomly generated instances.Meanwhile,the influence on the total operational cost by the constraints of multi-type caregivers and the continuity of care is compared and analyzed to provide the theoretical reliance of enterprise's management and decision.
作者
陆雨薇
袁彪
LU Yuwei;YUAN Biao(School of Mechanical and Traffic Engineering,Guangxi University of Science and Technology,Liuzhou 545006,China;SAIC Motor Artificial Intelligence Laboratory,Shanghai 200038,China;SAIC Intelligent Technology(Shanghai)Co.,Ltd.,Shanghai 200038,China)
出处
《广西科技大学学报》
2020年第3期105-113,共9页
Journal of Guangxi University of Science and Technology
基金
国家自然科学基金项目(71801058)资助.
关键词
家庭护理
多类型人员
护理连续性
随机时间
禁忌搜索
整数规划
home care
multi-type caregivers
continuity of care
Stochastic times
Tabu search
integer programming
