IDEAS home Printed from https://ideas.repec.org/a/taf/thssxx/v11y2022i3p161-171.html
   My bibliography  Save this article

Using a genetic algorithm to solve a non-linear location allocation problem for specialised children’s ambulances in England and Wales

Author

Listed:
  • Enoch Kung
  • Sarah E. Seaton
  • Padmanabhan Ramnarayan
  • Christina Pagel

Abstract

Since 1997, special paediatric intensive care retrieval teams (PICRTs) based in 11 locations across England and Wales have been used to transport sick children from district general hospitals to one of 24 paediatric intensive care units. We develop a location allocation optimisation framework to help inform decisions on the optimal number of locations for each PICRT, where those locations should be, which local hospital each location serves and how many teams should station each location. Our framework allows for stochastic journey times, differential weights for each journey leg and incorporates queuing theory by considering the time spent waiting for a PICRT to become available. We examine the average waiting time and the average time to bedside under different number of operational PICRT stations, different number of teams per station and different levels of demand. We show that consolidating the teams into fewer stations for higher availability leads to better performance.

Suggested Citation

  • Enoch Kung & Sarah E. Seaton & Padmanabhan Ramnarayan & Christina Pagel, 2022. "Using a genetic algorithm to solve a non-linear location allocation problem for specialised children’s ambulances in England and Wales," Health Systems, Taylor & Francis Journals, vol. 11(3), pages 161-171, July.
    • Handle: RePEc:taf:thssxx:v:11:y:2022:i:3:p:161-171
    DOI: 10.1080/20476965.2021.1908176
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/20476965.2021.1908176
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/20476965.2021.1908176?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.

    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:taf:thssxx:v:11:y:2022:i:3:p:161-171. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/thss .

    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.