Search NASA⌕ Search

SEARCH · Search NASA

Results for “routing problems”

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 55 records · Page 3

EB Vs PAM Vs VAR for Uranium Alloys

Questions were raised during the February ’97 PDP Meeting at LLNL as to the advisability of funding three separate melting development programs (Advanced Vacuum Arc Remelt (VAR), Plasma Arc Melting (PAM) and Electron Beam Melting (EB)) through PDP in this era of shrinking research funds. The main issues seemed to be: 1) Have we evaluated the potentials of the three processes sufficiently to eliminate any of them out of hand and 2) Have any of these processes to date produced results which show clear advantages over the other two. The feeling at the meeting toward the latter seemed to be that all three processes required further development before they would be accepted by the complex as the standard. As far as evaluating potential for process improvements, however, we at Livermore did go through somewhat of a trade study in 1993 when we proposed the EB route. It seemed to us that even with the elimination of the skull caster via a VIM/VAR/VAR route, the problem of recycle limitations in the VIM step due to excessive carbon pick-up limited the potential for a great improvement in material utilization using this method. A single-step, cold hearth route looked to be the preferable choice. Both EB and PAM are used commercially as cold hearth processes, and both have been used for the production of refractory and specialty metals; EB since the mid 1950’s and PAM since the mid 1980’s. Both seem to have found their individual niches with some applications being suited to EB and others to PAM. Both can be adapted to continuous casting techniques and both are capable of imparting the high heat fluxes necessary to melt refractory metals. The major differences appear to be that for most applications, the EB process is capable of producing a purer product, while PAM results in less loss of volatile components. There exists an abundance of information in the open literature on the results of processing via both routes on various materials. The attached 1984 paper gives a good explanation of electron beam melting and plasma melting, and, I believe, a fair assessment of the advantages and limitations of both processes.

36 MATERIALS SCIENCE↗

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↗

Spacial and objective decompositions for very large SCAPs

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight run-time constraints to be practical in real-world disaster situations. This paper revisits the SCAP algorithm proposed in and proposes new storage allocation models that are necessary to enable the algorithm to scale to problem sizes of three orders of magnitude greater (250, 500, 1000 storage locations). The new algorithms are validated on large-scale hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools.

97 MATHEMATICS AND COMPUTING↗

Strategic planning for disaster recovery with stochastic last mile distribution

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools and is deployed to aid federal organizations in the US.

97 MATHEMATICS AND COMPUTING↗

Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.

42 ENGINEERING↗

Understanding NBI heating and fueling in LTX-β tokamak

My work on the contract DE-SC=0023274 (July, 2022 - July, 2025) was focused on understanding the plasma fueling by NBI. On Dec. 1998 with Sergei Krasheninnikov (UCSD, San Diego, CA) we initiated the Li Wall Fusion (LiWFusion) as a new concept of magnetic fusion [1]. The new 1 2 plasma 3 4 5 6 2.1 Overview of rate coefficients, mean-free paths λH0 , and diffusions coefficients 6 2. GSV code for ⟨σv⟩ analysis of NBI fueling concept was a reaction of the lack of luck of tokamak fusion with QDT = 1 on TFTR and JET. We recognized the edge plasma cooling by recycling to be the route reason of the tokamak problems on the way to burning plasma. LiWFusion relies on plasma pumping by a lithium layer on the inner walls of the plasma chamber, combined with the plasma heating and fueling by the Neutral Beam Injection (NBI). These two innovations eliminate the route problem of the tokmak fusion. The concept became theoretically mature in 2006. In 2012, the technology of continuously Flowing Liquid Lithium (24/7-FLiLi) was invented by me for the future implementations of the LWFusion concept. At the same time, my every presentation on LiWFusion to International Symposium on Lithium Applications since 2010 was objected by some person with words “Everybody since the 1970s knows that plasma fueling by NBI is impossible”. I dropped the name of the author of this objection and ignored his views. My work on the current grant on NBI fueling of LTX-β not only clarified the issue but resolved it in an astonishing way. The NBI fueling was fully understood (thus humiliating the current dogmatic fusion community). The new future of LTX-β dedicated for decades to Li in tokamaks, as well as of the entire magnetic fusion program was envisioned, in sharp contrast with the fallure of OFES in the post-TFTR era of 21st century.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal Operation of a Plug-In Hybrid Vehicle

In this work, we present a convex optimization control method that has been shown in simulations to increase the fuel efficiency of a plug-in hybrid electric vehicle by over 10%. Using information on energy demand and energy use profiles, the problem is defined to preferentially use battery resources sourced from the grid over petroleum resources. We pose the general nonlinear optimal resource management problem over a predetermined route as a convex optimization problem using a reduced model of the vehicle. This problem is computationally efficient enough to be optimized “on the fly” on the on-board vehicle computer and is thus able to adapt to changing vehicle conditions in real time. Lastly, using this reduced model to generate control inputs for the detailed vehicle simulator autonomie, we record efficiency gains of over 10% as compared to the industry standard charge depleting charge sustaining controller over synthetic mixed urban-suburban routes.

02 PETROLEUM↗

Supporting mobile WEEE collection on demand: A method for multi-criteria vehicle routing, loading and cost optimisation

Highlights: • Multi-criteria method of WEEE mobile collection on demand. • Vehicle routing and loading problem included in the model and algorithm. • Optimisation of collecting vehicles routes including genetic algorithms and fuzzy logic. • Case study for heterogeneous fleet of collection vehicles for medium size city in Poland. • Possible application in a software supporting waste collection on demand. - Abstract: The task of increasing collection rates of waste electrical and electronic equipment (WEEE) is an important challenge in the global economy, and especially in the European Union where stiffer collection targets set out in a new WEEE directive are to be effective by 2019. As the circular economy approach replaces the linear model, resource recycling activities become a priority in waste management policy. As new techniques and possibilities of waste collection systems emerge, opportunities are created for improving efficiency for collection companies and affording benefits for the environment. A model proposed for mobile WEEE collection in this study considers a multi-criteria approach in developing a cost efficient method for pick up on demand from residents or electrical and electronic equipment (EEE) stores. The algorithm used in this model optimises vehicle routes and helps in selecting a number of vehicles from a heterogeneous fleet, incorporating the WEEE loading problem. Using genetic algorithm and fuzzy logic, this model optimises costs and resources required to complete the WEEE collection assuring timely pick up of the waste equipment. The numerical model is verified in a case study in Opole, a city in the south of Poland. The results show that the proposed model can handle the multiple parameter optimisation problem including operational costs, efficient use of vehicles from a fleet, efficient waste loading in vehicles and residents' satisfaction with timely pick up of the waste equipment from a household. Such system can be successfully applied even for large cities. The algorithm provides an opportunity for writing software or mobile apps design to be used by WEEE collection companies.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimizing lane reversals in transportation networks to reduce traffic congestion: A global optimization approach

This paper studies how to reduce the overall travel time of commuters in a transportation network by reversing the direction of some lanes in the network using a macroscopic network-wide perspective. Similar to the Network Design Problem, the lane reversal problem has been shown to be NP-hard given the dependence of the users’ route selection on the lane direction decision. Herein, we propose and compare three efficient methods to solve the routing and lane reversal problem jointly. First, we introduce an alternating method that decouples the routing and lane assignment problems. Second, we propose a Frank–Wolfe method that jointly takes gradient steps to adjust both the lane assignment and routing decisions. Third, we propose a convex approximation method that uses a threshold-based approach to convexify the joint routing and lane reversal objective. The convex approximation method is advantageous since it finds a global optimum solution for the approximated problem and it enables the possibility to include linear constraints. Using this method, we extend the main formulation to be able to limit a maximum number of reversed lanes, as well as to incorporate multiple origin–destination (OD) patterns. We test the proposed methods in a case study using the transportation network of Eastern Massachusetts where our results indicate an overall reduction in travel times of 4.7% by selecting the best 15 reversals. Moreover, using a small test network, we investigate the performance of the lane reversal strategies as a function of the OD demand symmetry. As expected, we observe that when the OD demand is very asymmetric (e.g., for a single OD pair, evacuations, large events), the reduction in travel times is larger than the symmetric case, reaching travel time reductions of 60%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Predicting Solar-Cell Dyes for Cosensitization

A major limitation of using organic dyes for dye-sensitized solar cells (DSCs) has been their lack of broad optical absorption. Co-sensitization, in which two complementary dyes are incorporated into a DSC, offers a route to combat this problem. Here we construct and implement a design route for materials discovery of new dyes for co-sensitization, beginning with a chemically compatible series of existing laser dyes which are without an anchor group necessary for DSC use. We determine the crystal structures for this dye series, and use their geometries to establish the DSC molecular design prerequisites aided by density-functional theory and time-dependent density-functional theory calculations. Based on insights gained from these existing dyes, modified sensitizers are computationally designed to include a suitable anchor group. A DSC co-sensitization strategy for these modified sensitizers is predicted, using the central features of highest-occupied, and lowest-unoccupied molecular orbital positioning, optical absorption properties, intramolecular charge-transfer characteristics, and steric effects as selection criteria. Through this molecular engineering of a series of existing non-DSC dyes, we predict new materials for DSC co-sensitization.

14 SOLAR ENERGY↗

Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong

We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.

42 ENGINEERING↗

Correlated Noise Estimation with Quantum Sensor Networks

We address the metrological problem of estimating collective stochastic properties imprinted on a network of quantum sensors. Canonical examples include center-of-mass quadrature fluctuations in a system of bosonic modes and correlated dephasing in an ensemble of qubits (e.g., spins), bosons, or fermions. We develop a theoretical framework to determine the limits of correlated (weak) noise estimation with quantum sensor networks and reveal the requirements for entanglement advantage. Notably, an advantage emerges from the synergistic interplay between quantum correlations of the sensors and “classical” correlations of the noises. Here, we determine optimal entangled probe states and identify a sensing protocol—reminiscent of a many-body echo—that achieves the fundamental limits of measurement sensitivity for a broad class of problems, unveiling a route toward entanglement-enhanced metrology of correlated many-body phenomena.

Quantum metrology↗

Multi-Resolution UAV Path Replanning for Inspection of Tailings Dams

Autonomous inspection of large and complex structures with a commercial unmanned aerial vehicle (UAV) is a challenging problem that has been addressed in recent years. In this paper, we address the global motion planning problem of creating autonomous inspection missions for UAVs considering photogrammetry constraints. We focus on the inspection of large tailings dams, which are dam structures used to store waste byproducts of mining. Our method uses a prior sparse point cloud of the dam to generate a voxel grid, where paths satisfying photogrammetry constraints are tested for collisions. We then apply the A* algorithm as a local planner to avoid obstacles within the global mission. Moreover, we address the problem of changing routes online by using octree-based multi-resolution grids for efficient and fast pathfinding. Our results, obtained using tridimensional maps of an actual coal mine tailings dam, show that using octrees for multi-resolution motion planning is faster than using a fixed voxel grid in online missions while inspecting large structures.

42 ENGINEERING↗

Dendrite-Free Potassium–Oxygen Battery Based on a Liquid Alloy Anode

The safety issue caused by the dendrite growth is not only a key research problem in lithium-ion batteries but also a critical concern in alkali metal (i.e., Li, Na, and K) oxygen batteries where a solid metal is usually used as the anode. Herein, we demonstrate the first dendrite-free K-O-2 battery at ambient temperature based on a liquid Na K alloy anode. The unique liquid liquid connection between the liquid alloy and the electrolyte in our alloy anode-based battery provides a homogeneous and robust anode electrolyte interface. Meanwhile, we manage to show that the Na K alloy is only compatible in K-O-2 batteries but not in Na-O-2 batteries, which is mainly attributed to the stronger reducibility of potassium and relatively more favorable thermodynamic formation of KO, over NaO2 during the discharge process. It is observed that our K-O-2 battery based on a liquid alloy anode shows a long cycle life (over 620 h) and a low discharge charge overpotential (about 0.05 V at initial cycles). Moreover, the mechanism investigation into the K-O-2 cell degradation shows that the 02 crossover effect and the ether electrolyte instability are the critical problems for K-O-2 batteries. In a word, this study provides a new route to solve the problems caused by the dendrite growth in alkali metal oxygen batteries.

36 MATERIALS SCIENCE↗

PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks

The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.

Applied Computing, Transportation↗

Degenerate Hamiltonian operator in higher-order canonical gravity — The problem and a remedy

Different routes towards canonical formulation of a classical theory result in different canonically equivalent Hamiltonians, while their quantum counterparts are related through appropriate unitary transformation. However, for higher-order theory of gravity although two Hamiltonians emerging from the same action differing by total derivative terms are related through canonical transformation, the difference transpires while attempting canonical quantization, which is predominant in non-minimally coupled higher-order theory of gravity. We follow Dirac’s constraint analysis to formulate phase-space structures, in the presence (case-I) and absence (case-II) of total derivative terms. While the coupling parameter plays no significant role as such for case-I, quantization depends on its form explicitly in case-II, and as a result unitary transformation relating the two is not unique. We also find certain mathematical inconsistencies in case-I, for modified Gauss–Bonnet-Dilatonic coupled action, in particular. Thus, we conclude that total derivative terms indeed play a major role in the quantum domain and should be taken care of a-priori, for consistency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pitfalls in the n -mode representation of vibrational potentials

Simulations of anharmonic vibrational motion rely on computationally expedient representations of the governing potential energy surface. The n-mode representation (n-MR)—effectively a many-body expansion in the space of molecular vibrations—is a general and efficient approach that is often used for this purpose in vibrational self-consistent field (VSCF) calculations and correlated analogues thereof. In the present analysis, a lack of convergence in many VSCF calculations is shown to originate from negative and unbound potentials at truncated orders of the n-MR expansion. For cases of strong anharmonic coupling between modes, the n-MR can both dip below the true global minimum of the potential surface and lead to effective single-mode potentials in VSCF that do not correspond to bound vibrational problems, even for bound total potentials. The present analysis serves mainly as a pathology report of this issue. Furthermore, this insight into the origin of VSCF non-convergence provides a simple, albeit ad hoc, route to correct the problem by “painting in” the full representation of groups of modes that exhibit these negative potentials at little additional computational cost. Somewhat surprisingly, this approach also reasonably approximates the results of the next-higher n-MR order and identifies groups of modes with particularly strong coupling. The method is shown to identify and correct problematic triples of modes—and restore SCF convergence—in two-mode representations of challenging test systems, including the water dimer and trimer, as well as protonated tropine.

Chemistry↗

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Devulapalli, Dhruv (ORCID:000000022612308X)↗