HOT Lanes with a Refund Option and Potential Application of Connected Vehicles

156668-Thumbnail Image.png
Description
Priced Managed Lanes (MLs) have been increasingly advocated as one of the effective ways to mitigating congestion in recent years. This study explores a new and innovative pricing strategy for MLs called Travel Time Refund (TTR). The proposed TTR provides

Priced Managed Lanes (MLs) have been increasingly advocated as one of the effective ways to mitigating congestion in recent years. This study explores a new and innovative pricing strategy for MLs called Travel Time Refund (TTR). The proposed TTR provides an additional option to paying drivers that insures their travel time by issuing a refund to the toll cost if they do not reach their destination within specified travel times due to accidents or other unforeseen circumstances. Perceived benefits of TTR include raised public acceptance towards priced MLs, utilization increase of HOV/HOT lanes, overall congestion mitigation, and additional funding for relevant transportation agencies. To gauge travelers’ interests of TTR and to analyse its possible impacts, a stated preference (SP) survey was performed. An exploratory and statistical analysis of the survey responses revealed negative interest towards HOT and TTR option in accordance with common wisdom and previous studies. However, it is found that travelers are less negative about TTR than HOT alone; supporting the idea, that TTR could make HOT facilities more appealing. The impact of travel time reliability and latent variables representing psychological constructs on travelers’ choices in response to this new pricing strategy was also analysed. The results indicate that along with travel time and reliability, the decision maker’s attitudes and the level of comprehension of the concept of HOT and TTR play a significant role in their choice making. While the refund option may be theoretically and analytically feasible, the practical implementation issues cannot be ignored. This study also provides a discussion of the potential implementation considerations that include information provision to connected and non-connected vehicles, distinction between toll-only and refund customers, measurement of actual travel time, refund calculation and processing and safety and human factors issues. As the market availability of Connected and Automated Vehicles (CAVs) is prognosticated by 2020, the potential impact of such technologies on effective demand management, especially on MLs is worth investigating. Simulation analysis was performed to evaluate the system performance of a hypothetical road network at varying market penetration of CAVs. The results indicate that Connected Vehicles (CVs) could potentially encourage and enhance the use of MLs.
Date Created
2018
Agent

Shared Mobility Optimization in Large Scale Transportation Networks: Methodology and Applications

156498-Thumbnail Image.png
Description
Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery

Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). Previous research has made a number of important contributions to the challenging pickup and delivery problem along different formulation or solution approaches. However, there are a number of modeling and algorithmic challenges for a large-scale deployment of a vehicle routing and scheduling algorithm, especially for regional networks with various road capacity and traffic delay constraints on freeway bottlenecks and signal timing on urban streets. The main thrust of this research is constructing hyper-networks to implicitly impose complicated constraints of a vehicle routing problem (VRP) into the model within the network construction. This research introduces a new methodology based on hyper-networks to solve the very important vehicle routing problem for the case of generic ride-sharing problem. Then, the idea of hyper-networks is applied for (1) solving the pickup and delivery problem with synchronized transfers, (2) computing resource hyper-prisms for sustainable transportation planning in the field of time-geography, and (3) providing an integrated framework that fully captures the interactions between supply and demand dimensions of travel to model the implications of advanced technologies and mobility services on traveler behavior.
Date Created
2018
Agent

Passenger-focused Scheduled Transportation Systems: from Increased Observability to Shared Mobility

156252-Thumbnail Image.png
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

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.
Date Created
2018
Agent

Network-Oriented Household Activity Pattern Problem for System Optimization

127869-Thumbnail Image.png
Description

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals’ daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0-1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.

Date Created
2017-06-15
Agent

A Framework for a Self-Sustained Traffic Operations System Using V2V Communications

156079-Thumbnail Image.png
Description
This study explores an innovative framework for a self-sustained traffic operations system using vehicle-to-vehicle (V2V) communications alone. The proposed framework is envisioned as the foundation to an alternative or supplemental traffic operation and management system, which could be particularly helpful

This study explores an innovative framework for a self-sustained traffic operations system using vehicle-to-vehicle (V2V) communications alone. The proposed framework is envisioned as the foundation to an alternative or supplemental traffic operation and management system, which could be particularly helpful under abnormal traffic conditions caused by unforeseen disasters and special events. Its two major components, a distributed traffic monitoring and platoon information aggregation system and a platoon-based automated intersection control system, are investigated in this study.



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.
Date Created
2017
Agent

Network maintenance and capacity management with applications in transportation

155983-Thumbnail Image.png
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

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.
Date Created
2017
Agent

Pedestrian Safety at Rural Road and Spence Avenue

135785-Thumbnail Image.png
Description
Recurring incidents between pedestrians, bicycles, and vehicles at the intersection of Rural Road and Spence Avenue led to a team of students conducting their own investigation into the current conditions and analyzing a handful of alternatives. An extension of an

Recurring incidents between pedestrians, bicycles, and vehicles at the intersection of Rural Road and Spence Avenue led to a team of students conducting their own investigation into the current conditions and analyzing a handful of alternatives. An extension of an industry-standard technique was used to build a control case which alternatives would be compared to. Four alternatives were identified, and the two that could be modeled in simulation software were both found to be technically feasible in the preliminary analysis.
Date Created
2016-05
Agent

DTALite: A Queue-Based Mesoscopic Traffic Simulator for Fast Model Evaluation and Calibration

128284-Thumbnail Image.png
Description

A number of emerging dynamic traffic analysis applications, such as regional or statewide traffic assignment, require a theoretically rigorous and computationally efficient model to describe the propagation and dissipation of system congestion with bottleneck capacity constraints. An open-source light-weight dynamic

A number of emerging dynamic traffic analysis applications, such as regional or statewide traffic assignment, require a theoretically rigorous and computationally efficient model to describe the propagation and dissipation of system congestion with bottleneck capacity constraints. An open-source light-weight dynamic traffic assignment (DTA) package, namely DTALite, has been developed to allow a rapid utilization of advanced dynamic traffic analysis capabilities. This paper describes its three major modeling components: (1) a light-weight dynamic network loading simulator that embeds Newell’s simplified kinematic wave model; (2) a mesoscopic agent-based DTA procedure to incorporate driver’s heterogeneity; and (3) an integrated traffic assignment and origin–destination demand calibration system that can iteratively adjust path flow volume and distribution to match the observed traffic counts. A number of real-world test cases are described to demonstrate the effectiveness and performance of the proposed models under different network and data availability conditions.

Date Created
2014-10-01
Agent

Characterizing Corridor-Level Travel Time Distributions Based on Stochastic Flows and Segment Capacities

128308-Thumbnail Image.png
Description

Trip travel time reliability is an important measure of transportation system performance and a key factor affecting travelers’ choices. This paper explores a method for estimating travel time distributions for corridors that contain multiple bottlenecks. A set of analytical equations

Trip travel time reliability is an important measure of transportation system performance and a key factor affecting travelers’ choices. This paper explores a method for estimating travel time distributions for corridors that contain multiple bottlenecks. A set of analytical equations are used to calculate the number of queued vehicles ahead of a probe vehicle and further capture many important factors affecting travel times: the prevailing congestion level, queue discharge rates at the bottlenecks, and flow rates associated with merges and diverges. Based on multiple random scenarios and a vector of arrival times, the lane-by-lane delay at each bottleneck along the corridor is recursively estimated to produce a route-level travel time distribution. The model incorporates stochastic variations of bottleneck capacity and demand and explains the travel time correlations between sequential links. Its data needs are the entering and exiting flow rates and a sense of the lane-by-lane distribution of traffic at each bottleneck. A detailed vehicle trajectory data-set from the Next Generation SIMulation (NGSIM) project has been used to verify that the estimated distributions are valid, and the sources of estimation error are examined.

Date Created
2015-01-09
Agent

First-last mile life cycle assessment of Los Angeles transit

154966-Thumbnail Image.png
Description
With high potential for automobiles to cause air pollution and greenhouse gas emissions, there is concern that automobiles accessing or egressing public transportation may cause emissions similar to regular automobile use. Due to limited literature and research that evaluates and

With high potential for automobiles to cause air pollution and greenhouse gas emissions, there is concern that automobiles accessing or egressing public transportation may cause emissions similar to regular automobile use. Due to limited literature and research that evaluates and discusses environmental impacts from first and last mile portions of transit trips, there is a lack of understanding on this topic. This research aims to comprehensively evaluate the life cycle impacts of first and last mile trips on multimodal transit. A case study of transit and automobile travel in the greater Los Angeles region is evaluated by using a comprehensive life cycle assessment combined with regional household travel survey data to evaluate first-last mile trip impacts in multimodal transit focusing on automobile trips accessing or egressing transit. First and last mile automobile trips were found to increase total multimodal transit trip emissions by 2 to 12 times (most extreme cases were carbon monoxide and volatile organic compounds). High amounts of coal-fired energy generation can cause electric propelled rail trips with automobile access or egress to have similar or more emissions (commonly greenhouse gases, sulfur dioxide, and mono-nitrogen oxides) than competing automobile trips, however, most criteria air pollutants occur remotely. Methods to reduce first-last mile impacts depend on the characteristics of the transit systems and may include promoting first-last mile carpooling, adjusting station parking pricing and availability, and increased emphasis on walking and biking paths in areas with low access-egress trip distances.
Date Created
2016
Agent