A comprehensive location-allocation method for specialized healthcare services

被引:29
|
作者
Syam, Siddhartha S. [1 ]
Cote, Murray J. [2 ]
机构
[1] Marquette Univ, Dept Management, Milwaukee, WI 53201 USA
[2] Texas A&M Hlth Sci Ctr, Dept Hlth Policy & Management, College Stn, TX 77843 USA
关键词
Design of experiments; Integer programming; Location-allocation; Simulated annealing;
D O I
10.1016/j.orhc.2012.09.001
中图分类号
R19 [保健组织与事业(卫生事业管理)];
学科分类号
摘要
This paper focuses on the development, solution, and application of a location-allocation model for specialized health care services such as the treatment and rehabilitation necessary for strokes or traumatic brain injuries. The model is based on our experience with the Department of Veterans Affairs' integrated service networks. The model minimizes the total cost borne by the health system and its patients and incorporates admission acuity levels, service proportion requirements, and admission retention rates. A common resource constraint is introduced at the facility level since treatment of multiple acuity levels involves the pooling of common resources. Realistic instances of the model with 20 potential service locations, 50 admission districts and up to five open treatment units for three levels of severity are solved in about 300 seconds. The applicability of the model is tested by an extensive managerial experiment using data derived from one of the Department of Veterans Affairs specialized healthcare services. We investigate the effects of five critical factors: (1) the degree of service centralization, (2) service level mandates by acuity, (3) lost admission cost by acuity, (4) facility overload penalty cost by acuity and (5) target utilization level by acuity and treatment unit. We examine the countervailing forces present in making healthcare service location decisions and the resulting tradeoffs from the implicitly multiobjective nature of the system. The experiment and analysis demonstrate that the major factors of the experiment have a significant bearing on the optimal assignment of admission districts to treatment units. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:73 / 83
页数:11
相关论文
共 50 条
  • [1] A Stochastic Location-Allocation Model for Specialized Services in a Multihospital System
    Naboureh, Khadijeh
    Safari, Ehram
    [J]. ADVANCES IN OPERATIONS RESEARCH, 2016, 2016
  • [2] Accessibility of HIV Services in Philadelphia: Location-Allocation Analysis
    Webster, Jessica L.
    Thorpe, Lorna E.
    Duncan, Dustin T.
    Goldstein, Neal D.
    [J]. AMERICAN JOURNAL OF PREVENTIVE MEDICINE, 2022, 63 (06) : 1053 - 1061
  • [3] HYBRID EVOLUTIONARY METHOD FOR OBSTACLE LOCATION-ALLOCATION
    GONG, DJ
    GEN, M
    XU, WX
    YAMAZAKI, G
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 29 : 525 - 530
  • [4] Choice-driven location-allocation model for healthcare facility location problem
    Hwang, Kyosang
    Asif, Tooba Binte
    Lee, Taesik
    [J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2022, 34 (04) : 1040 - 1065
  • [5] Choice-driven location-allocation model for healthcare facility location problem
    Kyosang Hwang
    Tooba Binte Asif
    Taesik Lee
    [J]. Flexible Services and Manufacturing Journal, 2022, 34 : 1040 - 1065
  • [6] OPTIMAL LOCATION-ALLOCATION
    WESTER, L
    VOLTAGGIO, EJ
    KANTNER, HH
    [J]. OPERATIONS RESEARCH, 1958, 6 (04) : 634 - 634
  • [7] LOCATION-ALLOCATION PROBLEMS
    COOPER, L
    [J]. OPERATIONS RESEARCH, 1963, 11 (03) : 331 - 343
  • [8] A location-allocation problem for a web services provider in a competitive market
    Aboolian, Robert
    Sun, Yi
    Koehler, Gary J.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (01) : 64 - 77
  • [9] Hybrid evolutionary method for capacitated location-allocation problem
    Gong, DJ
    Gen, M
    Yamazaki, G
    Xu, WX
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (3-4) : 577 - 580
  • [10] Genetic subgradient method for solving location-allocation problems
    Doong, Shing-Hwang
    Lai, Chih-Chin
    Wu, Chih-Hung
    [J]. APPLIED SOFT COMPUTING, 2007, 7 (01) : 373 - 386