[1] LIU R, XIE X L. 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(3): 475-486 [2] EVEBORN P, FLISBERG P, RONNQVIST M. Laps care: an operational system for staff planning of home care[J]. European Journal of Operational Research, 2006, 171(3): 962-976 [3] CISSE M, YALCINDAG 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 [4] FIKAR C, HIRSCH P. Home health care routing and scheduling: a review[J]. Computers & Operations Research, 2017, 77: 86-95 [5] MUTINGI M, MBOHWA C. Multi-objective home care worker scheduling: a fuzzy simulated evolution algorithm approach[J]. IIE Transactions on Healthcare Systems Engineering, 2014, 4(4): 209-216 [6] MARTIN E, CERVANTES A, SAEZ Y, et al. IACS-HCSP: improved ant colony optimization for large-scale home care scheduling problems[J]. Expert Systems with Applications, 2020, 142: 1-36 [7] LIU R, YUAN B, JIANG Z. Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements[J]. International Journal of Production Research, 2017, 55(2): 558-575 [8] REDJEM R, MARCON E. Operations management in the home care services: a heuristic for the caregivers' routing problem[J]. International Journal of Flexible Manufacturing Systems, 2016, 28(1-2): 280-303 [9] 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 [10] ANDREA T, MANFRED G, PATRICK H. Securing home health care in times of natural disasters[J]. Operations Research Spektrum., 2011, 33(3): 787-813 [11] HIERMANN G, PRANDTSTETTER M, RENDL A, et al. Metaheuristics for solving a multimodal home-healthcare scheduling problem[J]. Central European Journal of Operations Research, 2015, 23(1): 89-113 [12] 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 [13] DANTZIG G B, WOLFE P. Decomposition principle for linear programs[J]. Operations Research, 1960, 8(1): 101-111 [14] FEILLET D. A tutorial on column generation and branch-and-price for vehicle routing problems[J]. 4OR-A Quarterly Journal of Operations Research, 2010, 8(4): 407-424 [15] FEILLET D, DEJAX P, GENDREAU M, et al. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems[J]. Networks, 2004, 44(3): 216-229 [16] LOACHIM I, GELINAS S, SOUMIS F, et al. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs[J]. Networks, 1998, 31(3): 193-204 [17] LI J L, QIN H, BALDACCI R, et al. Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows[J]. Transportation Research:Part E, 2020, 140: 1-22 [18] BARNHART C, JOHNSON E L, NEMHAUSER G L, et al. Branch-and-price: column generation for solving huge integer programs[J]. Operations Research, 1998, 46(3): 316-329 [19] ZHANG Z Z, LUO Z X, QIN H, et al. Exact algorithms for the vehicle routing problem with time windows and combinatorial auction[J]. Transportation Science, 2019, 53(2): 427-441 [20] SOLOMON M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 254-265
|