完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Chun-Chengen_US
dc.contributor.authorHung, Lun-Pingen_US
dc.contributor.authorLiu, Wan-Yuen_US
dc.contributor.authorTsai, Ming-Chunen_US
dc.date.accessioned2018-08-21T05:53:18Z-
dc.date.available2018-08-21T05:53:18Z-
dc.date.issued2018-01-01en_US
dc.identifier.issn0360-8352en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.cie.2017.11.004en_US
dc.identifier.urihttp://hdl.handle.net/11536/144525-
dc.description.abstractIn home health care (HHC) services, nurses or professional caregivers are dispatched to patients' homes to provide medical care services, such that each patient can stay at home to be treated periodically. The HHC problem consists of the nurse rostering problem (NRP) and the vehicle routing problem with time windows (VRPTW), both of which are NP-hard problems, which are harder or equal to the hardest problem in the NP (nondeterministic polynomial time) problem class and generally cannot be solved efficiently. To the best of our knowledge, the previous algorithmic approaches were designed to separately address NRP and VRPTW of the HHC problem. However, NRP and VRPTW of the HHC problem are intercorrelated, and their respective optimal objectives may be in conflict with each other in many cases. Additionally, the problem generally involves too many constraints to be solved, and most previous works did not address occurrence of sudden incidents in HHC services (e.g., a nurse or a patient suddenly requests for a leave, and a patient suddenly changes the time slot to be treated) such that the original nurse roster could become infeasible. Under constraints of nurse qualifications, working laws, nurse preferences, and vehicle routing, the first model considers nurse rostering and vehicle routing concurrently to minimize total costs of nurse overtime and vehicle routing. The second model extends the first model with rerostering caused by occurrence of sudden incidents. Harmony search algorithm (HSA) has been shown to perform better in solving NRPs than conventional metaheuristics, and hence this work proposes an improved HSA with genetic and saturation schemes, in which the solution representation is designed to concurrently determine nurse rostering and vehicle routing. For the second rerostering model, inheritance and immigrant schemes are added to the HSA to adapt to the change caused by occurrence of sudden incidents. Experimental results show that the proposed HSA performs well and can adapt to the change caused by sudden incidents.en_US
dc.language.isoen_USen_US
dc.subjectHome health care serviceen_US
dc.subjectNurse rosteringen_US
dc.subjectVehicle routing problemen_US
dc.subjectRerosteringen_US
dc.subjectHarmony search algorithmen_US
dc.subjectMetaheuristic algorithmen_US
dc.titleJointly rostering, routing, and rerostering for home health care services: A harmony search approach with genetic, saturation, inheritance, and immigrant schemesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.cie.2017.11.004en_US
dc.identifier.journalCOMPUTERS & INDUSTRIAL ENGINEERINGen_US
dc.citation.volume115en_US
dc.citation.spage151en_US
dc.citation.epage166en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000425075400014en_US
顯示於類別:期刊論文