Visiting nurses assignment and routing for decentralized telehealth service networks

被引:0
|
作者
Yu, Tan [1 ]
Guan, Yongpei [1 ]
Zhong, Xiang [1 ]
机构
[1] Univ Florida, Dept Ind & Syst Engn, Stadium Rd, Gainesville, FL 32611 USA
基金
美国国家科学基金会;
关键词
Vehicle routing problem; Telehealth; Column generation; Heuristic algorithm; HEALTH-CARE; COLUMN GENERATION; SCHEDULING PROBLEM; TRANSPORTATION BARRIERS; ALGORITHM; OPTIMIZATION;
D O I
10.1007/s10479-024-05883-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
As telehealth utilization for ambulatory and home-based care skyrockets, there has been a paradigm shift to a decentralized and hybrid care delivery modality integrating both in-person and telehealth services provided at different layers of the care delivery network, i.e., central hospitals, satellite clinics, and patient homes. The operations of such care delivery systems need to take into consideration patients' mobility and care needs, and rely on multiple types of nurses who can support and facilitate telehealth (with hospital physicians) in clinics and patient homes. We formulate an optimization problem, aiming at operationalizing the proposed care delivery network. Decisions regarding the type of care delivered, the location of care delivered, and the scheduling of all kinds of nurses are determined jointly to minimize operating costs while simultaneously satisfying patients' care needs. We propose a bi-level approximation that exploits the structure of the hybrid telehealth system, and develop column generation-based heuristic algorithms to identify the joint decision rules for clinic selection, patient assignment, and visiting nurse routing problems. Numerical experiment results demonstrate our algorithm's capability to achieve high-quality solutions in reasonable computation time, and is capable of solving instances with large patient sizes and time windows. Our work supports the efficient and effective operation of the proposed hybrid telehealth systems to improve patient access to care.
引用
收藏
页码:1191 / 1221
页数:31
相关论文
共 50 条
  • [31] XVR: X visiting-pattern routing for sensor networks
    He, Y
    Raghavendra, CS
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 1758 - 1769
  • [32] DECENTRALIZED ROUTING ALGORITHM FOR PACKET-SWITCHED NETWORKS
    SHEMETOV, VV
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1985, (06): : 17 - 26
  • [33] Decentralized routing on spatial networks with stochastic edge weights
    Hoffmann, Till
    Lambiotte, Renaud
    Porter, Mason A.
    PHYSICAL REVIEW E, 2013, 88 (02)
  • [34] DECENTRALIZED OPTIMAL ROUTING FOR PACKETS FLOW ON DATA NETWORKS
    Cascone, A.
    Marigo, A.
    Piccoli, B.
    Rarita, L.
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B, 2010, 13 (01): : 59 - 78
  • [35] A Decentralized Routing Control Scheme for Data Communication Networks
    Si, Xueming
    Zhu, Xun-Lin
    Du, Xin
    Xie, Xiangpeng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [36] ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS
    Qi Xiaogang Liu Lifang* Liu Sanyang (Department of Mathematics Science
    Journal of Electronics(China), 2006, (05) : 723 - 730
  • [37] Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks
    Assis, K. D. R.
    Santos, A. F.
    Giozza, W. F.
    IEEE LATIN AMERICA TRANSACTIONS, 2010, 8 (03) : 214 - 220
  • [38] ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS
    Qi Xiaogang Liu Lifang Liu Sanyang Department of Mathematics Science Xidian University Xian China School of Computer Science Technology Xidian University Xian China
    Journal of Electronics, 2006, (05) : 723 - 730
  • [39] Efficient routing and wavelength assignment for multicast in WDM networks
    Chen, B
    Wang, JP
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2002, 20 (01) : 97 - 109
  • [40] Comparison of routing and wavelength assignment algorithms for optical networks
    Ohta, S
    Greca, A
    2001 IEEE WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2001, : 146 - 149