Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “routing”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗
DOE OSTI2023

Progress in the Verification and Validation Efforts for START: A Spent Fuel Routing Tool

The U.S. Department of Energy’s (DOE) Office of Nuclear Energy (DOE-NE) is planning for an integrated waste management approach to transport, store, and dispose of spent nuclear fuel (SNF) and other high-level radioactive waste (HLW) as part of the Integrated Waste Management (IWM) program [1]. In support of this effort, the Stakeholder Tool for Assessing Radioactive Transportation (START) is being developed within the IWM program [2, 3]. This is a web-based decision support tool that can be used to analyze geospatial data related to the transportation of SNF and HLW. START is designed as a web-based application using an ArcGIS server through which the user can select the origin and destination of the route [4]. This is followed by selection of the mode of transportation of choice based on user preference. Some of the modes available to the user include rail, heavy haul truck, and barge. The option of utilizing more than one mode of transportation (intermodal transportation) is also implemented in START. A few examples of intermodal transportation include barge to rail, and heavy haul truck to rail. It must be noted that some routes might not have access to all modes of transportation, depending on the infrastructure availability at the origin and destination sites. Users can also select any stops or barriers they would like to introduce in the routes. This is followed by selection of the routing criteria of interest. Three primary routing options available to the user include minimum population, minimum distance, and minimum time. Apart from that, a few other options include accounting for a weighted average of the three aforementioned routing options. The next step involves the selection of the buffer distance of interest which includes the two choices available of 800 m and 2500 m, respectively. Finally, an option to select any prohibited rail carriers that the user does not wish to use is available. After making these selections, a route is ready to be created.

Gadey, Harish Reddy↗
DOE OSTI2025

Secure Route: Roadway Risk Mapping for Transportation Planners

The secure transport of sensitive materials across U.S. road networks pose unique challenges for local, state, and federal agencies. Threats range from random events (e.g., accidents, medical emergencies, mechanical failures) to opportunistic or organized tactical assaults. Although the probability of such attacks is very low, the consequences of material loss to foreign states or terrorists can be catastrophic, qualifying these scenarios as “grey swan” events—low-probability, high-impact occurrences that are predictable but difficult to quantify. Traditional risk assessments struggle in these contexts, necessitating a shift toward subjective risk perception to inform planning. Risk perception in transport planning is shaped by various factors, including knowledge of adversarial capabilities, vehicle defenses, manifest details, and geographic features along the route. Geographic features such as bridges, tunnels, roadside elevation, and gaps in cellular coverage introduce vulnerabilities, while mitigative features include safe havens, police stations, and medical services. Temporal variables such as congestion, accidents, and weather further complicate route planning. Despite their importance, existing routing tools like Google Maps and commercial software do not explicitly account for geographic risk features, requiring planners to rely on personal familiarity with routes—a time-intensive, non-scalable approach. This work addresses these gaps by: (1) developing datasets that catalog geographic risk features along U.S. roadways, (2) eliciting risk perceptions from experienced transportation security experts, and (3) linking these perceptions to roadway conditions and geographic data. We implement these capabilities within Secure Route a novel mapping tool for classifying route segment risks associated with roadway conditions. This system provides transportation planners with an intuitive interface to assess and contextualize risk along potential routes, improving decision-making for secure transport. We present current progress in this effort and identify next steps.

Stewart, Robert [ORNL] (ORCID:0000000281867559)↗
DOE OSTI2024

Electric vehicle supply equipment location and capacity allocation for fixed-route networks

Electric vehicle (EV) supply equipment location and allocation (EVSELCA) problems for freight vehicles are becoming more important because of the trending electrification shift. Some previous works address EV charger location and vehicle routing problems simultaneously by generating vehicle routes from scratch. Although such routes can be efficient, introducing new routes may violate practical constraints, such as drive schedules, and satisfying electrification requirements can require dramatically altering existing routes. To address the challenges in the prevailing adoption scheme, we approach the problem from a fixed -route perspective. We develop a mixed -integer linear program, a clustering approach, and a metaheuristic solution method using a genetic algorithm (GA) to solve the EVSELCA problem. The clustering approach simplifies the problem by grouping customers into clusters, while the GA generates solutions that are shown to be nearly optimal for small problem cases. A case study examines how charger costs, energy costs, the value of time (VOT), and battery capacity impact the cost of the EVSELCA. Charger equipment costs were found to be the most significant component in the objective function, leading to a substantial reduction in cost when decreased. VOT costs exhibited a significant decrease with rising energy costs. Further, an increase in VOT resulted in a notable rise in the number of fast chargers. Longer EV ranges decrease total costs up to a certain point, beyond which the decrease in total costs is negligible.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Empirical Study of Effect of Dynamic Travel Time Information on Driver Route Choice Behavior

The objective of this paper is to study the effect of travel time information on day-to-day driver route choice behavior. A real-world experimental study is designed to have participants repeatedly choose between two alternative routes for five origin-destination pairs over multiple days after providing them with dynamically updated travel time information (average travel time and travel time variability). The results demonstrate that historical travel time information enhances behavioral rationality by 10% on average and reduces inertial tendencies to increase risk seeking in the gain domain. Furthermore, expected travel time information is demonstrated to be more effective than travel time variability information in enhancing rational behavior when drivers have limited experiences. After drivers gain sufficient knowledge of routes, however, the difference in behavior associated with the two information types becomes insignificant. The results also demonstrate that, when drivers lack experience, the faster less reliable route is more attractive than the slower more reliable route. However, with cumulative experiences, drivers become more willing to take the more reliable route given that they are reluctant to become risk seekers once experience is gained. Furthermore, the effect of information on driver behavior differs significantly by participant and trip, which is, to a large extent, dependent on personal traits and trip characteristics.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Improving River Routing Using a Differentiable Muskingum‐Cunge Model and Physics‐Informed Machine Learning

Recently, rainfall-runoff simulations in small headwater basins have been improved by methodological advances such as deep neural networks (NNs) and hybrid physics-NN models—particularly, a genre called differentiable modeling that intermingles NNs with physics to learn relationships between variables. However, hydrologic routing simulations, necessary for simulating floods in stem rivers downstream of large heterogeneous basins, had not yet benefited from these advances and it was unclear if the routing process could be improved via coupled NNs. We present a novel differentiable routing method (δMC-Juniata-hydroDL2) that mimics the classical Muskingum-Cunge routing model over a river network but embeds an NN to infer parameterizations for Manning's roughness (n) and channel geometries from raw reach-scale attributes like catchment areas and sinuosity. The NN was trained solely on downstream hydrographs. Synthetic experiments show that while the channel geometry parameter was unidentifiable, n can be identified with moderate precision. With real-world data, the trained differentiable routing model produced more accurate long-term routing results for both the training gage and untrained inner gages for larger subbasins (>2,000 km2) than either a machine learning model assuming homogeneity, or simply using the sum of runoff from subbasins. The n parameterization trained on short periods gave high performance in other periods, despite significant errors in runoff inputs. The learned n pattern was consistent with literature expectations, demonstrating the framework's potential for knowledge discovery, but the absolute values can vary depending on training periods. The trained n parameterization can be coupled with traditional models to improve national-scale hydrologic flood simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Effect of process route on powder three-dimensional-printing of metal powders

The purpose of this study is to investigate the effect of two unique processing routes (solvent jetting (SJ) and binder jetting (BJ)), on the green density of printed stainless steel 316L (SS316L) and Nickel (Ni) powders. In the SJ processing route, a solvent is jetted unto the powder/binder mixture to selectively activate the binder, layer by layer. In the BJ processing route, a solution of the binder mixture is jetted onto the powder bed to selectively bind powder particles. The effects of printing parameters such as layer height, roller speed, shaker speed and nozzle temperature on the green density of printed components are investigated and compared for both processing routes. Results show that layer height and nozzle temperature affect the relative density of the printed compact for both processing routes. Slightly higher relative densities were achieved via the SJ route, with the overall highest relative density being 42.7% at 100 µ m layer height and 70% nozzle temperature for the SS316L components and 43.7% at 150 µ m layer height and 90% nozzle temperature for the Ni components, respectively. Results also show an increase in the final sintered relative density with an increase in green (printed) relative density of the solvent jetted SS316L components, with the highest relative density being 87.2%. The paper studies the influence of printing parameters on the green density of printed SS316L and Ni samples in an unprecedented effort to provide a comparative understanding of the process-property relationships in BJ and SJ of SS316L and Ni components to the additive manufacturing research community.

Engineering↗
NASA NTRS1990

Adaptive fault-tolerant routing in hypercube multicomputers

A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node, information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. A distributed adaptive fault tolerant routing scheme is proposed in which each node is required to know only the condition of its own links. This scheme is shown to be capable of routing messages successfully as long as the number of faulty components is less than n (the dimension of the hypercube), and to route messages via shortest paths with a rather high probability. A second routing scheme based on depth-first search is proposed which works in the presence of an arbitrary number of faulty components; however, the paths chosen by this may not always be the shortest. To guarantee shortest paths, every mode must be given information beyond that on its own links; the additional information to be kept at each node for shortest-path routing is determined. Several examples are given to illustrate the results.

Chen, Ming-Syan↗
NASA NTRS1992

Annoyance caused by aircraft en route noise

A laboratory experiment was conducted to quantify the annoyance response of people on the ground to enroute noise generated by aircraft at cruise conditions. The en route noises were ground level recordings of eight advanced turboprop aircraft flyovers and six conventional turbofan flyovers. The eight advanced turboprop enroute noises represented the NASA Propfan Test Assessment aircraft operating at different combinations of altitude, aircraft Mach number, and propeller tip speed. The conventional turbofan en route noises represented six different commercial airliners. The overall durations of the en route noises varied from approximately 40 to 160 sec. In the experiment, 32 subjects judged the annoyance of the en route noises as well as recordings of the takeoff and landing noises of each of 5 conventional turboprop and 5 conventional turbofan aircraft. Each of the noises was presented at three sound pressure levels to the subjects in an anechoic listening room. Analysis of the judgments found small differences in annoyance between three combinations of aircraft type and operation. Current tone and corrections did not significantly improve en route annoyance prediction. The optimum duration-correction magnitude for en route noise was approximately 1 dB per doubling of effective duration.

Mccurdy, David A.↗
NASA NTRS1993

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗
NASA NTRS1994

Evaluating GCM land surface hydrology parameterizations by computing river discharges using a runoff routing model: Application to the Mississippi basin

To relate general circulation model (GCM) hydrologic output to readily available river hydrographic data, a runoff routing scheme that routes gridded runoffs through regional- or continental-scale river drainage basins is developed. By following the basin overland flow paths, the routing model generates river discharge hydrographs that can be compared to observed river discharges, thus allowing an analysis of the GCM representation of monthly, seasonal, and annual water balances over large regions. The runoff routing model consists of two linear reservoirs, a surface reservoir and a groundwater reservoir, which store and transport water. The water transport mechanisms operating within these two reservoirs are differentiated by their time scales; the groundwater reservoir transports water much more slowly than the surface reservior. The groundwater reservior feeds the corresponding surface store, and the surface stores are connected via the river network. The routing model is implemented over the Global Energy and Water Cycle Experiment (GEWEX) Continental-Scale International Project Mississippi River basin on a rectangular grid of 2 deg X 2.5 deg. Two land surface hydrology parameterizations provide the gridded runoff data required to run the runoff routing scheme: the variable infiltration capacity model, and the soil moisture component of the simple biosphere model. These parameterizations are driven with 4 deg X 5 deg gridded climatological potential evapotranspiration and 1979 First Global Atmospheric Research Program (GARP) Global Experiment precipitation. These investigations have quantified the importance of physically realistic soil moisture holding capacities, evaporation parameters, and runoff mechanisms in land surface hydrology formulations.

Liston, G. E.↗
NASA NTRS2003

Route Monopolie and Optimal Nonlinear Pricing

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform distribution of agent types and explain the implications for airlines in terms of service differentiation.

Tournut, Jacques↗
NASA NTRS2000

Problem Definition and Solution Concept for En Route Constrained Airspace Problems

NASA's AATT Program is investigating potential ground-based decision support tool (DST) development for en route controllers and managers. NASA's previous work in en route DST development has focused on Transition airspace, where aircraft are impacted by constraints associated with the transition of aircraft from en route to terminal airspace. This paper investigates the problems associated with aircraft in non-transitional en route airspace, termed Constrained Airspace. A literature search was performed to catalog previously identified constrained airspace problems. The results of this search were investigated with industry representatives to validate these problems were significant in constrained airspace. Three general problem areas were identified. The first problem area involves negative impacts caused by a loss of airspace (e.g., activation of Special Use Airspace (SUA), weather cell formation, and overloaded sectors). The second problem area is the lack of identifying and taking advantage of gained airspace (e.g., SUA deactivation, weather dissipation, and sector loading reductions). The third problem area is unforeseen negative impacts caused by the acceptance of user routing requests (e.g., a route change into an area of congestion that negated the users intended benefit). Based upon the problems identified, an operational concept was developed for a DST to help handle these problems efficiently. The goal is to strategically identify constrained airspace problems and to provide functionality to support ARTCC TMUs in resolving the identified impacts. The capability lends itself well to TMU and Airline Operations Center (AOC) collaboration.

Green, Steven↗
NASA NTRS2002

Direct-To Tool for En Route Controllers

This paper describes a new automation tool for en route air traffic controllers, called the Direct-To Tool. The Tool is designed to reduce the time of flight and fuel consumption for aircraft flying in en route airspace. It provides each controller with the identities of aircraft in his/her sector, which can reduce their time en route by bypassing dog-legged route segments and flying "direct to" a waypoint closer to the destination airport. The Tool uses its build-in conflict probing capability to determine if the improved route is free of conflicts with other aircraft. The Tool's graphical computer interface enables the controller to enter a direct-to clearance by a simple point and click action. Because of its low workload and convenience, this method is strongly favored by controllers The Tool has been running since January with live radar data received at NASA from the Fort Worth Air Route Traffic Control Center. For aircraft operating in the Fort Worth Center, the Tool has the potential to save in excess of 500,000 in-flight minutes per year. A provisional patent application for this Tool has been filed. A field task in planned for the last quarter of this year.

Erzberger, Heinz↗
NASA NTRS2003

Space Act Agreement Maker (SAAM) With Electronic Routing System (ERouter) Developed

Members of the Commercial Technology Office at the NASA Glenn Research Center have developed an exciting new tool that greatly reduces the lead time in creating and routing Space Act Agreements. The Space Act Agreement Maker (SAAM) is an e-government Web-based system that automates the initial drafting of Space Act Agreements by technical and program personnel. SAAM also is used for editing and will be used later for maintaining electronic copies of all Space Act Agreements. During the initial drafting, the software prompts NASA personnel proposing an agreement to answer questions regarding the agreement. On the basis of the answers, the software selects from a matrix of NASA standard clauses to produce a first draft of the agreement. The draft agreement and information submitted by the NASA personnel are electronically routed to Glenn s Commercial Technology Office for review and, where necessary, editing. The final version of the agreement, along with any supporting documentation, is then routed for electronic concurrence/approval to the necessary internal review participants using the electronic routing system (e-router). SAAM was developed cooperatively by Glenn s Commercial Technology Office and Glenn s Office of Chief Counsel. Currently, SAAM is being evaluated by the NASA Headquarters General Counsel Office for use at all NASA centers. This system allows for the effective processing of Space Act Agreements for NASA s internal and external customers. Document control is maintained by a database. With SAAM s electronic routing, review times can be reduced significantly, allowing Glenn to more rapidly establish partnerships with industry. Prior to the creation of SAAM, it took several hours to draft a Space Act Agreement. With SAAM in place, the document can be written in about 30 min. Using the e-router also saves time in determining where the agreement is in the routing process. The document can be tracked easily, and delays can be avoided. Important research with industry partners can commence quickly after preliminary discussions have been held. The development of these products is in line with the expanding e-government initiative that is part of the Presidential Management Agenda. By using this product, NASA researchers can secure greater support from industry and academia partners. The Space Act Agreement Maker has been very well received at NASA Headquarters and at some of the other NASA centers as well. We anticipate that the NASA Ames Research Center will have the system in place very soon, and that some of the other centers will use SAAM in the near future. The General Counsel s office at NASA Headquarters has encouraged the Glenn team to develop a similar system for processing patent licenses. Find out more about Glenn's Technology Transfer & Partnership Office http://technology.grc.nasa.gov/.

Stauber, Laurel J.↗
NASA NTRS2004

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗
NASA NTRS2017

Analysis of Convective Weather Impact on Pre-Departure Routing of Flights from Fort Worth Center to New York Center

In response to severe weather conditions, Traffic Managers specify flow constraints and reroutes to route air traffic around affected regions of airspace. Providing analysis and recommendations of available reroute options and associated airspace capacities would assist Traffic Managers in making more efficient decisions in response to convective weather. These recommendations can be developed by examining historical data to determine which previous reroute options were used in similar weather and traffic conditions. This paper describes the initial steps and methodology used towards this goal. The focus of this work is flights departing from Fort Worth Center destined for New York Center. Dominant routing structures used in the absence of convective weather are identified. A method to extract relevant features from the large volume of weather data available to quantify the impact of convective weather on this routing structure over a given time range is presented. Finally, a method of estimating flow rate capacity along commonly used routes during convective weather events is described. Results show that the flow rates drop exponentially as a function of the values of the proposed feature and that convective weather on the final third of the route was found to have a greater impact on the flow rate restriction than other portions of the route.

traffic flow management↗