Matching Items (12,174)
Filtering by
- Creators: ASU Library. Music Library
Description
The accurate prediction of pavement network condition and performance is important for efficient management of the transportation infrastructure system. By reducing the error of the pavement deterioration prediction, agencies can save budgets significantly through timely intervention and accurate planning. The objective of this research study was to develop a methodology for calculating a pavement condition index (PCI) based on historical distress data collected in the databases from Long-Term Pavement Performance (LTPP) program and Minnesota Road Research (Mn/ROAD) project. Excel™ templates were developed and successfully used to import distress data from both databases and directly calculate PCIs for test sections. Pavement performance master curve construction and verification based on the PCIs were also developed as part of this research effort. The analysis and results of LTPP data for several case studies indicated that the study approach is rational and yielded good to excellent statistical measures of accuracy.
It is believed that the InfoPaveTM LTPP and Mn/ROAD database can benefit from the PCI templates developed in this study, by making them available for users to compute PCIs for specific road sections of interest. In addition, the PCI-based performance model development can be also incorporated in future versions of InfoPaveTM. This study explored and analyzed asphalt pavement sections. However, the process can be also extended to Portland cement concrete test sections. State agencies are encouraged to implement similar analysis and modeling approach for their specific road distress data to validate the findings.
ContributorsWu, Gan (Author) / Kaloush, Kamil (Thesis advisor) / Zhou, Xuesong (Committee member) / Underwood, Benjamin Shane (Committee member) / Arizona State University (Publisher)
Created2015
ContributorsLee, Eunhwa (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-17
Description
Informal public transport is commonplace in the developing world, but the service exists in the United States as well, and is understudied. Often called "dollar vans", New York's commuter vans serve approximately 120,000 people every day (King and Goldwyn, 2014). While this is a tiny fraction of the New York transit rider population, it is comparable to the total number of commuters who ride transit in smaller cities such as Minneapolis/St Paul and Phoenix. The first part of this study reports on the use of commuter vans in Eastern Queens based on a combination of surveys and a ridership tally, all conducted in summer 2016. It answers four research questions: How many people ride the vans? Who rides the commuter vans? Why do they ride commuter vans? Do commuter vans complement or compete against formal transit? Commuter van ridership in Eastern Queens was approximately 55,000 with a high percentage of female ridership. Time and cost savings were the main factors influencing commuter van ridership. Possession of a MetroCard was shown to negatively affect the frequency of commuter van ridership. The results show evidence of commuter vans playing both a competing and complementary role to MTA bus and subway transit. The second part of this study presents a SWOT analysis results of commuter vans, and the policy implications. It answers 2 research questions: What are the main strengths, weaknesses, opportunities and threats of commuter vans in Eastern Queens? and How do the current policies, rules and regulations affect commuter van operation? The SWOT analysis results show that the commuter van industry is resilient, performs a necessary service, and, with small adjustments that will help reduce operating costs and loss of profits have a chance of thriving in Eastern Queens and the rest of New York City. The study also discusses the mismatch between policy and practice offering recommendations for improvement to ensure that commuter vans continue to serve residents of New York City.
ContributorsMusili, Catherine (Author) / Salon, Deborah (Thesis advisor) / King, David (Committee member) / Kelley, Jason (Committee member) / Arizona State University (Publisher)
Created2017
ContributorsSuk, Mykola (Performer) / ASU Library. Music Library (Contributor)
Created2018-03-12
ContributorsEvans, Emily (Performer) / Sherrill, Amanda (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-02
Description
This research develops heuristics to manage both mandatory and optional network capacity reductions to better serve the network flows. The main application discussed relates to transportation networks, and flow cost relates to travel cost of users of the network. Temporary mandatory capacity reductions are required by maintenance activities. The objective of managing maintenance activities and the attendant temporary network capacity reductions is to schedule the required segment closures so that all maintenance work can be completed on time, and the total flow cost over the maintenance period is minimized for different types of flows. The goal of optional network capacity reduction is to selectively reduce the capacity of some links to improve the overall efficiency of user-optimized flows, where each traveler takes the route that minimizes the traveler’s trip cost. In this dissertation, both managing mandatory and optional network capacity reductions are addressed with the consideration of network-wide flow diversions due to changed link capacities.
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.
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.
ContributorsPeng, Dening (Author) / Mirchandani, Pitu B. (Thesis advisor) / Sefair, Jorge (Committee member) / Wu, Teresa (Committee member) / Zhou, Xuesong (Committee member) / Arizona State University (Publisher)
Created2017
Description
Recently, automation, shared use, and electrification are proposed and viewed as the “three revolutions” in the future transportation sector to significantly relieve traffic congestion, reduce pollutant emissions, and increase transportation system sustainability. Motivated by the three revolutions, this research targets on the passenger-focused scheduled transportation systems, where (1) the public transit systems provide high-quality ridesharing schedules/services and (2) the upcoming optimal activity planning systems offer the best vehicle routing and assignment for household daily scheduled activities.
The high quality of system observability is the fundamental guarantee for accurately predicting and controlling the system. The rich information from the emerging heterogeneous data sources is making it possible. This research proposes a modeling framework to systemically account for the multi-source sensor information in urban transit systems to quantify the estimated state uncertainty. A system of linear equations and inequalities is proposed to generate the information space. Also, the observation errors are further considered by a least square model. Then, a number of projection functions are introduced to match the relation between the unique information space and different system states, and its corresponding state estimate uncertainties are further quantified by calculating its maximum state range.
In addition to optimizing daily operations, the continuing advances in information technology provide precious individual travel behavior data and trip information for operational planning in transit systems. This research also proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. An agent-based single-level integer linear formulation is proposed and can be effectively by the Lagrangian decomposition.
The recently emerging trend of self-driving vehicles and information sharing technologies starts creating a revolutionary paradigm shift for traveler mobility applications. By considering a deterministic traveler decision making framework, this research addresses the challenges of how to optimally schedule household members’ daily scheduled activities under the complex household-level activity constraints by proposing a set of integer linear programming models. Meanwhile, in the microscopic car-following level, the trajectory optimization of autonomous vehicles is also studied by proposing a binary integer programming model.
The high quality of system observability is the fundamental guarantee for accurately predicting and controlling the system. The rich information from the emerging heterogeneous data sources is making it possible. This research proposes a modeling framework to systemically account for the multi-source sensor information in urban transit systems to quantify the estimated state uncertainty. A system of linear equations and inequalities is proposed to generate the information space. Also, the observation errors are further considered by a least square model. Then, a number of projection functions are introduced to match the relation between the unique information space and different system states, and its corresponding state estimate uncertainties are further quantified by calculating its maximum state range.
In addition to optimizing daily operations, the continuing advances in information technology provide precious individual travel behavior data and trip information for operational planning in transit systems. This research also proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. An agent-based single-level integer linear formulation is proposed and can be effectively by the Lagrangian decomposition.
The recently emerging trend of self-driving vehicles and information sharing technologies starts creating a revolutionary paradigm shift for traveler mobility applications. By considering a deterministic traveler decision making framework, this research addresses the challenges of how to optimally schedule household members’ daily scheduled activities under the complex household-level activity constraints by proposing a set of integer linear programming models. Meanwhile, in the microscopic car-following level, the trajectory optimization of autonomous vehicles is also studied by proposing a binary integer programming model.
ContributorsLiu, Jiangtao (Author) / Zhou, Xuesong (Thesis advisor) / Pendyala, Ram (Committee member) / Mirchandani, Pitu (Committee member) / Lou, Yingyan (Committee member) / Arizona State University (Publisher)
Created2018
ContributorsKotronakis, Dimitris (Performer) / ASU Library. Music Library (Publisher)
Created2018-03-01
ContributorsVazquez, Emilio (Performer) / Collins, Clarice (Performer) / Hunt, Emily (Performer) / Solari, John (Performer) / ASU Library. Music Library (Publisher)
Created2018-02-27
ContributorsKanicsar, Chelsea (Performer) / ASU Library. Music Library (Publisher)
Created2018-02-28