Search NASA⌕ Search

SEARCH · Search NASA

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Space Networking↗
NASA NTRS2013

Costs of Limiting Route Optimization to Published Waypoints in the Traffic Aware Planner

The Traffic Aware Planner (TAP) is an airborne advisory tool that generates optimized, traffic-avoiding routes to support the aircraft crew in making strategic reroute requests to Air Traffic Control (ATC). TAP is derived from a research-prototype self-separation tool, the Autonomous Operations Planner (AOP), in which optimized route modifications that avoid conflicts with traffic and weather, using waypoints at explicit latitudes and longitudes (a technique supported by self-separation concepts), are generated by maneuver patterns applied to the existing route. For use in current-day operations in which trajectory changes must be requested from ATC via voice communication, TAP produces optimized routes described by advisories that use only published waypoints prior to a reconnection waypoint on the existing route. We describe how the relevant algorithms of AOP have been modified to implement this requirement. The modifications include techniques for finding appropriate published waypoints in a maneuver pattern and a method for combining the genetic algorithm of AOP with an exhaustive search of certain types of advisory. We demonstrate methods to investigate the increased computation required by these techniques and to estimate other costs (measured in terms such as time to destination and fuel burned) that may be incurred when only published waypoints are used.

TASAR↗
NASA NTRS2018

Evaluation of Opportunistic Contact Graph Routing in Random Mobility Environments

Routing in networks where nodes move randomly is particularly challenging due their potentially unpredictable, and rapidly changing topology. Several routing algorithms have been presented in the literature to address the needs of such networks, most of them implementing variants of controlled network flooding in the hope of successful data delivery. In this note, we compare the results of previous routing algorithms with Opportunistic Contact Graph Routing (OCGR), an enhanced version of Contact Graph Routing (CGR) that is suitable for networks where contacts cannot always be scheduled ahead of time. To perform the benchmark, we simulate a network of nodes moving in a certain space according to the Random Waypoint Mobility Model, and then take measurements of bundle delivery probabilty and overhead ratio as metrics of performance and cost respectively. Through this exercise, we demonstrate that the performance of OCGR is highly dependent on the type of network under consideration (e.g. very sparse vs. densely connected) and the assumed mobility model.

Burleigh, Scott↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
DOE OSTI2015

The criticality incident detection system omission cases for the fuel routes at EDF energy power stations - 14280

Criticality safety cases have been produced to justify the omission of criticality alarms from the fuel routes of EDF Energy's UK power stations. This work has addressed the UK regulator's expectations that adequate criticality warning systems should be provided wherever fissile material is present, unless a safety case shows that no criticality excursion could give any individual a whole body dose exceeding the annual whole body dose limit of 20 mSv, or that the predicted frequency of such excursions is acceptably low. In the UK, EDF Energy operates eight nuclear power stations; one Pressurized Water Reactor (PWR) and seven Advanced Gas-cooled Reactor stations (AGRs). At these stations, the term 'fuel route' is used to encompass all of the ex-reactor arrangements for the handling and storage of both new fuel and discharged irradiated fuel. These fuel routes were all designed in the 1980's (or earlier), using sound deterministic criticality safety principles, from which it was concluded that criticality alarms were not required in any of these areas. Subsequent changes to UK regulations have resulted in the need for the stations' criticality safety cases to be updated to include formal justifications for the omission of criticality alarms from these fuel routes. The EDF Energy Criticality Incident Detection System (CIDS) omission cases have been produced using the principles originally developed for UKAEA in the early 1960's by Aspinall and Daniels. These principles continue to be regarded as a best-practice approach by UK industry. Modern UK regulations also incorporate the ALARP principle, which requires operators to minimize and balance all of the safety risks from power station operations, so that the risks to both the public and to workers are As Low As is Reasonably Practicable. This paper describes how the work undertaken used the so-called Aspinall and Daniels criteria in conjunction with the requirements of the ALARP principle. The fuel storage pond at the Sizewell B PWR was addressed by dose calculations to show that, from the shielding effects of the concrete structure and the pond water, the potential consequences of a criticality accident could not result in a radiation dose in excess of 20 mSv. All of the other fuel route areas were addressed on the basis that, even if all of the active engineered and administrative criticality controls were to fail, a criticality accident would still not be reasonably expected, i.e. the predicted frequencies of all such excursions are acceptably low. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Robust vehicle routing under uncertainty via branch-price-and-cut

Here, this paper contemplates how branch-price-and-cut solvers can be employed along with the robust optimization paradigm to address parametric uncertainty in the context of vehicle routing problems. In this setting, given postulated uncertainty sets for customer demands and vehicle travel times, one aims to identify a set of cost-effective routes for vehicles to traverse, such that the vehicle capacities and customer time window constraints are respected under any anticipated demand and travel time realization, respectively. To tackle such problems, we propose a novel approach that combines cutting-plane techniques with an advanced branch-price-and-cut algorithm. Specifically, we use deterministic pricing procedures to generate "partially robust" vehicle routes and then utilize robust versions of rounded capacity inequalities and infeasible path elimination constraints to guarantee complete robust feasibility of routing designs against demand and travel time uncertainty. In contrast to recent approaches that modify the pricing algorithm, our approach is both modular and versatile. It permits the use of advanced branch-price-and-cut technologies without significant modification, while it can admit a variety of uncertainty sets that are commonly used in robust optimization but could not be previously employed in a branch-price-and-cut setting.

42 ENGINEERING↗
DOE OSTI2016

Using geographic information science to evaluate legal restrictions on freight transportation routing in disruptive scenarios

Disasters have consequences and freight transportation is not immune from the effects of such disruptions. In the aftermath of disasters, planners and policymakers have to utilize scarce resources and work within legal frameworks to provide recovery for affected citizens and business. As seen with Hurricane Sandy, various observers noted the challenge with freight rerouting due to inoperable infrastructure and legal barriers involved with intermodal freight transportation. This paper focuses on how Geographic Information Systems (GIS); specifically WebTRAGIS (Transportation Routing Analysis GIS), a transportation routing platform developed at Oak Ridge National Laboratory, can be used to evaluate different routing options for freight transportation. In the case of freight transportation, the Merchant Marine Act of 1920 (also known as the Jones Act) restricts Short Sea Shipping (SSS) between coastwise points within U.S. territorial waters. This restriction leads to reliance on land-side modes for handling increased freight resulting from cargo diversion. Using Hurricane Sandy and the closure of the Port of New York/New Jersey as a case study, different modal studies were conducted; ultimately highlighting the various routes and provides insight into potential review of modal restrictions such as the Jones Act.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2018

Trip Energy Estimation Methodology and Model Based on Real-World Driving Data for Green-Routing Applications

A data-informed model to predict energy use for a proposed vehicle trip has been developed in this paper. The methodology leverages roughly one million miles of real-world driving data to generate the estimation model. Driving is categorized at the sub-trip level by average speed, road gradient, and road network geometry, then aggregated by category. An average energy consumption rate is determined for each category, creating an energy rate look-up table. Proposed vehicle trips are then categorized in the same manner, and estimated energy rates are appended from the look-up table. The methodology is robust and applicable to a wide range of driving data. The model has been trained on vehicle travel profiles from the Transportation Secure Data Center at the National Renewable Energy Laboratory and validated against on-road fuel consumption data from testing in Phoenix, Arizona. When compared against the detailed on-road conventional vehicle fuel consumption test data, the energy estimation model accurately predicted which route would consume less fuel over a dozen different tests. When compared against a larger set of real-world origin-destination pairs, it is estimated that implementing the present methodology should accurately select the route that consumes the least fuel 90% of the time. The model results can be used to inform control strategies in routing tools, such as change in departure time, alternate routing, and alternate destinations to reduce energy consumption. This work provides a highly extensible framework that allows the model to be tuned to a specific driver or vehicle type.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Development of The PaR Tool: Modernization of the Planning and Routing Scripts

The placement of an efficient route for power lines is a poorly understood. Owners of the land are often divided about whether to allow their land to have a pole placed. A planning and routing toolkit allows for the people to allow and deny access to land then instantly see the route recalculate. The original planning and routing scripts were the original proof of concept, there was a series of problems that greatly hindered the functionality of the system. The PaR Tool a fully featured application replaced the proof of concept scripts and the speed of the system was increased by 254%. It is readily extensible and far easier to use.

17 WIND ENERGY↗
DOE OSTI2025

Route Energy Prediction (RouteE) Powertrain Validation Report

The National Renewable Energy Laboratory's flagship package in the RouteE suite, RouteE-Powertrain, is a mesoscopic energy model that predicts vehicle energy consumption given discrete attributes that describe each segment or link in a vehicle's path on a road network. High-frequency, physics-based, powertrain simulators, such as NREL's FASTSim, are well-suited to model vehicle energy consumption when real driving data and a detailed understanding of the vehicle powertrain specifications are available. However, there are a variety of situations in the past, present (real-time), and future where high-frequency driving data and/or vehicle information may not be available, but reliable energy consumption is still desired, such as energy-aware vehicle routing. These are the ideal applications for RouteE-Powertrain. The suite of RouteE tools also includes RouteE-Compass, which is an eco-routing software that incorporates energy consumption into network routing algorithms, and RouteE-Mobile, which is a prototype smartphone navigation app to demonstrate the integrated capabilities of the RouteE suite for real-world eco-routing. The focus of this validation report is to share key metrics about the data sets and models behind RouteE-Powertrain. The set of RouteE-Powertrain models discussed in this report are made available through the RouteE web API through the NREL Developer Network.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS2016

Risk-Hedged Approach for Re-Routing Air Traffic Under Weather Uncertainty

This presentation corresponds to: our paper explores a new risk-hedged approach for re-routing air traffic around forecast convective weather. In this work, flying through a more likely weather instantiation is considered to pose a higher level of risk. Current operational practice strategically plans re-routes to avoid only the most likely (highest risk) weather instantiation, and then tactically makes any necessary adjustments as the weather evolves. The risk-hedged approach strategically plans re-routes by minimizing the risk-adjusted path length, incorporating multiple possible weather instantiations with associated likelihoods (risks). The resulting model is transparent and is readily analyzed for realism and treated with well-understood shortest-path algorithms. Risk-hedged re-routes are computed for some example weather instantiations. The main result is that in some scenarios, relative to an operational-practice proxy solution, the risk-hedged solution provides the benefits of lower risk as well as shorter path length. In other scenarios, the benefits of the risk-hedged solution are ambiguous, because the solution is characterized by a tradeoff between risk and path length. The risk-hedged solution can be executed in those scenarios where it provides a clear benefit over current operational practice.

air traffic routing↗
NASA NTRSDate not supplied

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗
NASA NTRSDate not supplied

Deep Reinforcement Learning based Routing in an Air-to-Air Ad-hoc Network

This paper studies the Multiple Sources and Multiple Destinations (MSMD) routing problem in a dynamic Air-to-Air Ad-hoc Network (AAAN). We consider a spectrum limited scenario where multiple links have to share the same frequency channel so that co-channel interference becomes inevitable. As a result, routing decisions and spectrum access are coupled and must be jointly considered. This paper proposes a deep Q-learning based algorithm to find an optimal routing and channel selection strategy that minimizes the end-to-end communication delay. Specifically, under the assumption that only local information is available to every node, the Deep Q-Network (DQN) is trained offline to learn the optimal routing and channel selection strategy. After the trained DQN is implemented in every node, multiple relay nodes can simultaneously determine their next-hop relay and channel selections in real-time. Simulation results demonstrate the efficacy of our proposed algorithm.

AAAN↗
DOE OSTI2025

Energy-Aware Route Planning with RouteE Compass

This poster introduces RouteE Compass, a new tool that advances sustainable transportation by enabling energy-aware route planning across diverse vehicle types and large-scale road networks. By addressing practical trade-offs between energy consumption, travel time, and economic cost, RouteE Compass fills critical gaps in traditional routing methods, which often lack the flexibility to prioritize energy directly. The tool's scalability and high-performance computing capabilities allow for national-scale analyses, offering actionable insights for fleet operators, transit agencies, and researchers. As an open-source, extensible platform, RouteE Compass empowers ongoing research and innovation in energy-aware routing, supporting the broader goals of reducing emissions and enhancing transportation sustainability.

ADVANCED PROPULSION SYSTEMS,DIRECT ENERGY CONVERSI↗
DOE OSTI2016

Transport spatial model for the definition of green routes for city logistics centers

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

A real-time energy and cost efficient vehicle route assignment neural recommender system

Here, this paper presents a neural network recommender system algorithm for assigning vehicles to routes based on energy and cost criteria. In this work, we applied this new approach to efficiently identify the most cost-effective medium and heavy duty truck (MDHDT) powertrain technology, from a total cost of ownership (TCO) perspective, for given trips. We employ a machine learning based approach to efficiently estimate the energy consumption of various candidate vehicles over given routes, defined as sequences of links (road segments), with little information known about internal dynamics, i.e. using high level macroscopic route information. A complete recommendation logic is then developed to allow for real-time optimum assignment for each route, subject to the operational constraints of the fleet. We show how this framework can be used to (1) efficiently provide a single trip recommendation with a top-k vehicles star ranking system, and (2) engage in more general assignment problems where n vehicles need to be deployed over m (m ≤ n) trips. This new assignment system has been deployed and integrated into the POLARIS. Transportation System Simulation Tool for use in research conducted by the Department of Energy's Systems and Modeling for Accelerated Research in Transportation (SMART) Mobility Consortium (SMART, 2024).

Energy consumption↗
DOE OSTI2018

A one-pot, solid-state route for realizing highly visible light active Na-doped gC{sub 3}N{sub 4} photocatalysts

The visible light photocatalytic activity of graphitic carbon nitride (gC{sub 3}N{sub 4}), a promising metal-free photocatalytic material, is rather low, and is not as good as expected. Herein, to realize improved photocatalytic activity, sodium-doped gC{sub 3}N{sub 4} (Na-gC{sub 3}N{sub 4}) is prepared through a novel solid-state process based on the thermal polycondensation of urea in the presence of sodium chloride and ammonium chloride. The proposed solid-state process is simple, requires no solvent, and provides a general route for rapid and large-scale synthesis of metal-doped gC{sub 3}N{sub 4}. The Na species exist in + 1 oxidation state and bind N atoms in the nitride ring of gC{sub 3}N{sub 4}. The photocatalytic activity improvement of gC{sub 3}N{sub 4} for the mineralization of 17α-ethynylestradiol (EE2) under visible light is seen after the Na doping. The improved photocatalytic activity is due to increased absorption of light, increased separation of charge carriers, stronger oxidation ability of valance band holes, and increased specific surface area. The typical photocatalytic activity of 0.6 wt% Na-gC{sub 3}N{sub 4} for the EE2 mineralization with an initial EE2 concentration of 1 mg/L and a catalyst concentration of 1 g/L is 95.7% within 2 h of visible light irradiation. Under identical experimental conditions, the EE2 mineralization by pristine gC{sub 3}N{sub 4} is only 23.5%. - Graphical abstract: Highly visible light active Na-gC{sub 3}N{sub 4} photocatalysts were simply synthesized through a novel one-pot route based on the thermal polycondensation of urea. The doped Na species plays a critical role in improving the photocatalytic activity. Display Omitted - Highlights: • A new solid-state route is introduced to obtain visible light active Na-doped gC{sub 3}N{sub 4}. • The proposed synthesis route is fast, simple, and highly scalable. • Na doping leads to improved light absorption capability. • Na doping leads to improved separation of charge carriers. • Na doping leads to improved photocatalytic activity under visible light.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗