Logo image
Models and methods for mobile facility routing
Dissertation   Open access

Models and methods for mobile facility routing

Jessa Rhea
University of Iowa
Doctor of Philosophy (PhD), University of Iowa
Spring 2026
DOI: 10.25820/etd.008447
pdf
Jessa_Rhea_Thesis_Rev14.61 MBDownloadView
Open Access

Abstract

Mobile facilities offer flexibility and accessibility advantages over fixed infrastructure across diverse service applications. In practice, these operations involve spatiotemporal uncertainty that affects service delivery -- from customer behavior in retail logistics to demand variability in humanitarian aid to infrastructure damage in disaster response. This dissertation develops optimization models and solution methodologies that explicitly model these uncertainties to improve mobile facility routing in three operational settings. First, reverse logistics for retail returns motivates a scheduling problem where high-resolution daily customer mobility patterns inform mobile facility location over time. Using GPS path data, we develop a multinomial logit choice model with period-specific parameters to maximize the expected number of customer visits, and through a variable neighborhood search approach we demonstrate that path-aware mobile facility scheduling is most valuable in tightly capacity-constrained environments with period-based customer detour sensitivity. Second, humanitarian aid distribution under stochastic demand introduces the challenge of equitably allocating nonreplenishable capacity across multi-period routes. We formulate this problem by maximizing the net benefit of service subject to service level balance constraints. We solve the formulation with variable neighborhood search integrated with gradient descent to jointly optimize discrete routing and continuous capacity deployment decisions. Computational experiments across 232 instances achieve an average optimality gap of 0.59\% while revealing asymmetric sensitivities to coverage region misspecification. Third, uncertain network topology compounds the challenges of disaster response operations. We formulate this setting as a Markov decision process in which edge accessibility and site demand are revealed through exploration. We develop a rollout-based approach with information relaxation to address these coupled uncertainties. Additionally, we discover graph attention networks provide a promising value function approximation for this application.

Details

Metrics

1 Record Views
Logo image