Graph-Theoretic Measures for Interpretable Multicriteria Decision Making in Emergency Department Layout Optimization
April 15, 2025 ยท Declared Dead ยท ๐ arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ola Sarhan, Manal Abdel Wahed, Muhammad Ali Rushdi
arXiv ID
2504.11620
Category
cs.NE: Neural & Evolutionary
Citations
0
Venue
arXiv.org
Last Checked
4 months ago
Abstract
Overcrowding in emergency departments (ED) is a persistent problem exacerbated by population growth, emergence of pandemics, and increased morbidity and mortality rates. Thus, automated approaches for ED layout design have recently emerged as promising tools for boosting healthcare service quality. Still, ED design typically involves multiple conflicting objectives, where the interpretability of the associated solutions depends on the availability of intuitive metrics that can capture ED layout complexity. In this paper, we propose graph-theoretic measures to evaluate and rank ED layouts produced by a multi-objective metaheuristic optimization framework with the non-dominated sorting genetic algorithm (NSGA-II) and generalized differential evolution (GDE3). Indeed, Pareto-optimal ED layouts were sought to minimize patient flow cost while maximizing closeness between ED service areas. Then, the layouts were evaluated based on local graph measures (degree centrality, betweenness, clustering coefficient, closeness centrality, nodal strength, and eccentricity) as well as global ones (global efficiency, network characteristic path length and transitivity). Then, a multi-criteria decision-making technique was employed to rank the layouts based on either the objective functions, the graph measures, or combinations of both. The ranking results on a real-world scenario show that the top-ranking layouts are the ones with the best graph-theoretic values. This shows that the graph-theoretic measures can enhance solution interpretability and hence help medical planners in selecting the best layouts. In comparison with the input layout, optimal NSGA-II and GDE3 solutions reduce the patient flow cost by 18.32% and 11.42%, respectively. Also, the two solutions improve the closeness by 14.5% and 18.02%, respectively.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Neural & Evolutionary
๐ฎ
๐ฎ
The Ethereal
R.I.P.
๐ป
Ghosted
Deep Learning using Rectified Linear Units (ReLU)
R.I.P.
๐ป
Ghosted
Generative Adversarial Text to Image Synthesis
R.I.P.
๐ป
Ghosted
Regularized Evolution for Image Classifier Architecture Search
R.I.P.
๐ป
Ghosted
Temporal Ensembling for Semi-Supervised Learning
๐
๐
Old Age
Learning Structured Sparsity in Deep Neural Networks
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
๐ป
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
๐ป
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
๐ป
Ghosted