Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic traffic assignment”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

9 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Agent-Based Dynamic Traffic Assignment with Information Mixing

This study develops an approach for network assignment convergence using individualized agent-based routing and agent-specific link cost information as well as historical travel times. Each traveler is routed individually from their starting and ending network link at a specific departure time. The approach is gap-based in two ways. First, as in previous approaches, the re-assignment decision during the convergence process is based on the gap between the routed and experienced travel time from the previous iteration. Secondly, the historical time-dependent and prevailing traffic conditions are averaged into a single expected value for each agent using a weight calculated by a modified two-parameter Weibull survival function. This weight is individualized based on the relative gap of the traveler from the previous iteration, as well as the iteration number; a novel aspect of this work. The methodology is tested on a medium-scale network of Bloomington, IL. The algorithm converges after only two iterations, which is promising as computational time of a single iteration can be high for large-scale networks.

agent-based modeling↗
DOE OSTI2020

A large-scale, agent-based simulation of metropolitan freight movements with passenger and freight market interactions

This study summarizes the first stage in the implementation of an agent-based freight modeling system that has a global representation of agents and detailed modeling of a large-scale transportation network. The model is used to evaluate the transportation and energy impacts of goods movement across urban and national scales. The framework is implemented within POLARIS, a C++-based Planning and Operations Language for Agent-based Regional Integrated Simulation, which consists of an activity-based modeling (ABM) and dynamic traffic assignment (DTA) system that has robust features for passenger travel. This platform provides a tool to model interactions among consumers, producers, and the transportation system. The main objective of this initial implementation is to implement a freight model within POLARIS following an agent-based paradigm with behavioral and simulation methods. This paper presents the initial framework and illustrates the application of the model. Building upon earlier works, a parcel location assignment algorithm for business establishments in the population is documented, along with a method for estimating establishment production and consumption volumes. In addition to population generation, other features of the model include push-pull supply chains, multimodal path choice, choice of transportation logistics node, and dynamic traffic assignment. A module with e-commerce supply and demand was also developed to analyze the effects of e-commerce delivery on last-mile energy use and congestion.

agent-based freight↗
DOE OSTI2019

A Scale-Dynamic Network Abstraction Approach for Traffic Analysis

The necessary trade-off between accuracy and efficiency of various traffic simulation tools depends on the resolution of the roadway network. While a detailed high-resolution road network could better represent connectivity of real-world road network and ensure an accurate simulation result, a low-resolution network omitting trivial details could reduce computational burden and improve the computational efficiency of traffic simulation. This study focuses on dynamically adjusting the roadway network resolution during the process of simulation-based dynamic traffic assignment (SBDTA) with the objective to expedite both the simulation and the assignment within SBDTA. We propose to divide the whole time horizon into several periods dynamically and to Abstract the network for each period separately. The result showed that half of the CPU time for both the simulation and the assignment is saved, while the network performance remains consistent or near consistent compared with the scenario using the most detailed network.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Integrating Multi-Source Data for Bi-Level Traffic Simulator Calibration: A Literature Review and Highway Case Study

Traffic simulation serves as a powerful tool for pre-evaluating policies and technologies. In this context, simulation-based Dynamic traffic assignment (DTA) models are capable of capturing traffic dynamics. They are well-known as critical tools in controlling and predicting traffic situations. The reliability of simulation results heavily depends on the calibration process. Most studies in the literature formulate and calibrate simulators based on a single source of collected data or multiple data sets with the same spatiotemporal characteristics. However, in practice, traffic data is collected by various tools with usually different spatial and temporal resolutions. This study introduces a novel approach to taking into account diverse input data from a variety of sources. An iterative bi-level solution is proposed. to equally treat traffic flow and speed data. The upper level solves flow calibration with the exact solution method, and the lower level calibrates the speed with the simultaneous perturbation stochastic approximation (SPSA) algorithm. Subsequently, the effectiveness of the proposed model is investigated using data from a six-mile section of Nashville's I-24 highway in Tennessee. The results demonstrate that our proposed model creates an effective feedback loop between the optimizer and the simulator for calibrating flow and speed to reduce the error between simulated and real data.

42 ENGINEERING↗
DOE OSTI2026

Comparing Delay-, Distance-, and Cordon-Based Congestion Pricing Strategies Via Large-Scale Simulation

This study compares the impacts of delay-, distance-, and cordon-based congestion pricing strategies for Austin, Texas, using the POLARIS agent-based activity-based travel demand simulation model. This approach enables agent-level heterogeneity and realistic choice options (including destination, mode, and activity scheduling) for dynamic traffic assignment and congestion feedbacks across a major metro region, which are features lacking in past work. To ensure comparability, distance-based tolls were set to generate the same revenue as delay-based tolling of $3.5 M/day, averaging $1.17/resident/day or $0.42/vehicle-trip. Delay-based pricing delivers 44% lower network delay and 13% lower VHT compared to the no-toll baseline, levels unmatched by other pricing strategies. At the height of the AM peak, drivers pay up to $0.13/mile on average, though most links in the network remain untolled. Distance-based pricing is the most effective at reducing VMT (by 4%), but VHT reductions (of 6%) primarily stem from drivers selecting closer destinations, achieving only one-fourth the delay reduction of delay-based pricing. Across various implementations of delay- and distance-based pricing, the results suggest that spatial variations of tolls are far more important than temporal variations. Cordon tolls produce minimal impacts at the network-wide level, but offer substantial delay reductions inside the cordon. Other major findings include: 1) delay-based pricing increases trip-making during the PM peak period due to backward shifts in discretionary-activity start times by higher-income residents; and 2) tolls’ spatial impacts, including changes in network flows and tolls paid by residents, vary substantially between delay- and distance-based pricing strategies.

Agent-based modeling↗
DOE OSTI2018

TA_solver -- Traffic Assignment solver package

TA_solver is a modular software framework for solving user equilibrium traffic assignment problems, both static and dynamic, utilizing the OTM (Open Traffic Models) API to encode traffic scenarios. The design is based on the formulation of the problem as a variational inequality. Unlike most existing traffic assignment software which focus on specific traffic models, TA_solver accommodates various traffic models, but also enables using parallel computation in high performance computing environments to speed up large-scale equilibrium calculations.

Ugirumurera, Juliette↗
DOE OSTI2019

A Real-Time Vehicle-Specific Eco-Routing Model for On-Board Navigation Applications Capturing Transient Vehicle Behavior

The paper develops a real-time vehicle-specific eco-routing model for use in on-board navigation systems for both conventional fuel- and battery-powered electric vehicles. The model uses a novel link cost function that retains all microscopic transient behavior along a link by capturing within-link speed, acceleration, and road grade variations. Specifically, eight vehicle-agnostic link-specific variables are transmitted to the cloud and fused with information received from other connected vehicles. The fused data are then sent back to the connected vehicles and used to compute vehicle-specific eco-routes (edge computing). The solution produces an energy-efficient dynamic user-equilibrium traffic assignment that is solved incrementally. A numerical experiment is first designed to test the model, demonstrating the benefits associated with vehicle-specific eco-routes compared to those produced by traditional models. The model is then implemented in a micro-simulation framework to evaluate the network-wide impacts of the proposed energy-efficient user-optimum incremental traffic assignment for different traffic demand levels. Results demonstrate that the proposed model produces lower network-wide energy consumption levels compared to traditional energy-efficient and travel time user-optimum traffic assignment methods for both conventional fuel and electric vehicles. Conventional fuel savings relative to travel time routing decrease with increasing traffic demand levels, while electric power savings do not vary monotonically with congestion levels. Energy savings relative to traditional eco-routing are also demonstrated to not vary monotonically with demand levels. Results of the study also demonstrate that the transportation network layout significantly affects the eco-routing system performance. Finally, the feasibility of the proposed model in real-world applications is discussed and presented.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Emissions minimization on road networks via Generic Second Order Models

In this paper we consider the problem of estimating emissions due to vehicular traffic on complex networks, and minimizing their effect by regulating traffic at junctions. For the traffic evolution, we consider a Generic Second Order Model, which encompasses the majority of two-equations (i.e., second-order) models available in the literature, and extend it to road networks with merge and diverge junctions. The dynamics on the whole network is determined by selecting a solution to the Riemann Problems at junctions, i.e., the Cauchy problems with constant initial data on each incident road. The latter are solved by assuming the maximization of the flow and assigning a traffic distribution coefficient for outgoing roads of diverges, and a priority rule for incoming roads of merges. A general emission model is considered and its parameters are tuned to the $ {\mathrm{NO_{x}}} $ emission rate. The minimization of emissions is then formulated in terms of the traffic distribution and priority parameters, taking into account travel times. A comparison is provided between roundabouts with optimized parameters and traffic lights, which correspond to time-varying traffic priorities. Our approach can be adapted to manage traffic in complex networks in order to reduce emissions while keeping travel time at acceptable levels.

33 ADVANCED PROPULSION SYSTEMS↗