Chengwan He
ABSTRACT
The workforce scheduling and routing problem (WSRP) is a very complex optimization problem. A new method of multi-constraint personnel allocation based on problem decomposition and simulated annealing for home health care service is proposed. The core idea of this method is to divide nursing staffs and nursing applicants into different groups according to geographical location, and use simulated annealing to assign tasks to each group respectively, so as to reduce the number of tasks assigned each time and reduce the calculation time of task assignment. The simulated annealing algorithm is used to solve the global optimal solution. Our approach divides the tasks and caregivers into one-to-one groups according to their location, the order of assignment of task groups does not affect the assignment results. Experimental results show that this method is effective in reducing the time cost of automatic allocation and improving the proportion of tasks assigned.
- Castillo-Salazar, J. Arturo and Landa-Silva, Dario and Qu, Rong (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239 (1), 39--67.Google Scholar
Cross Ref
- Rodrigo Lankaites Pinheiro, Haneen Algethami, and Dario Landa-Silva (2015). Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem. International Conference on Operations Research and Enterprise Systems, 191--211.Google Scholar
- Rob A Rutenbar (1989). Simulated annealing algorithms: an overview. IEEE Circuits & Devices, 5(1), 19--26.Google ScholarCross Ref
- D. Fodorean, L. Idoumghar, A. N'diaye, D. Bouquain, and A. Miraoui (2012). Simulated annealing algorithm for the optimisation of an electrical machine. IET Electr. Power Appl., 6(9), 735--742.Google ScholarCross Ref
- J. Jenifer, S. Anand and Y. Levingstan (2016). Simulated Annealing Algorithm For Modern VLSI Floorplanning Problem. ICTACT Journal on Microelectronics, 02(01), 175--181.Google ScholarCross Ref
- S. K. Alexander, P. Fieguth, M. A. Ioannidis, and E. R. Vrscay (2009). Hierarchical annealing for synthesis of binary images. Mathematical Geosciences, 41(4), 357--378.Google ScholarCross Ref
- MENG Fan-Chao, CHU Dian-Hui, LI Ke-Qiu, and ZHOU Xue-Quan (2016). Solving SaaS Components Optimization Placement Problem with Hybird Genetic and Simulated Annealing Algorithm. Journal of Software, 27(04), 916--932.Google Scholar
- Ouyang Ji, Lin Weijia, Zhuo Xiaoyan, Qin Yong, and Huang Han (2015). Solving nurse rostering problem based on hybrid integer programming and evolutionary algorithm. Application Research of Computers, 32(12), 3660--3664.Google Scholar
- SHEN Yin-dong, and SU Guang-hui (2010). Models and Solutions Based on Switch Rules for Nurse Scheduling with Constraints. Computer Science & Engineering, 32(07), 99--103+111.Conference Name:ACM Woodstock conferenceGoogle Scholar
Recommendations
Optimal Scheduling in Home Health Care: Pharmacy-Hospital-Patient's Vehicle Routing Problem
CSAE '19: Proceedings of the 3rd International Conference on Computer Science and Application EngineeringVehicle routing plays an important role in Home Health Care (HHC) logistics. In this paper, HHC concerns the delivery of medical commodities from pharmacy to patient, delivery of special drugs from hospital to patient, pickup of unused medical ...
Home health care routing and scheduling
In home health care (HHC) operations, nurses are scheduled and routed to perform various services at clients' homes. As this often requires a combination of vehicle routing and scheduling approaches, resulting optimization problems are complex and, ...
Current Issues in Health Care Informatics
Health care informatics has emerged as a diverse and important new field of study. The field can be very broadly defined as the science that addresses how best to use information to improve health care. The field includes the four areas of ...
Comments