Short-Horizon Queue-Length Forecasting for Outpatient Merge Stations

Accurate short–horizon forecasts of the queue length at downstream merge stations—where multiple upstream desks converge—are vital for dynamic triage, load balancing and anticipatory staffing in outpatient clinics. We model patient arrivals to each upstream desk as a non-homogeneous Poisson process and encode real-time queue states into a compact feature vector. Within this supervised-learning framework we benchmark five algorithms—k-nearest neighbors, random forest, Bayesian ridge regression, single-layer perceptron and multi-layer perceptron (MLP)—for one-step-ahead prediction of the merge-station queue length. The results indicate that a lightweight MLP consistently delivers the best accuracy across all load segments and markedly reduces under-forecasting during peak periods, while deeper or wider networks offer diminishing returns. The proposed predictor operates with modest computational overhead and can be embedded in real-time routing and staffing policies to shorten queues and enhance service consistency during congestion.

Authors

Institutions

Publication Details

Published
2025-05-16
DOI
https://doi.org/10.1145/3757110.3757201
Primary Topic
Forecasting Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Short-Horizon Queue-Length Forecasting for Outpatient Merge Stations

Maowei Zhang, Qiang Su
Forecasting Techniques and Applications
article

Short-Horizon Queue-Length Forecasting for Outpatient Merge Stations

Maowei Zhang, Qiang Su
article en

Abstract

Accurate short–horizon forecasts of the queue length at downstream merge stations—where multiple upstream desks converge—are vital for dynamic triage, load balancing and anticipatory staffing in outpatient clinics. We model patient arrivals to each upstream desk as a non-homogeneous Poisson process and encode real-time queue states into a compact feature vector. Within this supervised-learning framework we benchmark five algorithms—k-nearest neighbors, random forest, Bayesian ridge regression, single-layer perceptron and multi-layer perceptron (MLP)—for one-step-ahead prediction of the merge-station queue length. The results indicate that a lightweight MLP consistently delivers the best accuracy across all load segments and markedly reduces under-forecasting during peak periods, while deeper or wider networks offer diminishing returns. The proposed predictor operates with modest computational overhead and can be embedded in real-time routing and staffing policies to shorten queues and enhance service consistency during congestion.

Tongji University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 67%
Forecasting Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.