Strategic Dynamic Vehicle Routing with Spatio-Temporal Dependent Demands
Author(s)Feijer Rovira, Diego Francisco; Savla, Ketan D.; Frazzoli, Emilio
MetadataShow full item record
We study a zero-sum game formulation of a dynamic vehicle routing problem: a system planner seeks to design dynamic routing policies for a team of vehicles to minimize the average waiting time of demands that are strategically placed in a region by an adversarial agent with unitary capacity operating from a depot. We characterize an equilibrium in the limiting case where vehicles travel arbitrarily slower than the agent (heavy load). We show that such an equilibrium consists of a routing policy based on performing successive TSP tours through outstanding demands and a unique power-law spatial density centered at the depot location.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Proceedings of the 2012 American Control Conference
Institute of Electrical and Electronics Engineers (IEEE)
Feijer Rovira, Diego Francisc et al. "Strategic Dynamic Vehicle Routing with Spatio-Temporal Dependent Demands." IEEE American Control Conference, 2012.
Author's final manuscript