A Bi-objective Home Health Care Scheduling Problem: Based on Costs and Overtime

doi:10.12005/orms.2021.0271

Operations Research and Management Science ›› 2021, Vol. 30 ›› Issue (8): 233-239.DOI: 10.12005/orms.2021.0271

• Management Science • Previous Articles

A Bi-objective Home Health Care Scheduling Problem: Based on Costs and Overtime

XIANG Ting¹, LI Yan-feng^1,2

1. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;
2. Service Science and Innovation Key Laboratory of Sichuan Province, Chengdu 610031, China

Received:2019-05-07 Online:2021-08-25

基于成本和加班时长的双目标家庭护理人员调度问题

向婷¹, 李妍峰^1,2

1.西南交通大学经济管理学院,四川成都 610031;
2.服务科学与创新四川省重点实验室,四川成都 610031

通讯作者: 李妍峰(1980-),女,四川乐山人,博士,副教授,研究方向:物流优化。
作者简介:向婷(1991-),女,四川巴中人,博士生,研究方向:物流优化。
基金资助:
国家自然基金面上项目(72071161,71571150);四川省科技厅应用基础研究重大前沿项目(2017JY0225);西南交通大学智慧物流与供应链管理研究生导师团队项目(YJSY-DSTD201918);四川省科技厅应用基础研究项目(2020YJ0220)

Abstract

Abstract: Home health care industry gradually develops with the continuously aging population. In this paper, the home health care scheduling problem is formulated as a bi-objective mixed-integer programming problem which aims at minimizing the total costs and the maximum overtime. The maximum skill deviation and maximum working time are considered, as well as the nurse-patient skill matching, the overtime cost, the overtime duration and the workload balance. To solve the proposed problem, an improved NSGA-II and an improved SPEA-II are developed. The computational results show that the costs decrease as the maximum overtime increase. The maximum skill deviation and unit waiting penalty can affect the objectives obviously. Both algorithms perform well in small instances, while the efficiency of improved SPEA-II is better than the improved NSGA-II in the middle and large instances.

Key words: home health care, skill matching, overtime, vehicle routing problem with time window

摘要： 人口老龄化程度的持续加重使得家庭医疗护理服务逐渐发展。本文针对家庭护理人员调度优化问题,考虑医患的技能匹配、加班费用、加班时长和工作量分配的均衡性等因素,设定最大技能偏差和工作时长,建立了最小化运营成本和最小化最大加班时长的双目标混合整数规划模型。设计了改进的NSGA-II和SPEA-II算法对问题进行求解,数值实验表明:最大加班时长越长,运营成本越小;最大技能偏差和医护人员早到惩罚对目标的影响明显;小规模算例中两算法均表现良好,大中型规模算例中改进SPEA-II的效率更高。

关键词: 家庭护理, 技能匹配, 加班时长, 带时间窗车辆路径问题

CLC Number:

TP301

XIANG Ting, LI Yan-feng. A Bi-objective Home Health Care Scheduling Problem: Based on Costs and Overtime[J]. Operations Research and Management Science, 2021, 30(8): 233-239.

向婷, 李妍峰. 基于成本和加班时长的双目标家庭护理人员调度问题[J]. 运筹与管理, 2021, 30(8): 233-239.

References

[1] Cissé M, Yalçndaĝ S, Kergosien Y, et al. OR problems related to home health care: a review of relevant routing and scheduling problems[J]. Operations Research for Health Care, 2017, 13-14: 1-22.
[2] Rest K D, Hirsch P. Daily scheduling of home health care services using time-dependent public transport[J]. Flexible Services & Manufacturing Journal, 2016, 28(3): 1-31.
[3] Hiermann G, Prandtstetter M, Rendl A, et al. Metaheuristics for solving a multimodal home-health care scheduling problem[J]. Central European Journal of Operations Research, 2015, 23(1): 89-113.
[4] Braekers K, Hartl R F, Parragh S N, et al. A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience[J]. European Journal of operational Research, 2016, 248(2): 428-443.
[5] Bredström D, Rönnqvist M. Combined vehicle routing and scheduling with temporal precedence and synchronization constraints[J]. European Journal of Operational Research, 2008, 191(1): 19-31.
[6] Lanzarone E, Matta A. Robust nurse-to-patient assignment in home care services to minimize overtimes under continuity of care[J]. Operation Research for Health Care, 2014, 3(2): 48-58.
[7] 袁彪,刘冉,江志斌.多类型家庭护理人员调度问题研究[J].系统工程学报,2017,32(1):136-144.
[8] Bertels S, Fahle T. A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem[J]. Computers & Operations Research, 2006, 33(10): 2866-2890.
[9] Laumanns M, Thiele L, and Zitzler E. An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method[J]. European Journal of Operational Research, 2006, 169(3): 932-942.
[10] Deb K, Agrawal S, Pratap A, and Meyarivan T. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimisation: NSGA-II[C]. International Conference on Parallel Problem Solving from Nature. Springer-Verlag, 2000: 849-858.
[11] Zitzler E, Laumanns M, and Thiele L. SPEA2: improving the strength pareto evolutionary algorithm[C]. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, Athens, Greece, 2001. 95-100.
[12] Alinaghian M, Zamanlou K, and Sabbagh M S. A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem[J]. Journal of the Operational Research Society, 2017. 1-20.
[13] Mandal S K, Pacciarelli D, and Hasle G. A memetic NSGA-II for the bi-objective mixed capacitated general routing problem[J]. Journal of Heuristics, 2015, 21(3): 359-390.
[14] Solomon M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 254-265.
[15] 郑金华,蒋浩,邝达,等.用擂台赛法则构造多目标Pareto最优解集的方法[J].软件学报,2007,18(6):1287-1297.
[16] Lei D, Zheng Y, Guo X. A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption[J]. International Journal of Production Research, 2017, 55(11): 3126-3140.

A Bi-objective Home Health Care Scheduling Problem: Based on Costs and Overtime

基于成本和加班时长的双目标家庭护理人员调度问题

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 1

Recommended Articles

Metrics