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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Chen, Dong↗
DOE OSTI2022

Verification and Validation of START: A Spent Nuclear Fuel Routing and Decision Support Tool

The Stakeholder Tool for Assessing Radioactive Transportation (START) is a web-based geospatial decision-support tool being developed by the US Department of Energy’s Office of Integrated Waste Management (IWM) to support federal interim storage for spent nuclear fuel (SNF) and associated transportation. START provides many functions for the IWM program including: serving as a communications tool for conveying geospatial data and information, an options analysis tool for exploring potential transport modes and routes for transporting SNF from nuclear power plants to future federal interim storage facilities, an emergency response planning tool for Tribes and States to identify training needs along potential SNF transport corridors, an environmental analysis tool for estimating potential radiation dose exposure from incident-free and incident-case SNF transport conditions, and a systems analysis support tool providing route-related inputs for system throughput analysis. As part of the START development process, a verification and validation (V&V) effort is being undertaken. In the initial V&V phase, several outputs of the START tool were checked such as the total distance, population and population densities within the buffer zone, and incident free dose. The V&V process is fluid as it will be utilized after each version change to ensure that the core functionalities of the tool are maintained and the results are consistent with the previous versions. Efforts have also been put into developing scripts to aid in the process of automating certain sections of the V&V work. As some of the V&V efforts use Environmental Systems Research Institute’s (ESRI) tools upon which the START framework is built, the START data were compared against outputs from tools like Quantum Geographic Information System (QGIS) for buffer zone populations and route lengths to ensure independence of the V&V process. Good agreement was observed between the START results and the independent V&V studies with the majority of the differences falling between 1% and 5% for populations within the buffer zone and route distance. This presentation describes the development and design of the START tool, V&V methods employed for various metrics of interest and their respective results, and future plans.

START, transportation, GIS, V&V↗
DOE OSTI2023

Fort Erie Case Study - Transition from Fixed-Route to On-Demand Transit

Rural and smaller-sized communities in North America face unique mobility challenges due to their low population density, lower public transit spending per capita compared to major cities, and a high reliance on private vehicles. In recent years, communities such as Fort Erie, Ontario, have restructured or advanced their public transit systems using on-demand services. Fort Erie is a relatively sparsely populated region of 32,901 residents, spread across a land area of 166 square kilometers (64 square miles), for an average population density of 193 residents per square kilometer (500 per square mile). In October 2021, the town implemented a mobility-on-demand system integrated with smartphone software to replace its fixed-route community bus system, which consisted of four buses with three routes, each with a roughly 1-hour, one-way loop. The new service utilizes a fleet of six minivans, two of which are retrofitted with wheelchair-accessible ramps. The system may require that a passenger requesting a standard van walk up to 400 meters (a quarter mile) to their pickup location to optimize vehicle routing while providing origin-to-destination service. The on-demand system proved effective in providing service, eclipsing pre-pandemic ridership by 40%, decreasing greenhouse gas emissions per ride by 63%, and decreasing the cost to the town per ride by 29%. This report documents both the previous system and the new system in terms of routes, ridership, costs, fuel, and other notable system parameters. This work is part of an ongoing series of case studies on providing small communities with on-demand, right-sized vehicle service coupled with a smartphone application.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗
DOE OSTI2023

Secure eco-routing with databases under homomorphic encryption

A method for generating energy-optimized travel routes for a motor vehicle includes one or more of the following: receiving an origin destination (OD) of the motor vehicle and an encrypted energy consumption database of the motor vehicle; generating N candidate routes for the OD; evaluating encrypted energy consumption over a route using an encrypted energy consumption database; applying at least one of homomorphic addition function or homomorphic multiplication function to the encrypted energy consumption data; and returning N candidate routes and their encrypted energy consumption to a client.

Hegde, Bharatkumar↗
DOE OSTI2017

Routing Options for Transporting Commercial Spent Nuclear Fuel in the Continental United States - 17504

The U.S. Department of Energy (DOE) has a goal to develop solutions for the long-term, sustainable management of the nation's spent nuclear fuel and high-level radioactive waste. The DOE is planning for an integrated waste management system to transport, store, and dispose of spent nuclear fuel and high-level radioactive waste from commercial electricity generation, as well national defense activities. The DOE Office of Nuclear Energy (DOE-NE), Office of Spent Fuel and Waste Disposition's (SFWD) Integrated Waste Management (IWM) program is applying integrated waste management system analysis, system engineering, and decision analysis principles to inform future decisions regarding potential future nuclear waste management system architectures. Integrated waste management system architecture analyses are being conducted to support the future deployment of a comprehensive system for managing nuclear waste that considers all aspects of the back-end of the nuclear fuel cycle (transportation, storage, and disposal). One aspect of a potential future nuclear waste management system is transportation of spent nuclear fuel from the fleet of commercial nuclear reactors to destinations where waste management facilities, such as an interim storage facility, would be located. Example rail transportation routes from commercial nuclear reactor sites to various locations in the continental U.S. - chosen as hypothetical locations for future waste management system facilities - were evaluated in 2014 using DOE's GIS-based Stakeholder Tool for Assessing Radioactive Transportation (START). The objective of that evaluation was to identify and parameterize generic transportation routes for use in integrated waste management system analyses, the associated uncertainty in these selections, and the uncertainty associated with different transportation route selection criteria. The analysis presented herein considers rail transportation routes from commercial nuclear reactor sites to hypothetical destinations within the continental U.S. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2023

Intelligent network slicing and policy-based routing engine

One or more aspects of the present disclosure are directed to network optimization solutions provided as software agents (applications) executed on network nodes in a heterogenous multi-vendor environment to provide cross-layer network optimization and ensure availability of network resources to meet associated Quality of Experience (QoE) and Quality of Service (QoS). In one aspect, a network slicing engine is configured to receive at least one request from at least one network endpoint for access to the heterogeneous multi-vendor network for data transmission; receive information on state of operation of a plurality of communication links between the plurality of nodes; determine a set of data transmission routes for the request; assign a network slice for serving the request; determine, from the set of data transmission routes, an end-to-end route for the network slice; and send network traffic associated with the request using the network slice and over the end-to-end route.

Mody, Apurva N.↗
DOE OSTI2016

Connectivity-enhanced route selection and adaptive control for the Chevrolet Volt

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3%, respectively. Furthermore, these represent substantial opportunities considering that they only require software adjustments to implement.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2014

Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

ColdRoute: effective routing of cold questions in stack exchange sites

Routing questions in Community Question Answer services such as Stack Exchange sites is a well-studied problem. Yet, cold-start—a phenomena observed when a new question is posted is not well addressed by existing approaches. Additionally, cold questions posted by new askers present significant challenges to state-of-the-art approaches. We propose ColdRoute to address these challenges. ColdRoute is able to handle the task of routing cold questions posted by new or existing askers to matching experts. Specifically, we use Factorization Machines on the one-hot encoding of critical features such as question tags and compare our approach to well-studied techniques such as CQARank and semantic matching (LDA, BoW, and Doc2Vec). Furthermore by using data from eight stack exchange sites, we are able to improve upon the routing metrics (Precision@1, Accuracy, MRR) over the state-of-the-art models such as semantic matching by 159.5, 31.84, and 40.36% for cold questions posted by existing askers, and 123.1, 27.03, and 34.81% for cold questions posted by new askers respectively.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

In-route inductive versus stationary conductive charging for shared automated electric vehicles: A university shuttle service

In-route inductive charging technology, as applied to automated electric vehicles, can help realize a fully automated system of both vehicles and chargers. This study presents a planning optimization analysis for fixed-route automated shuttles supported by in-route inductive charging technology. A techno-economic feasibility of inductive charging was assessed in comparison with stationary charging, including Level 2 AC chargers, and DC fast chargers (DCFCs). This analysis considered both present-day and future vehicle operations and overall system costs. A real project with two circulator Navya Arma shared automated electric vehicles (SAEVs) at the University of Michigan was investigated using real-world collected energy and travel data. The outcomes show that the proper design of quasi-dynamic inductive chargers at designated stops allows SAEVs to realize unlimited driving range and be cost-competitive to DCFC technology. Considering present-day costs and vehicles, low-speed SAEVs can realize charge-sustaining operation at a minimum cost either by implementing a 50-kW inductive charger at two stops with one segment per position and a 29-kWh onboard battery, or by installing a 100-kW inductive charger at one stop with one segment per position and a 28-kWh onboard battery. Overall, considering future costs and vehicles, either a 40-kW charger at one stop with a 29-kWh battery or a 50-kW charger at the north stop with a 14-kWh battery would enable charge-sustaining operation. In addition, quasi-dynamic inductive solution can reduce the onboard battery by about 15% while providing unlimited driving range, but stationary scenarios require about 112% additional battery capacity to support a 12-h driving range.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Joint routing of conventional and range-extended electric vehicles in a large metropolitan network

Range-extended electric vehicles combine the higher efficiency and environmental benefits of battery-powered electric motors with the longer mileage and autonomy of conventional internal combustion engines. This combination is particularly advantageous for time-constrained delivery routing in dense urban areas, where battery recharging along routes can be too time-consuming to economically justify the use of all-electric vehicles. However, switching from electric to conventional fossil fuel modes also results in higher costs and emissions and lower efficiency. This paper analyzes this heterogeneous vehicle routing problem and describes two solution methods: an exact branch-price-and-cut algorithm and an iterated tabu search metaheuristic. From a methodological perspective, we find that the exact algorithm consistently obtains tight lower bounds that also serve to certify the metaheuristic solutions as near-optimal. From a policy standpoint, we examine a large-scale real-world case study concerning parcel deliveries in the Chicago metropolitan area and quantify various operational metrics including energy costs and vehicle miles traveled. We find that by deploying roughly 20% of range -extended vehicles with a modest all-electric range of 33 miles, parcel distributors can save energy costs by up to 17% while incurring less than 0.5% increase in vehicle miles traveled. Increasing the range to 60 miles further reduces costs by only 4%, which can alternatively be achieved by decreasing the average service time by 1 minute or increasing driver working time by 1 hour. In conclusion, our study reveals several key areas of improvement on which vehicle manufacturers, distributors, and policy makers can focus their attention.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance

Identifying energy-efficient routes in real-time has significant implications for the energy-optimal operations of electric vehicles (EVs). Here, this study proposes a novel model for EV online eco-routing problem, which obtains the minimal expected energy consumption paths (MECPs) for multiple origin-destination (OD) pairs simultaneously. Specifically, we formulate the routing problem as a bandit problem and solve it with online algorithms. We extend the algorithms by implementing a path elimination mechanism to reduce the candidate path set and introducing the variance and covariance of the energy consumption to reduce the uncertainties. The numerical results show that the proposed algorithms can efficiently obtain near-optimal MECPs, and the solution is significantly better than the widely used shortest trip time path algorithm (STTP) and shortest trip distance path algorithm (SDP). The variation considering link energy covariance and path elimination generates paths that save 4.1% of energy compared to the SDP and 5.4% to the STTP.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Cooperative Routing for an Air–Ground Vehicle Team—Exact Algorithm, Transformation Method, and Heuristics

This paper considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between the vehicles. The proposed framework uses a ground vehicle and an unmanned aerial vehicle (UAV) that travel cooperatively and visit a set of targets while satisfying the communication constraints. The problem is formulated as a mixed-integer linear program, and a branch-and-cut algorithm is developed to solve the problem to optimality. Furthermore, a transformation method and a heuristic are also developed for the problem. The effectiveness of all the algorithms is corroborated through extensive computational experiments on several randomly generated instances. Furthermore, this paper is motivated by an intelligence, surveillance, and reconnaissance mission involving a single unmanned aerial vehicle (UAV) and a ground vehicle, where the vehicles must coordinate their activity in the presence of communication constraints. The combination of a small UAV and a ground vehicle is an ideal platform for such missions, since small UAVs can fly at low altitudes and can avoid obstacles or threats that would be problematic for the ground vehicle alone. This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Multi-Commodity Traffic Signal Control and Routing With Connected Vehicles

We report a real-time traffic management policy that integrates traffic signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed policy is based on a multi-commodity formulation of the store-and-forward model and assumes all vehicles are able to exchange information with the infrastructure. Vehicles share information about their current location and final destination. Based on this information, the strategy determines both optimized signal timings at every intersection and vehicle-specific routing information at every link of the network. The control actions, i.e., signal times and routing information, are updated at every cycle and delivered by a finite horizon optimal control problem cast into a rolling horizon framework. The underlying optimization problem is convex, and thus the method is suitable for real-time operation in large networks. The method is validated via a micro-simulation study in networks with up to twenty intersections and, in all simulations, outperforms a real-time traffic-responsive signal control strategy that is based on a single-commodity store-and-forward model. The scalable computation effort for increasing network sizes and prediction horizon confirms the computational efficiency of the method.

42 ENGINEERING↗
NASA NTRS2008

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

CGR↗
NASA NTRS2016

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

uncertainty↗
NASA NTRS2018

TCAS Alerts from Simulated Urban Air Mobility Flights Along FAA Helicopter Routes in Dallas-Fort Worth

This is a presentation of the current state of a TCAS study being conducted by the ATM-X project. This study examines the rate at which an urban air mobility vehicle flying along existing helicopter routes near DFW will trigger alerts on the TCAS II systems equipped on commercial airliners flying in the D10 TRACON of DFW airspace. The presentation will cover initial results, as well as next steps on the path towards producing a full paper. These initial results show that some aircraft could fly along published helicopter routes, while obeying published restrictions, and fly into and out of DFW airport without triggering any TCAS RAs, so long as the airport is operating in South Flow and the UAM vehicles approach and depart; the airport in the same direction as commercial traffic. Attempting to take off opposite the direction of commercial traffic produces a large number of TCAS RAs. Future work will examine North Flow, check sensitivity to aircraft performance, and examine alternative routes.

helicopter routes↗
DOE OSTI2024

Reducing AI RAG Hallucination by Optimizing Routing Techniques

Large Language Models (LLMs), such as ChatGPT, tend to “hallucinate”, meaning they confidently generate false information. Retrieval Augmented Generation (RAG) attempts to diminish hallucination by providing context to the LLM from data stores (indexes) containing relevant information. The LLM uses this context to formulate its response. RAG systems can still suffer from hallucination because of bad embeddings or ineffective routing. For example, a router will often return context from an irrelevant index, resulting in a hallucinated answer. In this study, we aim to minimize the frequency of routing hallucinations by optimizing Index Summary Routing.

97 MATHEMATICS AND COMPUTING↗