Journal Home > Volume 3 , Issue 1

At present, home health care (HHC) has been accepted as an effective method for handling the healthcare problems of the elderly. The HHC scheduling and routing problem (HHCSRP) attracts wide concentration from academia and industrial communities. This work proposes an HHCSRP considering several care centers, where a group of customers (i.e., patients and the elderly) require being assigned to care centers. Then, various kinds of services are provided by caregivers for customers in different regions. By considering the skill matching, customers’ appointment time, and caregivers’ workload balancing, this article formulates an optimization model with multiple objectives to achieve minimal service cost and minimal delay cost. To handle it, we then introduce a brain storm optimization method with particular multi-objective search mechanisms (MOBSO) via combining with the features of the investigated HHCSRP. Moreover, we perform experiments to test the effectiveness of the designed method. Via comparing the MOBSO with two excellent optimizers, the results confirm that the developed method has significant superiority in addressing the considered HHCSRP.


menu
Abstract
Full text
Outline
About this article

A Multi-Objective Scheduling and Routing Problem for Home Health Care Services via Brain Storm Optimization

Show Author's information Xiaomeng Ma1Yaping Fu1( )Kaizhou Gao2Lihua Zhu3Ali Sadollah4
School of Business, Qingdao University, Qingdao 266071, China
Institute of Systems Engineering, Macau University of Science and Technology, Macau 999078, China
College of Public Health, Shanghai University of Medicine and Health Sciences, Shanghai 201318, China
Department of Mechanical Engineering, University of Science and Culture, Tehran, 146899-5513, Iran

Abstract

At present, home health care (HHC) has been accepted as an effective method for handling the healthcare problems of the elderly. The HHC scheduling and routing problem (HHCSRP) attracts wide concentration from academia and industrial communities. This work proposes an HHCSRP considering several care centers, where a group of customers (i.e., patients and the elderly) require being assigned to care centers. Then, various kinds of services are provided by caregivers for customers in different regions. By considering the skill matching, customers’ appointment time, and caregivers’ workload balancing, this article formulates an optimization model with multiple objectives to achieve minimal service cost and minimal delay cost. To handle it, we then introduce a brain storm optimization method with particular multi-objective search mechanisms (MOBSO) via combining with the features of the investigated HHCSRP. Moreover, we perform experiments to test the effectiveness of the designed method. Via comparing the MOBSO with two excellent optimizers, the results confirm that the developed method has significant superiority in addressing the considered HHCSRP.

Keywords: multi-objective optimization, home health care, multi-center service, scheduling and routing problems, brain storm optimization

References(54)

[1]

X. R. Gong, N. Geng, Y. R. Zhu, A. Matta, and E. Lanzarone, A matheuristic approach for the home care scheduling problem with chargeable overtime and preference matching, IEEE Trans. Autom. Sci. Eng., vol. 18, no. 1, pp. 282–298, 2020.

[2]

Y. F. Li, T. Xiang, and W. Y. Szeto, Home health care routing and scheduling problem with the consideration of outpatient services, Trans. Res. E., vol. 152, p. 102420, 2021.

[3]

F. Goodarzian, A. Abraham, and A. M. Fathollahi-Fard, A biobjective home health care logistics considering the working time and route balancing: A self-adaptive social engineering optimizer, J. Comput. Design. Eng., vol. 8, no. 1, pp. 452–474, 2021.

[4]

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182–197, 2002.

[5]

M. Yang, Y. D. Ni, and L. Yang, A multi-objective consistent home healthcare routing and scheduling problem in an uncertain environment, Comput. Ind. Eng., vol. 160, p. 107560, 2021.

[6]

M. Cissé, S. Yalçındağ, Y. Kergosien, E. Şahin, C. Lenté, and A. Matta, OR problems related to home health care: A review of relevant routing and scheduling problems, Oper. Res. Health Care., vol. 13, pp. 1–22, 2017.

[7]

C. Fikar and P. Hirsch, Home health care routing and scheduling: A review, Comput. Oper. Res., vol. 77, pp. 86–95, 2017.

[8]

A. M. Fathollahi-Fard, A. Ahmadi, F. Goodarzian, and N. Cheikhrouhou, A bi-objective home healthcare routing and scheduling problem considering patients’ satisfaction in a fuzzy environment, Appl. Soft. Comput., vol. 93, p. 106385, 2020.

[9]

E. Martin, A. Cervantes, Y. Saez, and P. Isasi, IACS-HCSP: Improved ant colony optimization for large-scale home care scheduling problems, Expert Syst. Appl., vol. 142, p. 112994, 2020.

[10]

F. Mosquera, P. Smet, and G. V. Berghe, Flexible home care scheduling, Omega, vol. 83, pp. 80–95, 2019.

[11]

M. Erdem and C. Koç, Analysis of electric vehicles in home health care routing problem, J. Clean. Prod., vol. 234, pp. 1471–1483, 2019.

[12]

J. Decerle, O. Grunder, A. H. E. Hassani, and O. Barakat, A memetic algorithm for multi-objective optimization of the home health care problem, Swarm Evol. Comput., vol. 44, pp. 712–727, 2019.

[13]
Y. P. Fu, F. Ding, Z. Y. Mu, C. Y. Sun, and K. Z. Gao, Integrating scheduling and routing decisions into home health care operation with skill requirements and uncertainties, J. Simul.,
[14]

R. Liu, B. Yuan, and Z. B. Jiang, Mathematical model and exact algorithm for the home care worker scheduling and routing problem with lunch break requirements, Int. J. Prod. Res., vol. 55, no. 2, pp. 558–575, 2017.

[15]

F. Grenouilleau, A. Legrain, N. Lahrichi, and L. M. Rousseau, A set partitioning heuristic for the home health care routing and scheduling problem, Eur. J. Oper. Res., vol. 275, no. 1, pp. 295–303, 2019.

[16]

C. C. Lin, L. P. Hung, W. Y. Liu, and M. C. Tsai, Jointly rostering, routing, and rerostering for home health care services: A harmony search approach with genetic, saturation, inheritance, and immigrant schemes, Comput. Ind. Eng., vol. 115, pp. 151–166, 2018.

[17]

Y. Shi, T. Boudouh, and O. Grunder, A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times, Trans. Res. E., vol. 128, pp. 52–95, 2019.

[18]
X. M. Ma, Y. P. Fu, K. Z. Gao, A. Sadollah, and K. Wang, Integration routing and scheduling for multiple home health care centers using a multi-objective cooperation evolutionary algorithm with stochastic simulation, Swarm Evol. Comput.,
[19]

A. Cinar, F. S. Salman, and B. Bozkaya, Prioritized single nurse routing and scheduling for home healthcare services, Eur. J. Oper. Res., vol. 289, no. 3, pp. 867–878, 2021.

[20]

J. Decerle, O. Grunder, A. H. E. Hassani, and O. Barakat, A memetic algorithm for a home health care routing and scheduling problem, Oper. Res. Health Care., vol. 16, pp. 59–71, 2018.

[21]

J. Decerle, O. Grunder, A. H. E. Hassani, and O. Barakat, A hybrid memetic-ant colony optimization algorithm for the home health care problem with time window, synchronization and working time balancing, Swarm Evol. Comput., vol. 46, pp. 171–183, 2019.

[22]
Y. H. Shi, Brain storm optimization algorithm, in Proc. Second Int. Conf. Swarm Intell., Chongqing, China, 2011, pp. 303–309.
DOI
[23]

S. Cheng, Q. D. Qin, J. F. Chen, and Y. H. Shi, Brain storm optimization algorithm: A review, Artif. Intell. Rev., vol. 46, no. 4, pp. 445–458, 2016.

[24]

J. H. Hao, J. Q. Li, Y. Du, M. X. Song, P. Duan, and Y. Y. Zhang, Solving distributed hybrid flowshop scheduling problems by a hybrid brain storm optimization algorithm, IEEE Access, vol. 7, pp. 66879–66894, 2019.

[25]

Y. S. Hou, Y. P. Fu, K. Z. Gao, H. Zhang, and A. Sadollah, Modelling and optimization of integrated distributed flow shop scheduling and distribution problems with time windows, Expert Syst. Appl., vol. 187, p. 115827, 2022.

[26]

L. J. Ke, A brain storm optimization approach for the cumulative capacitated vehicle routing problem, Memetic Comput., vol. 10, no. 4, pp. 411–421, 2018.

[27]

Y. P. Fu, G. D. Tian, A. M. Fathollahi-Fard, A. Ahmadi, and C. Y. Zhang, Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint, J. Clean. Prod., vol. 226, pp. 515–525, 2019.

[28]

K. Z. Gao, Z. G. Cao, L. Zhang, Z. H. Chen, Y. Y. Han, and Q. K. Pan, A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems, IEEE J. Autom. Sini., vol. 6, no. 4, pp. 904–916, 2019.

[29]

P. X. Zhao, W. H. Luo, and X. Han, Time-dependent and bi-objective vehicle routing problem with time windows, Adv. Prod Eng. Manag., vol. 14, no. 2, pp. 201–212, 2019.

[30]

S. F. Ghannadpour and A. Zarrabi, Multi-objective heterogeneous vehicle routing and scheduling problem with energy minimizing, Swarm Evol. Comput., vol. 44, pp. 728–747, 2019.

[31]

F. Wang, F. S. Liao, Y. X. Li, X. S. Yan, and X. Chen, An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows, Comput. Ind. Eng., vol. 154, p. 107131, 2021.

[32]
Y. P. Fu, H. B. Li, M. Huang, and H. Xiao, Bi-objective modeling and optimization for stochastic two-stage open shop scheduling problems in the sharing economy, IEEE Trans. Eng Manag.,
[33]

C. Lu, L. Gao, Q. K. Pan, X. Y. Li, and J. Zheng, A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution, Appl. Soft. Comput., vol. 75, pp. 728–749, 2019.

[34]

E. D. Jiang, L. Wang, and Z. P. Peng, Solving energy-efficient distributed job shop scheduling via multi-objective evolutionary algorithm with decomposition, Swarm Evol. Comput., vol. 58, p. 100745, 2020.

[35]

J. Q. Li, X. L. Chen, P. Y. Duan, and J. H. Mou, KMOEA: A knowledge-based multiobjective algorithm for distributed hybrid flow shop in a prefabricated system, IEEE Trans. Ind. Inf., vol. 18, no. 8, pp. 5318–5329, 2021.

[36]
Y. X. Pan, K. Z. Gao, Z. Li, and N. Wu, Solving biobjective distributed flow-shop scheduling problems with lot-streaming using an improved jaya algorithm, IEEE Trans. Cybern.,
[37]

Y. P. Fu, Y. S. Hou, Z. F. Wang, X. W. Wu, K. Z. Gao, and L. Wang, Distributed scheduling problems in intelligent manufacturing systems, Tsinghua Science and Technology, vol. 26, no. 5, pp. 625–645, 2021.

[38]

C. Lu, L. Gao, X. Y. Li, Q. K. Pan, and Q. Wang, Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm, J. Clean. Prod., vol. 144, pp. 228–238, 2017.

[39]

Y. N. Guo, X. Zhang, D. W. Gong, Z. Zhang, and J. J. Yang, Novel interactive preference-based multiobjective evolutionary optimization for bolt supporting networks, IEEE Trans. Evol. Comput., vol. 24, no. 4, pp. 750–764, 2020.

[40]

T. Vidal, T. G. Crainic, M. Gendreau, and C. Prins, A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Comput. Oper. Res., vol. 40, no. 1, pp. 475–489, 2013.

[41]

Y. Y. Han, J. Q. Li, H. Y. Sang, Y. P. Liu, K. Z. Gao, and Q. K. Pan, Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time, Appl. Soft Comput., vol. 93, p. 106343, 2020.

[42]

Y. P. Fu, M. C. Zhou, X. W. Guo, L. Qi, and K. Sedraoui, Multiverse optimization algorithm for stochastic biobjective disassembly sequence planning subject to operation failures, IEEE Trans. Syst. Man Cybern. Syst., vol. 52, no. 2, pp. 1041–1051, 2021.

[43]
D. C. Montgomery, Design and Analysis of Experiments. Hoboken, NJ, USA: John Wiley & Sons, 2017.
[44]

J. J. Wang and L. Wang, A cooperative memetic algorithm with learning-based agent for energy-aware distributed hybrid flow-Shop scheduling, IEEE Trans. Evol. Comput., vol. 26, no. 3, pp. 461–475, 2021.

[45]

Y. P. Fu, M. C. Zhou, X. W. Guo, and L. Qi, Scheduling dual-objective stochastic hybrid flow shop with deteriorating jobs via bi-population evolutionary algorithm, IEEE Trans. Syst. Man Cyber. Syst., vol. 50, no. 12, pp. 5037–5048, 2019.

[46]

Y. P. Fu, M. C. Zhou, X. W. Guo, and L. Qi, Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm, J. Clean. Prod., vol. 278, p. 123364, 2021.

[47]

A. M. Fathollahi-Fard, M. Hajiaghaei-Keshteli, and R. Tavakkoli-Moghaddam, A bi-objective green home health care routing problem, J. Clean. Prod., vol. 200, pp. 423–443, 2018.

[48]

X. Han, Y. Y. Han, Q. D. Chen, J. Q. Li, H. Y. Sang, Y. P. Liu, Q. K. Pan, and Y. Nojima, Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm, Complex System Modeling and Simulation, vol. 1, no. 3, pp. 198–217, 2021.

[49]

L. J. Yin, X. Y. Li, L. Gao, C. Lu, and Z. Zhang, A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem, Susta. Comput. Inf. Syst., vol. 13, pp. 15–30, 2017.

[50]

X. N. Shen, J. Q. Lu, X. You, L. Y. Song, and Z. P. Ge, A region enhanced discrete multi-objective fireworks algorithm for low-carbon vehicle routing problem, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 142–155, 2022.

[51]
J. J. Ji, Y. N. Guo, X. Z. Gao, D. W. Gong, and Y. P. Wang, Q-learning-based hyperheuristic evolutionary algorithm for dynamic task allocation of crowdsensing, IEEE Trans. Cybern.,
[52]

B. J. Xi and D. M. Lei, Q-learning-based teaching-learning optimization for distributed two-stage hybrid flow shop scheduling with fuzzy processing time, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 113–129, 2022.

[53]

Z. Chen, L. Zhang, X. H. Wang, and P. F. Gu, Optimal design of flexible job shop scheduling under resource preemption based on deep reinforcement learning, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 174–185, 2022.

[54]

L. Wang, Z. X. Pan, and J. J. Wang, A review of reinforcement learning based intelligent optimization for manufacturing scheduling, Complex System Modeling and Simulation, vol. 1, no. 4, pp. 257–270, 2021.

Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 16 September 2022
Revised: 26 October 2022
Accepted: 13 November 2022
Published: 09 March 2023
Issue date: March 2023

Copyright

© The author(s) 2023

Acknowledgements

Acknowledgment

This work was supported in part by the National Natural Science Foundation of China (Nos. 62173356 and 61703320), the Science and Technology Development Fund (FDCT), Macau SAR (No. 0019/2021/A), Shandong Province Outstanding Youth Innovation Team Project of Colleges and Universities (No. 2020RWG011), Natural Science Foundation of Shandong Province (No. ZR202111110025), China Postdoctoral Science Foundation Funded Project (No. 2019T120569), and the Zhuhai Industry-University-Research Project with Hongkong and Macao (No. ZH22017002210014PWC).

Rights and permissions

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return