DTC Seminar Series
Reliable Routing Algorithms in a Network with Stochastic Link Costs
Department of Civil, Environmental, and Geo- Engineering
University of Minnesota
Friday, October 12, 2018
3:30 p.m. reception
4:00 p.m. seminar
401/402 Walter Library
Finding the shortest path in a network is a fundamental problem in transportation engineering and related fields. The classic shortest path problem with additive path cost is well studied for near a century. However, considering path reliability makes the problem significantly difficult due to the non-additive path cost and the failure of Bellman’s equations. This presentation will address the shortest path problem with non-additive path cost, namely a linear combination of mean and standard deviation of path cost. The problem is investigated for cases with and without link cost correlations and new algorithms are proposed for solving the problems in large networks.
Alireza Khani is an assistant professor in the department of Civil, Environmental, and Geo- Engineering at the University of Minnesota, and an affiliate researcher at Center for Transportation Studies. His research is on modeling equilibrium, routing, and optimization in the context of transportation networks. Some of the applications of his work are the evaluation of current and future transportation systems with autonomous vehicles and shared mobility, as well as the impacts on public transit systems. His research is primarily sponsored by National Science Foundation and Minnesota Department of Transportation. Alireza has received his PhD in Civil Engineering from the University of Arizona.
DTC Professer Tian He named 2018 ACM Fellow
Professor Tian He has been named a 2018 Association for Computing Machinery (ACM) Fellow. He has been selected his contributions to wireless networks, sensing systems, and Internet of Things (IoT), areas in which he has made many influential and landmark contributions. More on Tian He.
Digital Technology Center
499 Walter Library, 117 Pleasant Street SE, Minneapolis, MN 55455
P: (612) 624-9510