Add abstract
Want to add your dissertation abstract to this database? It only takes a minute!
Search abstract
Search for abstracts by subject, author or institution
Want to add your dissertation abstract to this database? It only takes a minute!
Search for abstracts by subject, author or institution
by Mikhail Igorevich Burov
| Institution: | University of California |
|---|---|
| Department: | |
| Degree: | |
| Year: | 2022 |
| Keywords: | Transportation |
| Posted: | 3/25/2025 |
| Record ID: | 2310484 |
| Full text PDF: | https://escholarship.org/uc/item/6pp9h0vm |
With a growing number of vehicles and an increasing complexity of transportation systems, traffic management and traffic optimization become more and more crucial in mitigating congestion, reducing travel delay and improving traffic state. The concept of a “Smart” city that incorporates various intelligent systems related to infrastructure modification, wireless communication, networking and centralized/decentralized controllers is considered to be the next evolutionary stage of the modern urban world. This dissertation focuses on optimization models and algorithms leveraging traffic management apps (navigation and reservation) and vehicle-to-everything (V2X) communication for mitigating congestion level, reducing fuel consumption and minimizing travel delay for vehicles in urban areas. An ability to share data, receive and send requests and directions allows traffic agents, both on-road (moving) and off-road (parked), to significantly improve utilization of transportation resources. To demonstrate the impact network-level control policies have on a system’s social delay, in our work [1], presented in Chapter 2, we propose a greedy optimization algorithm that eliminates “Braess” routes and derives a paradox-free subnetwork to be implemented in navigation apps. Prior literature that studied the Braess paradox was not able to provide efficient tools for improving the equilibrium state. Topology analysis methods could only predict the occurrence of the paradox but could not deal with it. Results that focused on a single link or route removal were ineffective for large networks. Other methods that discussed tolling or closing roads were too restrictive and required significant infrastructure modifications. Our approach, on the other hand, is more flexible and can be effectively applied to real-world systems to completely eliminate the inefficiency and momentarily reduce total travel time. In addition, we address the challenging task of incorporating queue delay into the network representation by introducing “phantom links”. The following chapters focus on link-level models dealing with local traffic inefficiencies. In Chapters 3 (corresponding work [2]) and 4 (extension to the work [3]) we explore moving traffic management methods and benefits their implementation has with respect to traffic throughput, travel time and fuel consumption. We demonstrate how the optimal platoon formation algorithm can improve traffic progression on urban streets and freeways. Earlier methods either focused on the Ad-hoc protocols, which have limited application in mixed traffic due to its short range, or tried to reduce the travel delay at the cost of the increased traffic disturbance, which was both ineffective and potentially harmful. Our approach, aimed at travel time minimization, takes on the local clustering method and proposes an intelligent platoon merging system that addresses a major part of its common complications and difficulties. In particular, minor infrastructure modifications accompanied by V2I communication protocols…
Want to add your dissertation abstract to this database? It only takes a minute!
Search for abstracts by subject, author or institution