Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Route optimization”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗
DOE OSTI2020

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗
DOE OSTI2014

I/O Router Placement and Fine-Grained Routing on Titan to Support Spider II

The Oak Ridge Leadership Computing Facility (OLCF) introduced the concept of Fine-Grained Routing in 2008 to improve I/O performance between the Jaguar supercomputer and Spider, OLCF s center-wide Lustre file system. Fine-grained routing organizes I/O paths to minimize congestion. Jaguar has since been upgraded to Titan, providing more than a ten-fold improvement in peak performance. To support the center s increased computational capacity and I/O demand, the Spider file system has been replaced with Spider II. Building on the lessons learned from Spider, an improved method for placing LNET routers was developed and implemented for Spider II. The fine-grained routing scripts and configuration have been updated to provide additional optimizations and better match the system setup. This paper presents a brief history of fine-grained routing at OLCF, an introduction to the architectures of Titan and Spider II, methods for placing routers in Titan, and details about the fine-grained routing configuration.

Ezell, Matthew A↗
DOE OSTI2017

Energy-Efficient Cruise Control Using Optimal Control for a Hybrid Electric Vehicle

Increasing connectivity in passenger vehicles provides for a large amount of look-ahead information about driving conditions. An intelligent control algorithm is presented that takes advantage of this information to obtain the operation strategy for the powertrain of a parallel hybrid electric vehicle, in an uncongested highway cruising situation. In order to guarantee sufficient computational efficiency to meet future online requirements, the algorithm is based on Pontryagin’s Minimum Principle. The whole driving/operation strategy is composed of a series of solutions to the optimal control sub-problem for each separate route segment. The control sequence computed offline is then evaluated in Autonomie. The simulation result shows 6% fuel savings compared to a baseline rule-based controller with no speed optimization.

Shen, Daliang↗
DOE OSTI2014

An Efficient, Optimized Synthesis of Fentanyl and Related Analogs

The alternate and optimized syntheses of the parent opioid fentanyl and its analogs are described. The routes presented exhibit high-yielding transformations leading to these powerful analgesics after optimization studies were carried out for each synthetic step. The general three-step strategy produced a panel of four fentanyls in excellent yields (73–78%) along with their more commonly encountered hydrochloride and citric acid salts. In conclusion, the following strategy offers the opportunity for the gram-scale, efficient production of this interesting class of opioid alkaloids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
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 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 OSTI2018

A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

42 ENGINEERING↗
DOE OSTI2015

Systems for the Intermodal Routing of Spent Nuclear Fuel

The safe and secure movement of spent nuclear fuel from shutdown and active reactor facilities to intermediate or long term storage sites may, in some instances, require the use of several modes of transportation to accomplish the move. To that end, a fully operable multi-modal routing system is being developed within Oak Ridge National Laboratory s (ORNL) WebTRAGIS (Transportation Routing Analysis Geographic Information System). This study aims to provide an overview of multi-modal routing, the existing state of the TRAGIS networks, the source data needs, and the requirements for developing structural relationships between various modes to create a suitable system for modeling the transport of spent nuclear fuel via a multimodal network. Modern transportation systems are comprised of interconnected, yet separate, modal networks. Efficient transportation networks rely upon the smooth transfer of cargoes at junction points that serve as connectors between modes. A key logistical impediment to the shipment of spent nuclear fuel is the absence of identified or designated transfer locations between transport modes. Understanding the potential network impacts on intermodal transportation of spent nuclear fuel is vital for planning transportation routes from origin to destination. By identifying key locations where modes intersect, routing decisions can be made to prioritize cost savings, optimize transport times and minimize potential risks to the population and environment. In order to facilitate such a process, ORNL began the development of a base intermodal network and associated routing code. The network was developed using previous intermodal networks and information from publicly available data sources to construct a database of potential intermodal transfer locations with likely capability to handle spent nuclear fuel casks. The coding development focused on modifying the existing WebTRAGIS routing code to accommodate intermodal transfers and the selection of prioritization constraints and modifiers to determine route selection. The limitations of the current model and future directions for development are discussed, including the current state of information on possible intermodal transfer locations for spent fuel.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Economic Storage Size Optimization for Electric Vehicle Extreme-Fast Charging Stations

En-route charging infrastructure for electric vehicles is critical to support transportation needs. These charging stations are likely to have high loads and especially sharp peak loads given fast charging capabilities needed to meet transportation schedules. In order to reduce both strain on distribution grid infrastructure and charging station operational costs, many stations are likely to employ behind the meter storage. This paper demonstrates a behind the meter storage sizing optimization that employs an open-source agent-based vehicle behavior model (BEAM) to determine the best sizing across many scenarios. This optimization and analysis is novel in that it examines how storage size impacts not only charging station cost and peak load, but also vehicle queue times. The optimization is also applied across a wide analysis region with sufficient diversity and numbers to provide novel statistical analysis of optimal sizes.

Aka, Julius↗
DOE OSTI2021

Energy and Emission Prediction for Mixed-Vehicle Transit Fleets Using Multi-task and Inductive Transfer Learning

Public transit agencies are focused on making their fixed-line bus systems more energy efficient by introducing electric (EV) and hybrid (HV) vehicles to their fleets. However, because of the high upfront cost of these vehicles, most agencies are tasked with managing a mixed-fleet of internal combustion vehicles (ICEVs), EVs, and HVs. In managing mixed-fleets, agencies require accurate predictions of energy use for optimizing the assignment of vehicles to transit routes, scheduling charging, and ensuring that emission standards are met. The current state-of-the-art is to develop separate neural network models to predict energy consumption for each vehicle class. Although different vehicle classes’ energy consumption depends on a varied set of covariates, we hypothesize that there are broader generalizable patterns that govern energy consumption and emissions. In this paper, we seek to extract these patterns to aid learning to address two problems faced by transit agencies. First, in the case of a transit agency which operates many ICEVs, HVs, and EVs, we use multi-task learning (MTL) to improve accuracy of forecasting energy consumption. Second, in the case where there is a significant variation in vehicles in each category, we use inductive transfer learning (ITL) to improve predictive accuracy for vehicle class models with insufficient data. As this work is to be deployed by our partner agency, we also provide an online pipeline for joining the various sensor streams for fixed-line transit energy prediction. Here, we find that our approach outperforms vehicle-specific baselines in both the MTL and ITL settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Network coding for improving throughput in WDM optical networks with dedicated protection

Network coding (NC) has been recently emerging as an excellent technique for leveraging network efficiency. In optical networks, NC and protection appear to be a good match and indeed, NC could be effectively exploited for greater protection efficiency thanks to the opportunity of combining signals rather than duplication in the traditional approach. Motivated by this observation, we investigate the application of a simple and practical NC technique based on XOR operation to improve the network throughput in survivable optical networks. To this end, we propose the NC-based protection whose speed recovery is on a par with the conventional 1+1 dedicated protection while the capacity usage could be more efficient, paving the way for improving throughput in constrained capacity conditions. A novel mixed integer linear programming model is developed for survivable optical networks design employing the proposed NC-based protection. The model attempts to optimally determine the demands to serve, the routing for served demands and NC assignment among demands aiming at maximizing the network throughput in the constraint of bandwidth limitation. Extensive numerical evaluations on realistic topologies are provided to highlight the advantages of our NC-based protection proposal compared with the conventional dedicated protection in improving the network throughput. Encouraging results are observed when the new protection proposal based on NC could accommodate up to 30% more traffic than the conventional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Distinct Mechanisms and Hydricities of Cp*Ir-Based CO 2 Hydrogenation Catalysts in Basic Water

Transition metal-catalyzed reversible hydrogenation of CO 2 to formate in aqueous solutions under ambient conditions is an attractive environmentally friendly strategy for the storage and transportation of H 2 in a liquid chemical form. Here, mechanistic details for the CO 2 hydrogenation by a series of pentamethylcyclopentadienyl iridium(III) (Cp*Ir) complexes with picolinamidate ligands are investigated through density functional theory and kinetic isotope effects (KIEs) calculations. Additionally, adopting a speciation approach at a pH of 8.2, CO 2 hydrogenation mechanisms of 37 distinct protonation states and conformers of Cp*Ir type complexes are investigated. This imposes a challenging test for the computational modeling in terms of providing a consistent correlation with experimental kinetics and KIE studies of multiple catalysts instead of a single complex. Overall, H 2 heterolysis to generate an iridium hydride intermediate was demonstrated to be the rate determining step, which proceeds via distinct pathways depending on the stereoelectronic properties of the ligand. A peculiar iridium dihydride route was also uncovered, which could be optimized to accelerate the H 2 heterolysis. We have further computed the thermodynamic and kinetic hydricities of 74 complexes with [Cp*Ir(L)(H)] q ( q = -1, 0, 1 depending on the ligand charge by deprotonation or protonation events) general formula. Hydricity values do not show any noticeable correlation with the thermodynamics (Δ G ) of [Cp*Ir(L)(HCO 2 – )] formation but exhibit linear correlation with the kinetics (Δ G ‡ ) of electrophilic CO 2 attack to iridium hydride species, especially when the charges and local structural effects of the metal hydrides are considered. Insights gained in this study on (i) the factors determining the preferred pathway for the rate-limiting H 2 heterolysis step, (ii) the correlation between thermodynamic hydricity and the kinetics of CO 2 insertion to iridium hydride species, and (iii) mechanistic analysis via combination of free energy profiles and KIE studies for a series of iridium catalysts will provide guidelines for the design of next-generation catalysts for the reversible H 2 storage through CO 2 utilization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Extracting Knowledge from Data through Catalysis Informatics

Catalysis informatics is a distinct sub-field that lies at the intersection of cheminformatics and materials informatics, but with unique challenges arising from the dynamic, surface-sensitive, multi-scale nature of heterogeneous catalysis. The ideas behind catalysis informatics can be traced back decades, but the field is only recently emerging due to advances in data infrastructure, statistics, machine learning, and computational methods. In this work we review the field from early works on expert systems and knowledge engines to more recent approaches utilizing machine-learning and uncertainty quantification. The data-information-knowledge hierarchy is introduced and used to classify various developments. The chemical master equation and micro-kinetic models are proposed as a quantitative representation of catalysis knowledge, which can be used to generate explanative and predictive hypotheses for the understanding and discovery of catalytic materials. We discuss future prospects for the field, including improved quantitative coupling of experiment/theory, advanced micro-kinetic models, and the development of open-source software tools. As a result, integration of existing chemical and physical models with emerging statistical and computational tools presents a promising route toward the automated design, discovery, and optimization of heterogeneous catalytic processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Speciation of uranium in La{sub 2}Zr{sub 2}O{sub 7} pyrochlore by TRPLS

We discuss the speciation of uranium in lanthanum zirconate (La{sub 2}Zr{sub 2}O{sub 7} =LZO) pyrochlore ceramic prepared via a gel-combustion route. Uranium concentration in the pyrochlore was optimized to 2 mol%. XRD and SEM experiments were carried out to assess the phase and homogeneity of the prepared samples. Time resolved photoluminescence (TRPLS) investigations were carried out for understanding the species stabilized in the pyrochlore host. It was observed that, uranium exists as uranate ion (UO{sub 6}{sup 6−}) in the zirconate host where it replaces the ‘Zr’ ions at its regular site with surrounding defect centers created for charge compensation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2015

Heterogeneous nucleation of CdS to enhance visible-light photocatalytic hydrogen evolution of SiC/CdS composite

Synthesis of composite photocatalyst is one of the most important strategies to enhance the yield of hydrogen produced by water splitting. However, one photocatalyst usually tends to randomly aggregate on the other's surface, which weakens the electron transport of the heterogeneous interface. Herein, we developed a hydrothermal reaction to synthesize the SiC/CdS composite with a feasible Z-scheme and well-controlled dispersion of CdS on SiC surface. Heterogeneous structure on the catalyst interface is obtained, leading to more light-absorption and effective electron-hole separation between the well-contacted components, which contribute to the doubly enhanced photocatalytic performance of the composite. This work provides a simple and practical route to improve the catalytic activity by optimizing the intrinsic contact of Z-scheme composite semiconductors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Fused Global-Local Economic Model Predictive Control for Real-Time Eco-Optimal Control of a Heavy Duty Truck

This paper introduces a fused global-local economic model predictive control (MPC) with varying time steps for maximizing the fuel economy of a heavy-duty truck, where global MPC is performed over a long horizon using cloud-based dynamic programming (DP), and local MPC is performed on-board the vehicle using sequential quadratic programming (SQP). Because of the computational complexity of DP, an in-depth analysis of how the discretization levels, time constant, and horizon length influence the energy savings and computational complexity of online DP has been performed. The fused optimization technique has been evaluated over different route profiles, accounting for traffic, using a medium-fidelity proprietary Volvo model. Results show 4-7% fuel savings, as compared to a baseline model.

33 ADVANCED PROPULSION SYSTEMS↗