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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Route Optimization for Energy Efficient Airport Shuttle Operations - A Case Study from Dallas Fort Worth International Airport

Air travel and requisite surface traffic supporting passenger arrival/departure constitutes a significant portion of travel and emissions in cities with large airports. An airport trip can segment into three parts namely: i) travel from a location in the city to the airport; ii) travel from a parking lot or rental car center to the terminal (i.e., within the airport premises), and iii) travel inside the terminal. Depending on the airport access mode all or a part of these legs comprise a traveler’s journey to the airport. The priority of airport ground transport management teams is to provide passengers with a seamless travel experience within the airport, so it is understandable that within airport shuttle routes might not be optimized for minimizing energy consumption. Solutions that meet the dual objective of reducing energy consumption from airport shuttle operations without compromising on passenger travel experience are key to improving system efficiency. There is currently a dearth of research and tools that can inform airports in making such decisions. Addressing this need, this research effort puts forth an optimization model that generates optimal shuttle routes for a given set of constraints, and a discrete-event simulator that evaluates the optimal solutions in a stochastic environment to understand the tradeoffs between passenger wait times, and within airport shuttle energy consumption. The proposed set of tools are tested in the context of optimizing airport shuttles routes within the Dallas Fort Worth International Airport (DFW). In addition to shuttle spatial positioning, and passenger demand information, high-fidelity vehicle data was collected using data loggers installed on DFW shuttles. Results show that 20% energy reduction in shuttle operations is possible with a modest two-minute increase in average passenger wait times. The tools developed in this research effort are designed to be generalizable and can help optimize shuttle operations planning at any major airport.

air travel↗
DOE OSTI2021

Delivery drone route planning over a battery swapping network

Many enterprises invest on drone delivery research and development to drop off packages at consumers’ doorsteps in a matter of minutes. We study delivery drone route planning over a battery swapping network allowing farther reach by penetrating current battery capacity constraints. A mixed-integer nonlinear programming model is created to plan efficient drone routing over the swapping machines by minimizing the delivery lead time. We develop an exact solution method, evaluate its performance, and compare it with a straightforward nonlinear solver application. A case study highlights the applicability of the model. Data and source code to the solver are publicly shared.

drone battery swapping↗
DOE OSTI2021

Searching for a route to synthesize in situ epitaxial Pr 2 Ir 2 O 7 thin films with thermodynamic methods

In situ growth of pyrochlore iridate thin films has been a long-standing challenge due to the low reactivity of Ir at low temperatures and the vaporization of volatile gas species such as IrO 3 (g) and IrO 2 (g) at high temperatures and high P O2 . To address this challenge, we combine thermodynamic analysis of the Pr-Ir-O 2 system with experimental results from the conventional physical vapor deposition (PVD) technique of co-sputtering. Our results indicate that only high growth temperatures yield films with crystallinity sufficient for utilizing and tailoring the desired topological electronic properties and the in situ synthesis of Pr 2 Ir 2 O 7 thin films is fettered by the inability to grow with P O2 on the order of 10 Torr at high temperatures, a limitation inherent to the PVD process. Thus, we suggest techniques capable of supplying high partial pressure of key species during deposition, in particular chemical vapor deposition (CVD), as a route to synthesis of Pr 2 Ir 2 O 7 .

Chemistry↗
DOE OSTI2023

Spectral shaping of an ultrafast ytterbium fiber laser via a passive intracavity optical filter: a simple and reliable route to sub-45 fs pulses

We investigate the use of passive intracavity optical filters for controlling the laser output spectrum of a polarization-mode-locked, ultrafast ytterbium fiber laser. The overall lasing bandwidth is increased or extended by strategic choice of the filter cutoff frequency. Overall laser performance, including pulse compression and intensity noise, is investigated for both shortpass and longpass filters with a range of cutoff frequencies. The intracavity filter not only shapes the output spectra, but also provides a route for overall broader bandwidths and shorter pulses in ytterbium fiber lasers. These results demonstrate that spectral shaping with a passive filter is a useful tool to routinely achieve sub-45 fs pulse durations in ytterbium fiber lasers.

Cooper, Nicholas D.↗
DOE OSTI2021

Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles.

This paper develops a multi-objective eco-routing algorithm (combined eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Eco-routing is a technique that finds the most energy efficient route. ICEV and BEV energy consumption patterns are significantly different with regard to their sensitivity to driving cycles. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared to highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce the BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,” “moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared to the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Routing packets based on congestion metric thresholds and weights

A technique includes receiving a packet at a network device, wherein the packet is to be routed in a network to a destination network device; determining a plurality of candidate routes for the packet to be routed to the destination network device; grouping the plurality of candidate routes into a first set of candidate routes and a second set of candidate routes based on hop counts associated with the plurality of candidate routes; selecting one of the first or second sets based on a congestion metric threshold; selecting a candidate route from the selected first or second set based on weight metric values associated with the candidate routes of the selected first or second set; and selecting an egress port associated with the selected candidate route.

McDonald, Nicholas George↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles

This paper develops a multi-objective eco-routing algorithm (eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared with highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single-objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,”“moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared with the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.

Engineering↗
DOE OSTI2023

Examining Rail Transportation Route of Crude Oil in the United States Using Crowdsourced Social Media Data

Safety issues associated with transporting crude oil by rail have been a concern since the boom of the U.S. domestic shale oil production in 2012. During the last decade, over 300 crude-oil-by-rail incidents have occurred in the United States. Some of them have caused adverse consequences including fire and hazardous materials leakage. However, only limited information on crude-on-rail routes and their associated risks is available to the public. To this end, this study proposed an unconventional way to reconstruct crude-on-rail routes using geotagged photos harvested from the Flickr website. The proposed method linked the geotagged photos of crude oil trains posted online with national railway networks to identify potential railway segments that those crude oil trains were traveling on. Here, a shortest path-based method was applied to infer the complete crude-on-rail routes, by utilizing the confirmed railway segments as well as their directional information. Validation of the inferred routes was performed using a public map and official crude oil incident data. The results suggested that the inferred routes based on geotagged photos had high coverage, with approximately 96% of the documented crude oil incidents aligned with the reconstructed crude-on-rail network. The inferred crude oil train routes were found to pass through several metropolitan areas of high population density, who were exposed to potential risk. These findings could improve situational awareness for policy makers and transportation planners. In addition, with the inferred routes, this study has established a good foundation for future crude oil train risk-analyses along the rail route.

42 ENGINEERING↗
DOE OSTI2021

Performance Evaluation of Adaptive Routing on Dragonfly-based Production Systems

Performance of applications in production environments can he sensitive to network congestion. Cray Aries supports adaptively routing each network packet independently based on the load or congestion encountered as a packet traverses the network. Software can dictate different routing policies, adjusting between minimal and non-minimal bias, for each posted message. We have extensively evaluated the sensitivity of the routing bias selection on application performance as well as whole system performance in both production and controlled conditions. We show that the default routing bias used in Aries-based systems is often sub-optimal and that using a higher bias towards minimal routes will not only reduce the congestion effects on the application but also will decrease the overall congestion on the network. This routing scheme results in not only improved mean performance (by up to 12%) of most production applications hut also reduced run-to-run variability. Our study prompted the two supercomputing facilities (ALCF and NERSC) to change the default routing mode on their Aries-based systems. We present the substantial improvement measured in the overall congestion management and interconnect performance in production after making this change.

Chunduri, Sudheer↗
DOE OSTI2022

Neural Architecture and Feature Search for Predicting the Ridership of Public Transportation Routes

Accurately predicting the ridership of public-transit routes provides substantial benefits to both transit agencies, who can dispatch additional vehicles proactively before the vehicles that serve a route become crowded, and to passengers, who can avoid crowded vehicles based on publicly available predictions. The spread of the coronavirus disease has further elevated the importance of ridership prediction as crowded vehicles now present not only an inconvenience but also a public-health risk. At the same time, accurately predicting ridership has become more challenging due to evolving ridership patterns, which may make all data except for the most recent records stale. One promising approach for improving prediction accuracy is to fine-tune the hyper-parameters of machine-learning models for each transit route based on the characteristics of the particular route, such as the number of records. However, manually designing a machine-learning model for each route is a labor-intensive process, which may require experts to spend a significant amount of their valuable time. To help experts with designing machine-learning models, we propose a neural-architecture and feature search approach, which optimizes the architecture and features of a deep neural network for predicting the ridership of a public-transit route. Our approach is based on a randomized local hyper-parameter search, which minimizes both prediction error as well as the complexity of the model. We evaluate our approach on real-world ridership data provided by the public transit agency of Chattanooga, TN, and we demonstrate that training neural networks whose architectures and features are optimized for each route provides significantly better performance than training neural networks whose architectures and features are generic.

Ayman, Afiya↗
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↗