Immediate treatment is of extreme importance for stroke patients. However, providing fast enough treatment for stroke patients is far from trivial, mainly due to logistical challenges and difficulties in diagnosing the correct stroke type. One way to reduce the time to treatment is to use so-called Mobile Stroke Units (MSUs), which allows to diagnose and provide treatment for stroke patients already at the patient scene. A well-designed stroke transport policy is vital to improve the access to treatment for stroke patients. Simulation and mathematical optimization are useful approaches for assessing and optimizing stroke transport policies, without endangering the health of the patients. The main purpose of this thesis is to contribute to improving the situation for stroke patients and to reducing the social impacts of stroke. The aim is to study how to use simulation and optimization to achieve improved analysis and planning of prehospital stroke care. In particular, we focus on assessing the potential use of MSUs in a geographic area. In this thesis, optimization is used to identify the optimal locations of MSUs, and simulation is used to assess different stroke transport policies, including MSU locations. The results of this thesis aim to support public health authorities when making decisions in the prehospital stroke care domain. In order to fulfill the aim of this thesis, we develop and analyze a number of different simulation and optimization models. First, we propose a macro-level simulation model, an average time to treatment estimation model, used to estimate the expected time to treatment for different parts of a geographic region. Using the proposed model, we generate two different MSU scenarios to explore the potential benefits of employing MSUs in Sweden’s southern healthcare region (SHR). Second, we present an optimization model to identify the best placement of MSUs while making a trade-off between the efficiency and equity perspectives, providing maximum population coverage and equal service for all patients, respectively. The trade-off function used in the model makes use of the concepts of weighted average time to treatment to model efficiency and the time difference between the expected time to treatment for different geographical areas to model equity. In a scenario study applied in the SHR, we evaluate our optimization model by comparing the current situation with three MSU scenarios, including 1, 2, and 3 MSUs. Third, we present a micro-level discrete event simulation model to assess stroke transport policies, including MSUs, allowing us to model the behaviors of individual entities, such as patients and emergency vehicles, over time. We generate a synthetic set of stroke patients using a Poisson distribution, used as input in a scenario study. Finally, we present a modeling framework with reusable components, which aims to facilitate the construction of discrete event simulation models in the emergency medical services domain. The framework consists of a number of generic activities, which can be used to represent healthcare chains modeled in the form of flowcharts. As the framework includes activities and policies modeled on the general level, the framework can be used to create models only by providing input data and a care chain specification. We evaluate the framework by using it to build a model for simulating EMS activities related to the complex case of acute stroke. / <p>Note: The papers are not included in the fulltext online.</p>
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:mau-55489 |
| Date | January 2022 |
| Creators | Amouzad Mahdiraji, Saeid |
| Publisher | Malmö universitet, Institutionen för datavetenskap och medieteknik (DVMT), Malmö universitet, Internet of Things and People (IOTAP), Malmö |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Licentiate thesis, comprehensive summary, info:eu-repo/semantics/masterThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Studies in Computer Science ; 21 |
Page generated in 0.0027 seconds