Evidence map›Paper›PMID 40200067›Full record

ArticleScientific reports2025

A dynamic nonlinear flow algorithm to model patient flow.

Arsineh Boodaghian Asl, Jayanth Raghothama, Adam S Darwich, Sebastiaan Meijer

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Arsineh Boodaghian AslDepartment of Biomedical Engineering and Health Systems, KTH Royal Institute of Technology, Huddinge, 14157, Sweden. arsineh@kth.se.
Jayanth RaghothamaDepartment of Biomedical Engineering and Health Systems, KTH Royal Institute of Technology, Huddinge, 14157, Sweden.
Adam S DarwichDepartment of Biomedical Engineering and Health Systems, KTH Royal Institute of Technology, Huddinge, 14157, Sweden.
Sebastiaan MeijerDepartment of Biomedical Engineering and Health Systems, KTH Royal Institute of Technology, Huddinge, 14157, Sweden.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Hospitals are complex systems, and the flow of patients is dynamic and nonlinear in such systems. Network representation allows flow algorithms to observe bottlenecks as candidates for optimisation. To model the dynamic behaviour of the patient flow, we need to consider the variability in arrival rates and service times (length of stay). Previously proposed dynamic flow algorithms mainly focused on arrival and departure rates, inflow and outflow, edges' and vertices' capacity, and routing, with applications mainly in transportation and telecommunication. In hospitals, bottlenecks that emerge from the patients' flow are a result of the vertices (wards) behaviour defined by capacity (beds), number of servers (staff), service time variability, and edges (care pathways) distribution probability. We offer a modified flow algorithm that takes a hospital network, iterates over the patients' arrival rates, and measures the flow with respect to vertices' capacities, servers, service time variability, edge capacity, and distribution probability. The result is a dynamic residual graph to measure the bottlenecks' persistency and severity, identify the root causes of bottlenecks, and wards' dynamic nonlinear behaviour. The algorithm provides a quick holistic view of hospital performance and the analysis of the edges and vertices' behaviour over time.

Indexed as

AlgorithmsModels, TheoreticalNonlinear DynamicsHospitalsHumans

Identifiers

PMID40200067
PMCPMC11978915

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.