Search NASA⌕ Search

SEARCH · Search NASA

Results for “congestion”

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 127 records · Page 7

Rethinking the Role of Financial Transmission Rights in Wind-Rich Electricity Markets in the Central U.S.

Transmission congestion can cause a divergence between wholesale power prices at the individual pricing nodes where power is generated and the more-liquid trading hubs where that power is often delivered and sold. This nodal price difference is commonly referred to as the “locational basis” (or just “basis”). Because the basis varies over time, it can—if not hedged—unpredictably affect a wind plant’s revenue and/or value, which increases investor risk and potentially slows deployment. We find wind plants typically face a larger and more-negative basis than do thermal generators, and hence are more-negatively impacted by congestion. Moreover, while most thermal generators can effectively hedge basis risk by purchasing conventional fixed-volume financial transmission rights (FTRs), these fixed-volume FTRs do not effectively hedge basis risk for variable wind generation. More-effective hedging mechanisms may be required to support those generators most-impacted by congestion, and to promote continued investment in variable generation resources in congested markets.

17 WIND ENERGY↗

High performance interconnection between high data rate networks

The bridge/gateway system needed to interconnect a wide range of computer networks to support a wide range of user quality-of-service requirements is discussed. The bridge/gateway must handle a wide range of message types including synchronous and asynchronous traffic, large, bursty messages, short, self-contained messages, time critical messages, etc. It is shown that messages can be classified into three basic classes, synchronous and large and small asynchronous messages. The first two require call setup so that packet identification, buffer handling, etc. can be supported in the bridge/gateway. Identification enables resequences in packet size. The third class is for messages which do not require call setup. Resequencing hardware based to handle two types of resequencing problems is presented. The first is for a virtual parallel circuit which can scramble channel bytes. The second system is effective in handling both synchronous and asynchronous traffic between networks with highly differing packet sizes and data rates. The two other major needs for the bridge/gateway are congestion and error control. A dynamic, lossless congestion control scheme which can easily support effective error correction is presented. Results indicate that the congestion control scheme provides close to optimal capacity under congested conditions. Under conditions where error may develop due to intervening networks which are not lossless, intermediate error recovery and correction takes 1/3 less time than equivalent end-to-end error correction under similar conditions.

Foudriat, E. C.↗

Delay Banking for Managing Air Traffic

Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.

Green, Steve↗

A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions

This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.

Lee, Douglas W.↗

Operational Evaluatioin of Dynamic Weather Routes at American Airlines

Dynamic Weather Routes (DWR) is a search engine that continuously and automatically analyzes inflight aircraft in en route airspace and proposes simple route amendments for more efficient routes around convective weather while considering sector congestion, traffic conflicts, and active Special Use Airspace. NASA and American Airlines (AA) are conducting an operational trial of DWR at the AA System Operations Center in Fort Worth, TX. The trial includes only AA flights in Fort Worth Center airspace. Over the period from July 31, 2012 through August 31, 2012, 45% of routes proposed by DWR and evaluated by AA users - air traffic control coordinators and flight dispatchers - were rated as acceptable as proposed or with some modifications. The wind-corrected potential flying time savings for these acceptable routes totals 470 flying min, and results suggest another 1,500 min of potential savings for flights not evaluated due to staffing limitations. A sector congestion analysis shows that in only two out of 83 DWR routes rated acceptable by AA staff were the flights predicted to fly through a congested sector inside of 30 min downstream of present position. This shows that users considered sector congestion data provided by DWR automation and in nearly all cases did not accept routes through over-capacity sectors. It is estimated that 12 AA flights were given reroute clearances as a direct result of DWR for a total savings of 67 flying min.

air traffic trajectory automation↗

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗

Vertiport Dynamic Density

Advanced Air Mobility (AAM) is envisioned to be another spoke in a region’s transportation system, supplementing ground-based travel with air-based travel. Eventually, air taxis will be pervasive, convenient, and affordable. As demand and operations tempo increase, congestion may arise. Several characteristics of AAM reduce the applicability of techniques used in today’s National Airspace System (NAS) to manage congestion. AAM will include both scheduled and non-scheduled, on-demand operations, challenging strategic deconfliction algorithms. Flights will be fairly short, traversing an urban area, not hundreds or thousands of miles, with corresponding low energy reserves, prohibiting excessive delays. Flight operators will need flexibility in operations, scheduling a flight only minutes before departure, or diverting to an alternate vertiport if it becomes advantageous, further adding to trajectory uncertainty that would challenge strategic deconfliction. Finally, operators will desire privacy to protect sensitive information or preserve competitive advantage, limiting early access to intent information. In this paper, we present an approach for managing congestion at vertiports by providing insight into the traffic situation to support operationally-advantageous and safe land or divert decisions. We propose a metric designed with usefulness and usability in AAM operations in mind. The metric uses the sociology concept of dynamic density (DD) that takes into consideration not only number of flights, but also the interaction of those flights with the vertiport’s limited resources, namely the landing pads and the parking spots. DD supports a Pilot in Command (PIC) with decisions about whether to proceed, expedite, delay, or divert; and supports air traffic control (ATC) and vertiport operators in airspace management and vertiport usage. We demonstrate the metric on a notional vertiport scenario. We also show that DD provides better insight into congestion and resulting flight delays than an aircraft count metric used in traditional air traffic management.

Lilly Spirkovska↗

A Cyber-Physical System for Freeway Ramp Meter Signal Control Using Deep Reinforcement Learning in a Connected Environment

Freeway bottlenecks such as on-ramp merging areas account for about 40% of recurring freeway congestion. It is generally agreed that building more roads and adding more lanes to existing infrastructure does not solve the congestion problem, and so dynamic traffic control measures offer a more cost-effective alternative. Ramp meters, traffic signal devices that regulate traffic flow entering freeways, are among the most effective measures to mitigate congestion at on-ramp merging areas on freeways. The confluence of deep reinforcement learning (RL) and connectivity provides a possible solution to advance ramp meter signal control. Deep RL is a group of machine-learning methods that enables an agent learning from the environment to improve its performance. In this study, three deep RL methods-proximal policy optimization (PPO), Ape-X deep Q-network (DQN), and asynchronous advantage actor-critic agents (A3C)-are explored for ramp meter signal control to maximize vehicle speed and traffic throughput, as well as to minimize energy consumption and emissions at freeway on-ramp merging areas in a connected environment. The low computational requirement and scalability of deep RL for deployment make it a powerful optimization tool for time-sensitive applications such as ramp meter signal control. The results of this study show that deep RL methods yield superior performance to both a fixed-time controller and ALINE A, a state-of-the-art feedback controller.

ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗

Automatic Traffic Queue-End Identification using Location-Based Waze User Reports

Traffic queues, especially queues caused by non-recurrent events such as incidents, are unexpected to high-speed drivers approaching the end of queue (EOQ) and become safety concerns. Though the topic has been extensively studied, the identification of EOQ has been limited by the spatial-temporal resolution of traditional data sources. This study explores the potential of location-based crowdsourced data, specifically Waze user reports. It presents a dynamic clustering algorithm that can group the location-based reports in real time and identify the spatial-temporal extent of congestion as well as the EOQ. The algorithm is a spatial-temporal extension of the density-based spatial clustering of applications with noise (DBSCAN) algorithm for real-time streaming data with an adaptive threshold selection procedure. Here, the proposed method was tested with 34 traffic congestion cases in the Knoxville, Tennessee area of the United States. It is demonstrated that the algorithm can effectively detect spatial-temporal extent of congestion based on Waze report clusters and identify EOQ in real-time. The Waze report-based detection are compared to the detection based on roadside sensor data. The results are promising: The EOQ identification time of Waze is similar to the EOQ detection time of traffic sensor data, with only 1.1 min difference on average. In addition, Waze generates 1.9 EOQ detection points every mile, compared to 1.8 detection points generated by traffic sensor data, suggesting the two data sources are comparable in respect of reporting frequency. The results indicate that Waze is a valuable complementary source for EOQ detection where no traffic sensors are installed.

99 GENERAL AND MISCELLANEOUS↗

Dynamic Line Rating Models and Their Potential for a Cost‐Effective Transition to Carbon‐Neutral Power Systems

Most transmission system operators (TSOs) currently use seasonally steady-state models considering limiting weather conditions that serve as reference to compute the transmission capacity of overhead power lines. The use of dynamic line rating (DLR) models can avoid the construction of new lines, market splitting, false congestions, and the degradation of lines in a cost-effective way. DLR can also be used in the long run in grid extension and new power capacity planning. In the short run, it should be used to help operate power systems with congested lines. The operation of the power systems is planned to have the market trading into account; thus, it computes transactions hours ahead of real-time operation, using power flow forecasts affected by large errors. In the near future, within a “smart grid” environment, in real-time operation conditions, TSOs should be able to rapidly compute the capacity rating of overhead lines using DLR models and the most reliable weather information, forecasts, and line measurements, avoiding the current steady-state approach that, in many circumstances, assumes ampacities above the thermal limits of the lines. Here, this work presents a review of the line rating methodologies in several European countries and the United States. Furthermore, it presents the results of pilot projects and studies considering the application of DLR in overhead power lines, obtaining significant reductions in the congestion of internal networks and cross-border transmission lines.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A data-driven operational model for traffic at the Dallas Fort Worth International Airport

Airports are on the front line of significant innovations, allowing the movement of more people and goods faster, cheaper, and with greater convenience. As air travel continues to grow, airports will face challenges in responding to increasing passenger vehicle traffic, which leads to lower operational efficiency, poor air quality, and security concerns. This paper evaluates methods for traffic demand forecasting combined with traffic microsimulation, which will allow airport operations staff to accurately predict traffic and congestion. Using two years of detailed data describing individual vehicle arrivals and departures, aircraft movements, and weather at Dallas-Fort Worth (DFW) International Airport, we evaluate multiple prediction methods including the Auto Regressive Integrated Moving Average (ARIMA) family of models, traditional machine learning models, and DeepAR, a modern recurrent neural network (RNN). We find that these algorithms are able to capture the diurnal trends in the surface traffic, and all do very well when predicting the next 30 minutes of demand. Longer forecast horizons are moderately effective, demonstrating the challenge of this problem and highlighting promising techniques as well as potential areas for improvement. Traffic demand is not the only factor that contributes to terminal congestion, because temporary changes to the road network, such as a lane closure, can make benign traffic demand highly congested. Combining a demand forecast with a traffic microsimulation framework provides a complete picture of traffic and its consequences. The result is an operational intelligence platform for exploring policy changes, as well as infrastructure expansion and disruption scenarios. To demonstrate the value of this approach, we present results from a case study at DFW Airport assessing the impact of a policy change for vehicle routing in high demand scenarios. This framework can assist airports like DFW as they tackle daily operational challenges, as well as explore the integration of emerging technology and expansion of their services into long term plans.

97 MATHEMATICS AND COMPUTING↗

Modeling the External Effects of Air Taxis in Reducing the Energy Consumption of Road Traffic

Air taxis are currently being demonstrated. Few studies have quantified their external effects in reducing on-road vehicle fuel consumption. The hypothesis of this paper is that air taxis may divert some drivers away from congested traffic corridors, improve traffic speed and fuel economy, and reduce congestion-induced energy consumption. A model is developed that links several key components: mode choice, the relationship between travel demand and traffic speeds, the relationship between traffic speeds and fuel economies, and the heterogenous value of travel time. It is applied to the route from downtown Los Angeles to Los Angeles International Airport, where at peak hours 38,200 vehicles attempt to use the route that has an hourly capacity of 17,200 vehicles. The model estimates that, with conservative assumptions and near-term technologies, diverting 3.2% of the traffic to air taxis could produce a 15% reduction in traffic vehicle fuel use. With optimistic assumptions and mature technologies, the study estimates that diverting 20% of traffic could reduce the traffic vehicle fuel use by about 74%. The key insight is that if a small share of congested travelers switched to air taxis, motivated by private benefits of time savings, significant external benefits for other road travelers (time savings and fuel savings) and to society (reduced energy use and emissions), would ensue creating a win-win-win outcome. Overall, these estimates (which are not intended as predictions because of the stated limitations) strongly suggest the need to consider the external energy effect in future cost-benefit analyses of air taxi technologies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Empirical Estimates of Transmission Value using Locational Marginal Prices [Slides]

This study focuses on one potential benefit of transmission infrastructure—congestion relief. It explores historical grid conditions from 2012 through the first half of 2022, and evaluates the marginal value of transmission in facilitating trade within and across regional boundaries by calculating differences in observed nodal wholesale power prices. The study finds that wholesale power prices exhibit stark geographic differences that, in many cases, are stable over time. Many regional and interregional transmission links have significant potential economic value from reducing congestion and expanding opportunities for trade. In fact, many links have hourly average pricing differences in 2021 that exceeded $\$15$/MWh—equivalent to $130 million per year for a 1000 MW link. The value of transmission is correlated with overall energy prices and varies by region and year. Critically, extreme conditions and high-value periods play an outsized role in the value of transmission, with 50% of transmission’s congestion value coming from only 5% of hours. Transmission planners run the risk of understating the benefits of regional and interregional transmission if extreme conditions and high-value periods are not adequately considered. These periods are natural features of actual market operations. As such, the study highlights the need for planners to more-comprehensively assess the value of transmission under both normal and extreme conditions.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Analysis of Electricity Price Differentials for the Utah Office of Energy Development

Operation Gigawatt is a vision for Utah to meet its growing energy needs with a focus on doubling energy generation. One of the greatest challenges to meet this goal will be the transmission and distribution system. Utah seeks analysis to inform discussions on new generation, the likely network congestion based on new power flows, and modeling of the state's energy infrastructure. To support this need, LBNL developed a baseline understanding of recent historical congestion in the existing transmission system based on electricity market prices. The resulting products visualize and provide metrics on congestion within Utah and between Utah and its neighbors during 2015-2023.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Approximation Framework of Embodied Energy of Safety: Insights and Analysis

Transportation safety, as a critical component of an efficient and reliable transportation system, has been extensively studied with respect to societal economic impacts by transportation agencies and policy officials. However, the embodied energy impact of safety, other than induced congestion, is lacking in studies. This research proposes an energy equivalence of safety (EES) framework to provide a holistic view of the long-term energy and fuel consequences of motor vehicle crashes, incorporating both induced congestion and impacts from lost human productivity resulting from injury and fatal accidents and the energy content resulting from all consequences and activities from a crash. The method utilizes a ratio of gross domestic product (GDP) to national energy consumed in a framework that bridges the gap between safety and energy, leveraging extensive studies of the economic impact of motor vehicle crashes. The energy costs per fatal, injury, and property-damage-only (PDO) crashes in gasoline gallon equivalent (GGE) in 2017 were found to be 200,259, 4442, and 439, respectively, which are significantly greater than impacts from induced congestion alone. The results from the motor vehicle crash data show a decreasing trend of EES per crash type from 2010 and 2017, due primarily in part to a decreasing ratio of total energy consumed to GDP over those years. In addition to the temporal analysis, we conducted a spatial analysis addressing national-, state-, and local-level EES comparisons by using the proposed framework, illustrating its applicability.

99 GENERAL AND MISCELLANEOUS↗

Reliable multicast protocol specifications flow control and NACK policy

This appendix presents the flow and congestion control schemes recommended for RMP and a NACK policy based on the whiteboard tool. Because RMP uses a primarily NACK based error detection scheme, there is no direct feedback path through which receivers can signal losses through low buffer space or congestion. Reliable multicast protocols also suffer from the fact that throughput for a multicast group must be divided among the members of the group. This division is usually very dynamic in nature and therefore does not lend itself well to a priori determination. These facts have led the flow and congestion control schemes of RMP to be made completely orthogonal to the protocol specification. This allows several differing schemes to be used in different environments to produce the best results. As a default, a modified sliding window scheme based on previous algorithms are suggested and described below.

Callahan, John R.↗

Auction Mechanism to Allocate Air Traffic Control Slots

This article deals with an auction mechanism for airspace slots, as a means of solving the European airspace congestion problem. A disequilibrium, between Air Traffic Control (ATC) services supply and ATC services demand are at the origin of almost one fourth of delays in the air transport industry in Europe. In order to tackle this congestion problem, we suggest modifying both pricing and allocation of ATC services, by setting up an auction mechanism. Objects of the auction will be the right for airlines to cross a part of the airspace, and then to benefit from ATC services over a period corresponding to the necessary time for the crossing. Allocation and payment rules have to be defined according to the objectives of this auction. The auctioneer is the public authority in charge of ATC services, whose aim is to obtain an efficient allocation. Therefore, the social value will be maximized. Another objective is to internalize congestion costs. To that end, we apply the principle of Clarke-Groves mechanism auction: each winner has to pay the externalities imposed on other bidders. The complex context of ATC leads to a specific design for this auction.

Raffarin, Marianne↗