| 485 | 7 | 203 |
| 下载次数 | 被引频次 | 阅读次数 |
随着我国老龄人口数量的不断增长以及家庭护理观念的普及，用户日渐青睐居家接受个性化的家庭护理服务。然而护理服务资源在不同区域、机构的配置程度存在差异，单一机构难以满足用户快速增长的多样化、个性化需求。为缓解护理服务资源供需不均衡情况，将协同服务思想引入家庭护理，提出家庭护理人员协同调度与路径规划问题，考虑多个护理中心协同服务同一客户的不同需求。在现有护理资源不变的条件下，通过对资源统筹优化，提高护理资源利用率，使得护理人员的调度方案更加灵活合理，在满足客户需求的前提下达到降低护理中心运营成本的目的。为了研究该问题，首先建立了以护理人员启用、行驶、正常工作、加班工作总成本最小，包含客户需求、护理人员工作时长等约束的家庭护理人员协同调度的数学规划模型；其次，考虑护理人员和客户需求所具备的特性，根据贪心、随机、自适应思想，结合贪心随机启发式和迭代局部搜索等多种方法设计了具有自适应反馈机制的混合贪心随机自适应搜索算法；最后，基于标准算例的仿真实验测试评估所设计算法的性能。实验结果表明：设计的算法相比优化软件GUROBI和标准GRASP能够更加高效、高质量地求解家庭护理人员协同调度与路径规划问题；同时引入协同思想能够大幅缩减运营成本并提高护理人员利用率。
Abstract：Traditional outpatient medical services require patients to visit hospitals for treatment, inhibiting patients from receiving convenient, efficient, and high-quality medical services. With the popularization and application of internet technology, the emergence of“internet-nursing service”has enabled users to receive health care at home, bringing them great convenience and efficiency.However, the supply of medical resources varies across different regions and institutions, and it is difficult for a single institution to meet the diverse and personalized needs of users with rapid growth.Collaborative services were introduced into home health care as a solution to the imbalanced supply and demand for medical resources, and the collaborative multi-depot home health care problem was discussed, considering the collaborative service of multiple care centers for multi-demand customers.This study aims to minimize the operating costs of care centers by coordinating and optimizing medical resources and by planning flexible and reasonable scheduling plans for caregivers while meeting customers' needs. The problem is formulated as a mathematical programming model with the objective of minimizing the total cost of fixed, traveling, normal working, overtime working, and constraints of customer demand and caregiver working duration. Moreover, considering the characteristics of the studied problem, a hybrid greedy randomized adaptive search procedure with an adaptive feedback mechanism combining greedy random heuristic and iterative local search methods was designed based on greedy, random, and adaptive ideas. Finally, the performance of the designed algorithm was evaluated by testing benchmark instances in simulation experiments. Compared with the optimization software GUROBI and the standard greedy randomized adaptive search procedure, the proposed algorithm solved the studied problem more efficiently, providing high-quality solutions.Therefore, collaborative services can significantly reduce operating costs and improve caregiver utilization.
[1]国家卫生健康委办公厅.国家卫生健康委办公厅关于开展“互联网+护理服务”试点工作的通知.[EB/OL](2019-02-12)[2023-5-07] http://www.nhc.gov.cn/yzygj/s7657g/201902/bf0b25379ddb48949e7e21edae2a02da.shtml.
[2] EUCHI J, ZIDI S, LAOUAMER L. A hybrid approach to solve the vehicle routing problem with time windows and synchronized visits in-home health care[J]. Arabian Journal for Science and Engineering, 2020, 45(12):10637-10652.
[3] GUERICKE D, SUHL L. The home health care problem with working regulations[J]. OR Spectrum, 2017, 39(4):977-1010.
[4] CATTAFI M, HERRERO R, GAVANELLI M, et al. An application of constraint solving for home health care[J].AI Communications, 2015, 28(2):215-237.
[5] XIAO L, DRIDI M, EL HASSANI A H. Mathematical model for the home health care scheduling and routing problem with flexible lunch break requirements[J]. IFACPapersOnLine, 2018, 51(11):334-339.
[6] MOSQUERA F, SMET P, VANDEN BERGHE G. Flexible home care scheduling[J]. Omega, 2019, 83:80-95.
[7] MANKOWSKA D S, 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.
[8]陶杨懿，刘冉，江志斌.具有同时服务需求的家庭护理人员调度研究[J].工业工程与管理, 2017, 22(3):120-127, 143.TAO Yangyi, LIU Ran, JIANG Zhibin. Home health care routing problem with time windows and synchronization[J]. Industrial Engineering and Management, 2017, 22(3):120-127, 143.
[9] CINAR A, SALMAN F S, BOZKAYA B. Prioritized single nurse routing and scheduling for home healthcare services[J]. European Journal of Operational Research,2021, 289(3):867-878.
[10] LIU R, YUAN B, JIANG Z. The large-scale periodic home health care server assignment problem:a region-partitionbased algorithm[J]. IEEE Transactions on Automation Science and Engineering, 2020, 17(3):1543-1554.
[11]袁彪，刘冉，江志斌.多类型家庭护理人员调度问题研究[J].系统工程学报, 2017, 32(1):136-144.YUAN Biao, LIU Ran, JIANG Zhibin. Multi-type home care worker scheduling and routing problems[J]. Journal of Systems Engineering, 2017, 32(1):136-144.
[12] RIAZI S, WIGSTR?M O, BENGTSSON K, et al. A column generation-based gossip algorithm for home healthcare routing and scheduling problems[J]. IEEE Transactions on Automation Science and Engineering, 2019, 16(1):127-137.
[13] LIU W, DRIDI M, FEI H, et al. Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks[J]. Expert Systems with Applications,2021, 183:115307.
[14] LIU R, YUAN B, JIANG Z. A branch-and-price algorithm for the home-caregiver scheduling and routing problem with stochastic travel and service times[J]. Flexible Services and Manufacturing Journal, 2019, 31(4):989-1011.
[15] DECERLE J, GRUNDER O, EL HASSANI A H, et al. A matheuristic for a multi-depot home health care problem[J]. IFAC-PapersOnLine, 2018, 51(11):340-345.
[16] DECERLE J, GRUNDER O, HAJJAM EL HASSANI A,et al. A hybrid memetic-ant colony optimization algorithm for the home health care problem with time window,synchronization and working time balancing[J]. Swarm and Evolutionary Computation, 2019, 46:171-183.
[17] DECERLE J, GRUNDER O, EL HASSANI A H, et al. A matheuristic-based approach for the multi-depot home health care assignment, routing and scheduling problem[J].RAIRO-Operations Research, 2021, 55:S1013-S1036.
[18]范厚明，刘鹏程，刘浩，等.多中心联合配送模式下集货需求随机的VRPSDP问题[J].自动化学报, 2021, 47(7):1646-1660.FAN Houming, LIU Pengcheng, LIU Hao, et al. The multi-depot vehicle routing problem with simultaneous deterministic delivery and stochastic pickup based on joint distribution[J]. Acta Automatica Sinica, 2021, 47(7):1646-1660.
[19]侯登凯，范厚明，任晓雪.时变路网下多中心混合车队联合配送车辆路径优化[J].大连海事大学学报, 2022,48(1):11-22.HOU Dengkai, FAN Houming, REN Xiaoxue. Vehicle routing optimization of multi-center hybrid fleet joint distribution under time-varying road network[J]. Journal of Dalian Maritime University, 2022, 48(1):11-22.
[20]刘艳秋，韩晶.货车搭载多架无人机车辆路径问题模型及算法[J].交通运输工程与信息学报, 2022, 20(3):102-113.LIU Yanqiu, HAN Jing. Model and algorithm for a vehicle routing problem using multiple drones[J]. Journal of Transportation Engineering and Information, 2022, 20(3):102-113.
[21] WANG Y, LI Q, GUAN X, et al. Two-echelon collaborative multi-depot multi-period vehicle routing problem[J]. Expert Systems with Applications, 2021, 167:114201.
[22] SACRAMENTO D, PISINGER D, ROPKE S. An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones[J]. Transportation Research Part C:Emerging Technologies, 2019, 102:289-315.
[23] KITJACHAROENCHAI P, MIN B C, LEE S. Two echelon vehicle routing problem with drones in last Mile delivery[J]. International Journal of Production Economics, 2020, 225:107598.
[24] GANSTERER M, HARTL R F. Collaborative vehicle routing:a survey[J]. European Journal of Operational Research, 2018, 268(1):1-12.
[25] MANCINI S, GANSTERER M, HARTL R F. The collaborative consistent vehicle routing problem with workload balance[J]. European Journal of Operational Research, 2021, 293(3):955-965.
[26] MOLENBRUCH Y, BRAEKERS K, CARIS A. Benefits of horizontal cooperation in dial-a-ride services[J].Transportation Research Part E:Logistics and Transportation Review, 2017, 107:97-119.
[27] WANG Y, ZHANG J, ASSOGBA K, et al. Collaboration and transportation resource sharing in multiple centers vehicle routing optimization with delivery and pickup[J]. Knowledge-Based Systems, 2018, 160:296-310.
[28] FEO T A, RESENDE M G C. Greedy randomized adaptive search procedures[J]. Journal of Global Optimization, 1995, 6(2):109-133.
[29] HOSSEINI A, WADBRO E. A hybrid greedy randomized heuristic for designing uncertain transport network layout[J]. Expert Systems with Applications, 2022, 190:116151.
[30] NGUYEN V P, PRINS C, PRODHON C. A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem[J]. Engineering Applications of Artificial Intelligence, 2012, 25(1):56-71.
[31]张建同，丁烨.变邻域模拟退火算法求解速度时变的VRPTW问题[J].运筹与管理, 2019, 28(11):77-84.ZHANG Jiantong, DING Ye. Simulated annealing with variable neighborhood for time-dependent vehicle routing problem with time window[J]. Operations Research and Management Science, 2019, 28(11):77-84.
[32]李路遥，沈一帆，夏俊，等.考虑一致性约束的车辆路径问题综述[J].交通运输工程与信息学报, 2021, 19(4):62-74.LI Luyao, SHEN Yifan, XIA Jun, et al. A survey of the consistent vehicle routing problem[J]. Journal of Transportation Engineering and Information, 2021, 19(4):62-74.
[33] HA Q M, DEVILLE Y, PHAM Q D, et al. On the Mincost traveling salesman problem with drone[J]. Transportation Research Part C:Emerging Technologies, 2018,86:597-621.
[34] MAO J Y, PAN Q K, MIAO Z H, et al. An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance[J]. Expert Systems with Applications, 2021, 169:114495.
基本信息:
DOI：10.19961/j.cnki.1672-4747.2023.08.010
中图分类号:R473.2
引用信息:
[1]刘晶,方云飞,蔡艺璇.家庭护理人员协同调度与路径规划研究[J].交通运输工程与信息学报,2024,22(02):116-133.DOI:10.19961/j.cnki.1672-4747.2023.08.010.
基金信息:
国家社科基金一般项目（23BGL296）; 福建省社会科学规划一般项目（FJ2020B036）; 福建省自然科学基金面上项目（2023J01392）
2023-11-22
2023-11-22
2023-11-22