[Defense] DUE-STR: A Heuristic Extension Of The Selfless Traffic Routing Model Utilizing Dynamic User Equilibrium
Monday, April 18, 2022
10:00 am - 11:00 am
will defend his senior honors thesis
DUE-STR: A Heuristic Extension Of The Selfless Traffic Routing Model Utilizing Dynamic User Equilibrium
Routing vehicles through a traffic network such as a modern-day city has been a much-studied topic, with routing algorithms such as Dynamic User Equilibrium (DUE) having been well documented. The focus of many such works have been on the optimization of average travel time through traffic networks aiming for the more efficient routing of vehicles. In this paper, we outline our plans for routing to satisfy arrival deadlines, where vehicles are routed with the primary objective of getting somewhere on time. We consider vehicle routing through a smaller section of a city, known as a traffic sub-network, using a centralized scheme as a guiding traffic assignment agent. We introduce our preliminary implementation of a routing algorithm built on the Selfless Traffic Routing (STR) model and Dynamic User Equilibrium (DUE) to show the viability of such a scheme on a traffic network. We present our experimental results from running this scheme on a real-world traffic network.
10:00AM - 11:00AM CT
Online via MS Teams
Dr. Albert M. K. Cheng, thesis advisor
Faculty, students and the general public are invited.