EUVIMEDEUVIMED entdecken
Crossref

Forecast-Driven Dispatch for Distributed Service Fleets

Yevhen Piotrovskyi

The American Journal of Engineering and Technology · 21.05.2026 · 08 (05) · 86-106

DOI: 10.37547/tajet/volume08issue05-11 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The American Journal of Engineering and Technology, online erschienen am 21.05.2026. Verfasst von Yevhen Piotrovskyi.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Objective

We present an applied machine-learning framework for scheduling cleaning crews across distributed public-restroom fleets, replacing industry-standard fixed-interval and threshold-triggered rules with a predict-then-optimize pipeline that couple’s usage forecasting, a latent dirtiness state model, and travel-aware preemptive dispatch.

Methods

On a calibrated synthetic city of 50 restroom units across five location types — using a non-homogeneous Poisson usage generator with weather and event bursts and a detour-scaled Euclidean travel matrix — we benchmark five machine-learning contenders (seasonal-naive + greedy, LightGBM quantile forecaster + greedy, Cox proportional-hazards + greedy, Cox PH + OR-Tools mini-VRP, and a rolling-horizon variant) against fixed-interval and per-type usage-threshold baselines, plus a perfect-future-usage oracle. All numbers are produced by a single reproducible script (6 seeds, 2-week train / 4-week evaluation, with 95% confidence intervals and paired -tests).

Results

At the nominal crew budget (220 h/wk, 3 crews), LGBM+Greedy reduced hours above threshold per unit per week from 19.4 (FI-12h) to 1.83 — a 91% reduction (, paired) — using only 79% of the budget. A 3-hour oracle matches LGBM+Greedy within noise, indicating that short-horizon usage prediction is saturated at this fleet scale. Cox proportional-hazards variants under-perform the fixed-interval baseline. A generator–model mismatch stress test (Hawkes-style tails, drift, spill shocks) preserves the ordering.

Conclusion

A simple usage-forecast-driven greedy dispatcher dominates more sophisticated routing-based alternatives at this fleet scale and provides an engineering baseline for a real-world pilot. A complete reproducible Python implementation accompanies this manuscript as supplementary material.

Zitieren

APA

Piotrovskyi, Y. (2026). Forecast-Driven Dispatch for Distributed Service Fleets. The American Journal of Engineering and Technology, 08(05), 86-106. https://doi.org/10.37547/tajet/volume08issue05-11

Vancouver

Piotrovskyi Y. Forecast-Driven Dispatch for Distributed Service Fleets. The American Journal of Engineering and Technology. 2026;08(05):86-106. doi:10.37547/tajet/volume08issue05-11

BibTeX
@article{Piotrovskyi2026,
  author = {Piotrovskyi, Yevhen},
  title = {Forecast-Driven Dispatch for Distributed Service Fleets},
  journal = {The American Journal of Engineering and Technology},
  year = {2026},
  volume = {08},
  number = {05},
  pages = {86--106},
  doi = {10.37547/tajet/volume08issue05-11}
}
Kostenlos starten →