IDEAS home Printed from https://ideas.repec.org/a/kap/hcarem/v26y2023i4d10.1007_s10729-023-09646-3.html
   My bibliography  Save this article

Select, route and schedule: optimizing community paramedicine service delivery with mandatory visits and patient prioritization

Author

Listed:
  • Shima Azizi

    (Peter J. Tobin College of Business, St. John’s University)

  • Özge Aygül

    (Worcester Polytechnic Institute)

  • Brenton Faber

    (Worcester Polytechnic Institute)

  • Sharon Johnson

    (Worcester Polytechnic Institute)

  • Renata Konrad

    (Worcester Polytechnic Institute)

  • Andrew C. Trapp

    (Worcester Polytechnic Institute
    Worcester Polytechnic Institute)

Abstract

Healthcare delivery in the United States has been characterized as overly reactive and dependent on emergency department care for safety net coverage, with opportunity for improvement around discharge planning and high readmissions and emergency department bounce-back rates. Community paramedicine is a recent healthcare innovation that enables proactive visitation of patients at home, often shortly after emergency department and hospital discharge. We establish the first optimization-based framework to study efficiencies in the management and operation of a community paramedicine program. The collective innovations of our modeling include i) a novel hierarchical objective function with the goals of fairly increasing patient welfare, lowering hospital costs, and reducing readmissions and emergency department visits, ii) a new constraint set that ensures priority same-day visits for emergent patients, and iii) a further extension of our model to determine the minimum supplemental resources necessary to ensure feasibility in a single optimization formulation. Our medical-need based objective function prioritizes patients based on their clinical features and seeks to select and schedule patient visits and route healthcare providers to maximize overall patient welfare while favoring shorter tours. We use our methods to develop managerial insights via computational experiments on a variety of test instances based on real data from a hospital system in Upstate New York. We are able to identify optimal and nearly optimal tours that efficiently select, route, and schedule patients in reasonable timeframes. Our results lead to insights that can support managerial decisions about establishing (and improving existing) community paramedicine programs.

Suggested Citation

  • Shima Azizi & Özge Aygül & Brenton Faber & Sharon Johnson & Renata Konrad & Andrew C. Trapp, 2023. "Select, route and schedule: optimizing community paramedicine service delivery with mandatory visits and patient prioritization," Health Care Management Science, Springer, vol. 26(4), pages 719-746, December.
  • Handle: RePEc:kap:hcarem:v:26:y:2023:i:4:d:10.1007_s10729-023-09646-3
    DOI: 10.1007/s10729-023-09646-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10729-023-09646-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10729-023-09646-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John Bowers & Helen Cheyne & Gillian Mould & Miranda Page, 2015. "Continuity of care in community midwifery," Health Care Management Science, Springer, vol. 18(2), pages 195-204, June.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. Rasmussen, Matias Sevel & Justesen, Tor & Dohn, Anders & Larsen, Jesper, 2012. "The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies," European Journal of Operational Research, Elsevier, vol. 219(3), pages 598-610.
    4. Cinar, Ahmet & Salman, F. Sibel & Bozkaya, Burcin, 2021. "Prioritized single nurse routing and scheduling for home healthcare services," European Journal of Operational Research, Elsevier, vol. 289(3), pages 867-878.
    5. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.
    6. Wouter Souffriau & Pieter Vansteenwegen & Greet Vanden Berghe & Dirk Van Oudheusden, 2013. "The Multiconstraint Team Orienteering Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 47(1), pages 53-63, February.
    7. Zhan, Yang & Wang, Zizhuo & Wan, Guohua, 2021. "Home service routing and appointment scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 98-110.
    8. Gerhard Hiermann & Matthias Prandtstetter & Andrea Rendl & Jakob Puchinger & Günther Raidl, 2015. "Metaheuristics for solving a multimodal home-healthcare scheduling problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(1), pages 89-113, March.
    9. Salma Chahed & Eric Marcon & Evren Sahin & Dominique Feillet & Yves Dallery, 2009. "Exploring new operational research opportunities within the Home Care context: the chemotherapy at home," Health Care Management Science, Springer, vol. 12(2), pages 179-191, June.
    10. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    11. Biao Yuan & Ran Liu & Zhibin Jiang, 2015. "A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7450-7464, December.
    12. Nikzad, Erfaneh & Bashiri, Mahdi & Abbasi, Babak, 2021. "A matheuristic algorithm for stochastic home health care planning," European Journal of Operational Research, Elsevier, vol. 288(3), pages 753-774.
    13. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    14. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    2. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Nasir, Jamal Abdul & Kuo, Yong-Hong, 2024. "Stochastic home care transportation with dynamically prioritized patients: An integrated facility location, fleet sizing, and routing approach," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    4. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    5. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    6. Cinar, Ahmet & Salman, F. Sibel & Bozkaya, Burcin, 2021. "Prioritized single nurse routing and scheduling for home healthcare services," European Journal of Operational Research, Elsevier, vol. 289(3), pages 867-878.
    7. Vahid Akbari & İhsan Sadati & F. Sibel Salman & Davood Shiri, 2023. "Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 807-852, September.
    8. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    9. Maya Duque, P.A. & Castro, M. & Sörensen, K. & Goos, P., 2015. "Home care service planning. The case of Landelijke Thuiszorg," European Journal of Operational Research, Elsevier, vol. 243(1), pages 292-301.
    10. Gang Du & Xi Liang & Chuanwang Sun, 2017. "Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows," Sustainability, MDPI, vol. 9(2), pages 1-22, February.
    11. Gang Du & Luyao Zheng & Xiaoling Ouyang, 2019. "Real-time scheduling optimization considering the unexpected events in home health care," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 196-220, January.
    12. Mahyar Mirabnejad & Hadi Mohammadi & Mehrdad Mirzabaghi & Amir Aghsami & Fariborz Jolai & Maziar Yazdani, 2022. "Home Health Care Problem with Synchronization Visits and Considering Samples Transferring Time: A Case Study in Tehran, Iran," IJERPH, MDPI, vol. 19(22), pages 1-25, November.
    13. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    14. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    15. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    16. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    17. de Aguiar, Ana Raquel Pena & Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel, 2023. "Home care routing and scheduling problem with teams’ synchronization," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    18. Jalel Euchi & Malek Masmoudi & Patrick Siarry, 2022. "Home health care routing and scheduling problems: a literature review," 4OR, Springer, vol. 20(3), pages 351-389, September.
    19. Zhan, Yang & Wang, Zizhuo & Wan, Guohua, 2021. "Home service routing and appointment scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 98-110.
    20. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:hcarem:v:26:y:2023:i:4:d:10.1007_s10729-023-09646-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.