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.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Implementing and Simulating Dynamic Traffic Assignment with Intelligent Transportation Systems in Cube Avenue

As urban populations and traffic congestion levels increase, effective use of information and communication tools and intelligent transportation systems as becoming increasingly important in order to maximize the efficiency of transportation networks. The appropriate placement and employment of these tools within a network is critical to their effectiveness. This presentation proposes and demonstrates the use of a commercial transportation simulation tool to simulate dynamic traffic assignment and rerouting to model route modifications as a result of traffic information.

Foytik, Peter↗
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↗
NASA NTRS2010

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗
NASA NTRS2014

Dynamic Airspace Configuration

In air traffic management systems, airspace is partitioned into regions in part to distribute the tasks associated with managing air traffic among different systems and people. These regions, as well as the systems and people allocated to each, are changed dynamically so that air traffic can be safely and efficiently managed. It is expected that new air traffic control systems will enable greater flexibility in how airspace is partitioned and how resources are allocated to airspace regions. In this talk, I will begin by providing an overview of some previous work and open questions in Dynamic Airspace Configuration research, which is concerned with how to partition airspace and assign resources to regions of airspace. For example, I will introduce airspace partitioning algorithms based on clustering, integer programming optimization, and computational geometry. I will conclude by discussing the development of a tablet-based tool that is intended to help air traffic controller supervisors configure airspace and controllers in current operations.

airspace↗
NASA NTRS1995

Traffic sharing algorithms for hybrid mobile networks

In a hybrid (terrestrial + satellite) mobile personal communications networks environment, a large size satellite footprint (supercell) overlays on a large number of smaller size, contiguous terrestrial cells. We assume that the users have either a terrestrial only single mode terminal (SMT) or a terrestrial/satellite dual mode terminal (DMT) and the ratio of DMT to the total terminals is defined gamma. It is assumed that the call assignments to and handovers between terrestrial cells and satellite supercells take place in a dynamic fashion when necessary. The objectives of this paper are twofold, (1) to propose and define a class of traffic sharing algorithms to manage terrestrial and satellite network resources efficiently by handling call handovers dynamically, and (2) to analyze and evaluate the algorithms by maximizing the traffic load handling capability (defined in erl/cell) over a wide range of terminal ratios (gamma) given an acceptable range of blocking probabilities. Two of the algorithms (G & S) in the proposed class perform extremely well for a wide range of gamma.

Arcand, S.↗
NASA NTRS2020

Conformance Monitoring in Air Traffic Control

This report consists of a primer on airspace operations and a survey of previous research in the area of conformance monitoring. The report provides an overview of the topics of airspace operations, air navigation services, and conformance monitoring. Airspace operations are described in terms of missions, aircraft, and environments, including surrounding environment and technical operational environment. Air navigation services support flight crews with information and guidance to complete their flight missions safely and efficiently in a shared, dynamic, and possibly unfamiliar operational environment. Conformance monitoring is an air traffic control function to ensure that aircraft in controlled airspace adhere to assigned clearances. The report also includes a survey of previous research in the area of conformance monitoring.

Wilfredo Torres-Pomales↗
NASA NTRSDate not supplied

Investigation of Intelligent Resource Management for Aviation Communications

The emergence of new aerial vehicles into the airspace as part of new initiatives, such as Advanced Air Mobility (AAM), will place growing demand for spectrum resources to support airspace operations. The traditional approach of using fixed channel allocations within standard service volumes will not allow for dynamic and efficient distribution of resources based on airspace demand; consequently, a new approach to aviation spectrum management will be required to meet the anticipated needs of airspace users. The National Aeronautics and Space Administration (NASA) is investigating the application of advanced concepts to implement a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the quality of service prescribed by aeronautical standards. This technical investigation evaluates the dynamic assignment of resources for both air-ground and air-air communication links applicable to both the emerging AAM initiative as well as the existing air traffic management system. The performance of the proposed spectrum management concepts will be evaluated using a custom modeling and simulation capability that is currently under development. The implementation of these approaches is anticipated to facilitate increased spectrum utilization efficiency and enhanced airspace capacity, which will better serve the needs of future applications.

Aeronautics↗
NASA NTRSDate not supplied

Investigation of Intelligent Resource Management for Aviation Communications

The emergence of new aerial vehicles into the airspace as part of new initiatives, such as Advanced Air Mobility (AAM), will place growing demand for spectrum resources to support airspace operations. The traditional approach of using fixed channel allocations within standard service volumes will not allow for dynamic and efficient distribution of resources based on airspace demand; consequently, a new approach to aviation spectrum management will be required to meet the anticipated needs of airspace users. The National Aeronautics and Space Administration (NASA) is investigating the application of advanced concepts to implement a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the quality of service prescribed by aeronautical standards. This technical investigation evaluates the dynamic assignment of resources for both air-ground and air-air communication links applicable to both the emerging AAM initiative as well as the existing air traffic management system. The performance of the proposed spectrum management concepts will be evaluated using a custom modeling and simulation capability that is currently under development. The implementation of these approaches is anticipated to facilitate increased spectrum utilization efficiency and enhanced airspace capacity, which will better serve the needs of future applications.

Eric Knoblock↗
NASA NTRS2011

Multi-Instance Learning Models for Automated Support of Analysts in Simulated Surveillance Environments

New generations of surveillance drones are being outfitted with numerous high definition cameras. The rapid proliferation of fielded sensors and supporting capacity for processing and displaying data will translate into ever more capable platforms, but with increased capability comes increased complexity and scale that may diminish the usefulness of such platforms to human operators. We investigate methods for alleviating strain on analysts by automatically retrieving content specific to their current task using a machine learning technique known as Multi-Instance Learning (MIL). We use MIL to create a real time model of the analysts' task and subsequently use the model to dynamically retrieve relevant content. This paper presents results from a pilot experiment in which a computer agent is assigned analyst tasks such as identifying caravanning vehicles in a simulated vehicle traffic environment. We compare agent performance between MIL aided trials and unaided trials.

Birisan, Mihnea↗
NASA NTRS1990

Demand Assignment in the ACTS LBR System

On the Advanced Communications Technology Satellite (ACTS) being developed at NASA Lewis, low-burst-rate (LBR) traffic stations will access the ACTS multibeam package via two hopping beams that can be directed at certain areas in the continental U.S. An onboard baseband processor (BBP) demodulates uplink traffic, switches it between uplink and downlink beams at baseband, and then remodulates it for retransmission at 20 GHz. This study describes the demand-assigned operation of the ACTS LBR system, where the onboard switch is remote from both traffic stations and master control station (MCS). Network control uses inbound and outbound orderwire channels and a BBP control channel, allowing the MCS to coordinate assignment of individual 64-kb/s spacecraft channels. Models are developed to simulate the dynamics of the assignment process and verify the call blocking behavior, to predict control channel loads, and to evaluate algorithms for burst time plan rearrangement.

White, Lawrence W.↗
NASA NTRS2005

Flying SATS Higher Volume Operations: Training, Lessons Learned, and Pilots' Experiences

Developments in aviation, including new surveillance technologies and quicker, more economical small aircraft, have been identified as driving factors in a potential expansion of the use of non-towered, non-radar airports. The Small Aircraft Transportation System (SATS) project has developed the Higher Volume Operations (HVO) concept that enables pilots to safely arrive and depart these airports in instrument conditions at an increased rate as compared to today's procedures. This is achieved by transferring some traffic management tasks to centralized, ground-based automation, while assigning others to participating pilots aided by on-board tools. This paper describes strategies and lessons learned while training pilots to fly these innovative operations. Pilot approaches to using the experimental displays and dynamic altering systems during training are discussed. Potential operational benefits as well as pit-falls and frustrations expressed by subjects while learning to fly these new procedures are presented. Generally, pilots were comfortable with the procedures and the training process, and expressed interest in its near-term implementation.

Conway, Sheila↗