Second, the dissertation focuses on the implementation of a vehicle fleet composition model component that can be used not only to simulate the mix of vehicle types owned by households but also to identify the specific vehicle that will be used for a specific tour. Virtually all of the activity-based models in practice only model the choice of mode without due consideration of the type of vehicle used on a tour. In this research effort, a comprehensive vehicle fleet composition model system is developed and implemented. In addition, a primary driver allocation model and a tour-level vehicle type choice model are developed and estimated with a view to advancing the ability to track household vehicle usage through the course of a day within activity-based travel model systems. It is envisioned that these advances will enhance the fidelity of activity-based travel model systems in practice.
Two general approaches are developed. Both approximate the effects of recourse decisions without actually solving a stochastic model. The first approach procures more reserve whenever approximate recourse policies stress the transmission network. The second approach procures reserve at prime locations by generalizing the existing practice of reserve disqualification. The latter approach is applied for feasibility and is later extended to limit scenario costs. Testing demonstrates expected cost improvements around 0.5%-1.0% for the IEEE 73-bus test case, which can translate to millions of dollars per year even for modest systems. The heuristics developed in this dissertation perform somewhere between established deterministic and stochastic models: providing an economic benefit over current practices without substantially increasing computational times.
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.
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.
innovation in healthcare policy over a huge variety of applications by tackling prob-
lems via the creation and optimization of descriptive mathematical models to guide
decision-making. Despite these accomplishments, models are stylized representations
of real-world applications, reliant on accurate estimations from historical data to jus-
tify their underlying assumptions. To protect against unreliable estimations which
can adversely affect the decisions generated from applications dependent on fully-
realized models, techniques that are robust against misspecications are utilized while
still making use of incoming data for learning. Hence, new robust techniques are ap-
plied that (1) allow for the decision-maker to express a spectrum of pessimism against
model uncertainties while (2) still utilizing incoming data for learning. Two main ap-
plications are investigated with respect to these goals, the first being a percentile
optimization technique with respect to a multi-class queueing system for application
in hospital Emergency Departments. The second studies the use of robust forecasting
techniques in improving developing countries’ vaccine supply chains via (1) an inno-
vative outside of cold chain policy and (2) a district-managed approach to inventory
control. Both of these research application areas utilize data-driven approaches that
feature learning and pessimism-controlled robustness.
This research addresses the problem of analyzing working conditions of large water systems by means of a detailed hydraulic simulation model (e.g., EPANet) to gain insights into feasibility with respect to pressure, tank level, etc. This work presents a new framework called Feasible Set Approximation – Probabilistic Branch and Bound (FSA-PBnB) for the definition and determination of feasible solutions in terms of pumps regulation. We propose the concept of feasibility distance, which is measured as the distance of the current solution from the feasibility frontier to estimate the distribution of the feasibility values across the solution space. Based on this estimate, pruning the infeasible regions and maintaining the feasible regions are proposed to identify the desired feasible solutions. We test the proposed algorithm with both theoretical and real water networks. The results demonstrate that FSA-PBnB has the capability to identify the feasibility profile in an efficient way. Additionally, with the feasibility distance, we can understand the quality of sub-region in terms of feasibility.
The present work provides a basic feasibility determination framework on the low dimension problems. When FSA-PBnB extends to large scale constraint optimization problems, a more intelligent sampling method may be developed to further reduce the computational effort.