期刊文献+

同步服务下考虑护工午休的双目标家庭护理人员调度问题

A Bi-objective Home Care Worker Scheduling Problem Considering Lunch Break of Caregivers under Synchronized Service
原文传递
导出
摘要 在家庭护理过程中,行动不便的患者往往需要两名护工同时为他们提供服务,这极大地增加了问题的难度。为实现家庭护理企业降本增效,以及为管理者实际排班提供参考,针对患者的同步服务需求,考虑护工的午休时间,以最小化运营成本和护工不满意度为目标构建了模型。从降级服务和同步服务时间差两方面构建护工不满意度表达式,设计虚拟午休节点处理午休约束。提出了改进的自适应大邻域搜索算法进行求解,该算法与多向局部搜索框架相结合,采用多种启发式初始解策略,设计同步服务判断矩阵,对解的可行性进行验证,针对两个目标分别设计局部搜索算子进一步提升解的质量。采用田口方法对算法参数进行调整并使用超体积指标和空间性分布指标评价解集。对比其他三种多目标启发式方法,所提算法在绝大多数算例上都获得更优的评价指标值,验证了所提算法在该问题上的适用性和优越性。 In the process of home health care,patients with limited mobility often need two caregivers to serve them at the same time,which greatly increases the difficulty of the problem.In order to realize the cost reduction and efficiency increase of home health care enterprises and provide reference for managers'actual scheduling,a model was established.This model focused on the synchronized service demand of patients and considered the lunch break time of caregivers,with the aim of minimizing both operating costs and caregiver dissatisfaction.The expression of caregivers'dissatisfaction considered two aspects:degraded service and synchronized service time difference.To deal with the lunch break constraint,a virtual lunch break node was proposed.An improved adaptive large neighborhood search algorithm was proposed to solve the problem.The algorithm was combined with the multi-directional local search framework.A variety of heuristic initial solution strategies were adopted and the feasibility of the solution was verified by the synchronous service judgment matrix.Further,local search operators were devised for the two objectives to improve the quality of the solution.The Taguchi method was employed to adjust algorithm parameters and the solution set was evaluated using the hyper volume index and spacing metric index.Compared with three other multi-objective heuristic methods,the proposed algorithm achieved better evaluation index values in most examples.This validates the effectiveness and applicability of our algorithm in solving the home health care scheduling problem.
作者 李艳 施琦 王付宇 LI Yan;SHI Qi;WANG Fuyu(School of Management Science and Engineering,Anhui University of Technology,Ma'anshan,Anhui 243032,China;Multiple Scientific Management and Control of Complex Systems Key Laboratory of Anhui Colleges and Universities,Ma'anshan,Anhui 243032,China)
出处 《工业工程与管理》 CSCD 北大核心 2024年第4期78-88,共11页 Industrial Engineering and Management
基金 国家自然科学基金资助项目(72274001,71872002) 教育部人文社会科学青年基金项目(19YJCZH091) 安徽省高校人文社科研究重大项目(SK2020ZD16) 安徽普通高校重点实验室开放基金项目(CS2023-ZD03)。
关键词 同步服务 家庭护理 午休时间 护工不满意度 自适应大邻域搜索算法 synchronized services home health care lunch breaks caregiver dissatisfaction ALNS
  • 相关文献

参考文献9

二级参考文献60

  • 1郑金华,蒋浩,邝达,史忠植.用擂台赛法则构造多目标Pareto最优解集的方法[J].软件学报,2007,18(6):1287-1297. 被引量:54
  • 2孙曦,蔡临宁.带时间窗的车辆路由问题的改进遗传算法[J].工业工程与管理,2007,12(3):16-20. 被引量:7
  • 3潘震东,唐加福,韩毅.带货物权重的车辆路径问题及遗传算法[J].管理科学学报,2007,10(3):23-29. 被引量:29
  • 4Liu R, Xie X, Augusto V, et al. Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care[J]. European Journal of Operational Research, 2013, 230: 475-486. 被引量:1
  • 5Eveborn P, Flisberg P, R?nnqvist M. LAPS CARE——An operational system for staff planning of home care[J]. European Journal of Operational Research, 2006, 171(3): 962-976. 被引量:1
  • 6海阳集团. 海阳集团服务项目[EB/OL]. [2015-6-4]. http://www.haiyang-group.com/ServiceItems.html. 被引量:1
  • 7Castillo-Salazar J A, Landa-Silva D, Qu R. A survey on workforce scheduling and routing problems[C]//Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, 2006: 283-302. 被引量:1
  • 8Rasmussen M S, Justesen T, Dohn A, et al. The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies[J]. European Journal of Operational Research, 2012, 219(3): 598-610. 被引量:1
  • 9Mankowska D, Meisel F, Bierwirth C. The home health care routing and scheduling problem with interdependent services[J]. Health Care Management Science, 2014, 17(1): 15-30. 被引量:1
  • 10Qureshi A G, Taniguchi E, Yamada T. An exact solution approach for vehicle routing and scheduling problems with soft time windows[J]. Transportation Research Part E: Logistics and Transportation Review, 2009, 45(6): 960-977. 被引量:1

共引文献45

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部