Browsing by Author "Hung, Lun-Ping"

Now showing 1 - 3 of 3

A multiple warning and smart monitoring system using wearable devices for home care
(2020-04-01)
Hung, Lun-Ping
;
Lin, Chun-Cheng
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
In line with the advanced medical technologies and popularity of media (especially, social media), an emerging trend regarding remote home care services has received increasing attention. This paper proposed a smart system for assistance in the home self-care process, which concentrates on a management process for real-time analysis on patient information (e.g., psychological status). The proposed system provides the EKG (electrocardiogram) home monitoring function for the care of patient cases after cardiovascular surgery. To provide supports for self-care at home, a private cloud was employed to design intelligent modules that implemented the smart system. In addition, professional medical advices and response measures were proposed so that individuals could safely and effectively engage self-care at home under the support. We conducted a user study, and the experiment results showed that the proposed approach can reduce partial costs on human resources for home care and enhance the quality of medical service, thereby achieving the goal of seamless integration of external healthcare systems of hospital.
Jointly rostering, routing, and rerostering for home health care services: A harmony search approach with genetic, saturation, inheritance, and immigrant schemes
(2018-01-01)
Lin, Chun-Cheng
;
Hung, Lun-Ping
;
Liu, Wan-Yu
;
Tsai, Ming-Chun
;
工業工程與管理學系
In 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.
On the medication distribution system for home health care through convenience stores, lockers, and home delivery
(1970-01-01)
Suwatcharachaitiwong, Sirirat
;
Lin, Chun-Cheng
;
Huang, Weidong
;
Hung, Lun-Ping
;
交大名義發表
Medication distribution service can be delivered based on a combination of home delivery and customer pickup. That is, medications are delivered either to customers' homes directly or to the pickup facilities (e.g. lockers) close to customers' homes. In Taiwan, there are more than 11,000 convenience stores that provide a 24-h service for customers to pick up the ordered items from e-commerce, which is unique to the world. In the medication distribution system, convenience stores can provide a unique opportunity for customers to more conveniently collect medications at stores, and also can reduce the operating cost for a logistics company providing the medication delivery service. Therefore, this work proposes a medication distribution system through convenience stores, lockers, and home delivery. Under this system, this work investigates how to simultaneously determine employment of convenience store chains, the convenience store locations to be visited, locations of lockers, vehicle routes for convenience stores and lockers, and vehicle routes for customers' homes, so that the total operating cost is minimized. This work further proposes a genetic algorithm to solve the medication distribution problem. Through simulation, the experimental results show that the proposed algorithm is able to solve the problem efficiently.