IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0208003.html
   My bibliography  Save this article

Operations research meets need related planning: Approaches for locating general practitioners’ practices

Author

Listed:
  • Melanie Reuter-Oppermann
  • Stefan Nickel
  • Jost Steinhäuser

Abstract

Background: In most western countries a shortage of general practitioners (GP) exists. Newly qualified GPs often prefer to work in teams rather than in single-handed practices. Therefore, new practices offering these kinds of working conditions will be attractive in the future. From a health care point of view, the location planning of new practices will be a crucial aspect. In this work we studied solutions for locating GP practices in a defined administrative district under different objectives. Methods: Using operations research (OR), a research discipline that originated from logistics, different possible locations of GP practices were identified for the considered district. Models were developed under two main basic requirements: that one practice can be reached by as many inhabitants as possible and to cut down the driving time for every district’s inhabitant to the next practice location to less than 15 minutes. Input data included the demand (population), driving times and the current GP locations. Results: Three different models were analysed ranging from one single practice solution to five different practices. The whole administrative district can reach the central community “A” in at most 23 minutes by car. Considering a maximum driving time of 15 minutes, locations in four different cities in the district would be sufficient. Conclusion: Operations research methods can be used to determine locations for (new) GP practices. Depending on the concrete problem different models and approaches lead to varying solutions. These results must be discussed with GPs, mayors and patients to find robust locations regarding future developments.

Suggested Citation

  • Melanie Reuter-Oppermann & Stefan Nickel & Jost Steinhäuser, 2019. "Operations research meets need related planning: Approaches for locating general practitioners’ practices," PLOS ONE, Public Library of Science, vol. 14(1), pages 1-10, January.
  • Handle: RePEc:plo:pone00:0208003
    DOI: 10.1371/journal.pone.0208003
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0208003
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0208003&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0208003?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
    ---><---

    References listed on IDEAS

    as
    1. Evrim Didem Güneş & Stefan Nickel, 2015. "Location Problems in Healthcare," Springer Books, in: Gilbert Laporte & Stefan Nickel & Francisco Saldanha da Gama (ed.), Location Science, edition 127, chapter 0, pages 555-579, Springer.
    2. Richard Church & Charles R. Velle, 1974. "The Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 32(1), pages 101-118, January.
    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. Li Wang & Huan Shi & Lu Gan, 2018. "Healthcare Facility Location-Allocation Optimization for China’s Developing Cities Utilizing a Multi-Objective Decision Support Approach," Sustainability, MDPI, vol. 10(12), pages 1-22, December.
    2. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    3. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    4. Huizhu Wang & Jianqin Zhou, 2023. "Location of Railway Emergency Rescue Spots Based on a Near-Full Covering Problem: From a Perspective of Diverse Scenarios," Sustainability, MDPI, vol. 15(8), pages 1-16, April.
    5. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    6. Li, Xin & Pan, Yanchun & Jiang, Shiqiang & Huang, Qiang & Chen, Zhimin & Zhang, Mingxia & Zhang, Zuoyao, 2021. "Locate vaccination stations considering travel distance, operational cost, and work schedule," Omega, Elsevier, vol. 101(C).
    7. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
    8. Hamid Mousavi & Soroush Avakh Darestani & Parham Azimi, 2021. "An artificial neural network based mathematical model for a stochastic health care facility location problem," Health Care Management Science, Springer, vol. 24(3), pages 499-514, September.
    9. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    10. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    11. Ospina, Juan P. & Duque, Juan C. & Botero-Fernández, Verónica & Montoya, Alejandro, 2022. "The maximal covering bicycle network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 222-236.
    12. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    13. Arana-Jiménez, Manuel & Blanco, Víctor & Fernández, Elena, 2020. "On the fuzzy maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 283(2), pages 692-705.
    14. Sadeghi, Mohammad & Yaghoubi, Saeed, 2024. "Optimization models for cloud seeding network design and operations," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1146-1167.
    15. Erhan Erkut & Armann Ingolfsson & Güneş Erdoğan, 2008. "Ambulance location for maximum survival," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 42-58, February.
    16. Gentile, José & Alves Pessoa, Artur & Poss, Michael & Costa Roboredo, Marcos, 2018. "Integer programming formulations for three sequential discrete competitive location problems with foresight," European Journal of Operational Research, Elsevier, vol. 265(3), pages 872-881.
    17. Chun-Han Wang & Yu-Ching Lee & Ming-Ju Hsieh, 2024. "Optimization of the stroke hospital selection strategy and the distribution of endovascular thrombectomy resources," Health Care Management Science, Springer, vol. 27(2), pages 254-267, June.
    18. Roy, Sandeepan & Maji, Avijit, 2019. "Optimization of High-Speed Railway Station Location Selection Based on Accessibility and Environmental Impact," ADBI Working Papers 953, Asian Development Bank Institute.
    19. Terance J. Rephann, 2008. "Spatial Analysis in Veterans Cemetery Location," Working Papers 2008-03, Center for Economic and Policy Studies.
    20. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0208003. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.