ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Filtering by
- All Subjects: Transportation
This research first investigates the maintenance scheduling in transportation networks with service vehicles (e.g., truck fleets and passenger transport fleets), where these vehicles are assumed to take the system-optimized routes that minimize the total travel cost of the fleet. This problem is solved with the randomized fixed-and-optimize heuristic developed. This research also investigates the maintenance scheduling in networks with multi-modal traffic that consists of (1) regular human-driven cars with user-optimized routing and (2) self-driving vehicles with system-optimized routing. An iterative mixed flow assignment algorithm is developed to obtain the multi-modal traffic assignment resulting from a maintenance schedule. The genetic algorithm with multi-point crossover is applied to obtain a good schedule.
Based on the Braess’ paradox that removing some links may alleviate the congestion of user-optimized flows, this research generalizes the Braess’ paradox to reduce the capacity of selected links to improve the efficiency of the resultant user-optimized flows. A heuristic is developed to identify links to reduce capacity, and the corresponding capacity reduction amounts, to get more efficient total flows. Experiments on real networks demonstrate the generalized Braess’ paradox exists in reality, and the heuristic developed solves real-world test cases even when commercial solvers fail.
The availability of cooled space, whether public or private, has been shown to greatly reduce health risks associated with extreme heat. However, a lack of fine-scale knowledge of which households have access to this infrastructure results in an incomplete understanding of the health risks associated with heat. This knowledge gap could result in the misallocation of resources intended to mitigate negative health impacts associated with heat exposure. Additionally, when discussing accessibility to public cooled space there are underlying questions of mobility and mode choice. In addition to captive riders, a growing emphasis on walking, biking and public transit will likely expose additional choice riders to extreme temperatures and compound existing vulnerabilities to heat.
The distributed traffic monitoring and platoon information aggregation system serves as the foundation. Specifically, each equipped vehicle, through the distributed protocols developed, keeps track of the average traffic density and speed within a certain range, flags itself as micro-discontinuity in traffic if appropriate, and cross-checks its flag status with its immediate up- and down-stream vehicles. The micro-discontinuity flags define vehicle groups with similar traffic states, for initiating and terminating traffic information aggregation. The impact of market penetration rate (MPR) is also investigated with a new methodology for performance evaluation under multiple traffic scenarios.
In addition to MPR, the performance of the distributed traffic monitoring and platoon information aggregation system depends on the spatial distribution of equipped vehicles in the road network as well. The latter is affected by traffic dynamics. Traffic signal controls at intersections play a significant role in governing traffic dynamics and will in turn impact the distributed monitoring system. The performance of the monitoring framework is investigated with different g/C ratios under multiple traffic scenarios.
With the distributed traffic monitoring and platoon information aggregation system, platoons can be dynamically identified on the network in real time. This enables a platoon-based automated intersection control system for connected and autonomous vehicles. An exploratory study on such a control system with two control stages are proposed. At Stage I, vehicles of each platoon will synchronize into a target speed through cooperative speed harmonization. Then, a platoon of vehicles with the same speed can be treated as a single vehicle for speed profile planning at Stage II. Its speed profile will be immediately determined given speed profiles of other platoons and the control goal.
Parking availability (occupancy of parking facility) information is the fundamental building block for both travelers and planners to make parking-related decisions. It is highly valued by travelers and is one of the most important inputs to many parking models. This dissertation proposes a model-based practical framework to predict future occupancy from historical occupancy data alone. The framework consists of two modules: estimation of model parameters, and occupancy prediction. At the core of the predictive framework, a queuing model is employed to describe the stochastic occupancy change of a parking facility.
From an attendee’s perspective, the probability of finding parking at a particular parking facility is more treasured than occupancy information for parking search. However, it is hard to estimate parking probabilities even with accurate occupancy data in a dynamic environment. In the second part of this dissertation, taking one step further, the idea of introducing learning algorithms into parking guidance and information systems that employ a central server is investigated, in order to provide estimated optimal parking searching strategies to travelers. With the help of the Markov Decision Process (MDP), the parking searching process on a network with uncertain parking availabilities can be modeled and analyzed.
Finally, from a planner’s perspective, a bi-level model is proposed to generate a comprehensive PSE traffic management plan considering parking, ridesharing and route recommendations at the same time. The upper level is an optimization model aiming to minimize total travel time experienced by travelers. In the lower level, a link transmission model incorporating parking and ridesharing is used to evaluate decisions from and provide feedback to the upper level. A congestion relief algorithm is proposed and tested on a real-world network.