Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Doctoral Dissertations
  5. Vehicle Tracking Data Imputation and Shortest Path Prediction under Stochastic Travel Time Conditions
Details

Vehicle Tracking Data Imputation and Shortest Path Prediction under Stochastic Travel Time Conditions

Date Issued
August 1, 2025
Author(s)
Han, Michael J.  
Advisor(s)
Shuai Li
Additional Advisor(s)
Shuai Li
Baoshan Huang
Weizi Li
Hyeonsup Lim
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/21000
Abstract

This study addresses two major challenges in transportation analytics: recovering missing truck-tracking data and predicting shortest paths under stochastic conditions. We first investigated significant data loss in truck-tracking datasets, where nearly one-third of trips were missing due to misaligned data collection windows between origin and destination points. These losses, largely unaccounted for in aggregated statistics, distorted key trends such as average journey time and trip frequency. We identified nine distinct data loss scenarios, with late starts and early ends at destination nodes contributing most significantly in our case study.


To recover the missing data, we expanded and analyzed the raw field data to assess its stochastic distribution, identifying the shifted Negative Exponential Distribution (shifted-NED) as the best fit. Validated through iterative Monte Carlo simulations (MAPE = 4.79%, MAE < 9 minutes), this model enabled the generation of synthetic missing data. By fusing these simulated values with the existing dataset, we created hybrid datasets that corrected misleading trends—replacing artificially decreasing journey times and declining trip frequencies with stable and plausible patterns. Though real-time driver behavior analysis was beyond the scope of this study due to the delayed installation of Dynamic Message Signs, our imputation process lays a foundation for such future work.

Building on this robust, corrected dataset, we turned to the challenge of predicting shortest paths in the face of stochastic travel times. Traditional deterministic algorithms fall short when future travel times are uncertain. We reframed the shortest-path problem as a stochastic one and introduced the Degree of Independence (DoI) to quantify how path interdependencies affect the likelihood of optimality. Through millions of Monte Carlo simulations across varied grid structures, we established a strong correlation between DoI and a path’s probability of being shortest.

We developed the Relative Frequency (RF) metric to quantify this advantage, showing that high-DoI paths can be far more optimal than average paths. We developed a near-perfect regression model (R² = 0.9964) that allows RF estimation across grid sizes, transforming a previously intractable stochastic problem into a simple deterministic one. Together, these contributions enable more accurate modeling of both route performance and traveler behavior under uncertainty.

Subjects

stochastic travel tim...

monte carlo simulatio...

shortest path

data imputation

vehicle tracking

prediction

Disciplines
Civil Engineering
Data Science
Design of Experiments and Sample Surveys
Probability
Survival Analysis
Transportation Engineering
Degree
Doctor of Philosophy
Major
Civil Engineering
Embargo Date
August 15, 2026
File(s)
Thumbnail Image
Name

MH_Dissertation_09c_0516.pdf

Size

37.84 MB

Format

Adobe PDF

Checksum (MD5)

7263871ac6cdc6fe43b4fed8fab188bd


University Libraries

1015 Volunteer Boulevard
Knoxville, TN 37996
865-974-4351

Map & Directions
Donate to the Libraries
  • About
  • John C. Hodges Society
  • Speaking Volumes magazine
  • Outreach
  • Directory
  • Employment
  • Policies
  • Library Intranet
University of Tennessee power T logo

The University of Tennessee, Knoxville
Knoxville, Tennessee 37996
865-974-1000

Events
A-Z
Apply
Privacy
Map
Directory
Give to UT
Accessibility

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science