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.
Quantum computing for a profusion of postman problem variants
In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.
Toward computing bounds for Ramsey numbers using quantum annealing
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems, such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum annealing as a tool for use in exploring combinatorial mathematics research problems. We consider the monochromatic triangle problem and the Ramsey number problem, both examples of graph coloring. Conversion to quadratic unconstrained binary optimization (QUBO) form is required to run on quantum hardware. While the monochromatic triangle problem is quadratic by nature, the Ramsey number problem requires the use of order reduction methods for a quadratic formulation. The goal is to provide a method for producing special colorings of graphs which if successful would provide lower bounds for certain Ramsey numbers. We discuss implementations, limitations, and results when running on the D-Wave Advantage quantum annealer.
AutonomieAI: An efficient and deployable vehicle energy consumption estimation toolkit
Here, this paper presents AutonomieAI, a novel toolkit designed for efficient energy estimation of vehicles across diverse trip scenarios, routes, and drive cycles, applicable to a broad range of vehicle powertrain technologies. It leverages state-of-the-art Machine Learning techniques to deliver real-time energy prediction of vehicles, enabling co-simulation with transportation level system tools and opening doors for large-scale optimization at city, network or national level. Benchmark results show that AutonomieAI achieves high accuracy, with an average percentage error below 2% for most powertrain types, and computational efficiency capable of processing over 10,000 trips per second. Applications of AutonomieAI have potential to offer the flexibility to assist in solving eco-routing problems, optimize for vehicle and powertrain selection, study charging decision behavior, and optimize for charging station placement. AutonomieAI is the result of large neural network based model architectures, trained on very large and unique high fidelity vehicle simulation data. It is lightweight, deployable, efficient and has accuracy comparable to specialized and complex physics based simulation softwares.
Using Mobile Charging Drones to Mitigate Battery Disruptions of Electric Vehicles on Highways
Our research explores innovative solutions to address the challenge of battery disruptions in electric vehicles (EVs) on highways. We propose a centralized fleet ownership model where a company manages a fleet of Mobile Charging Drones (MCDs) guided by a k-VRP (Vehicle Routing Problem) framework. This model is designed to tackle a multi-objective optimization issue with three primary goals: reduction of the overall operating costs, decrease in the cumulative waiting time, and minimization of the combined operating costs and waiting times. This approach extends beyond the usual VRP constraints, encompassing specific limitations for both MCDs and disrupted EVs (DEVs). Additionally, our study delves into the concept of decentralized fleet ownership through the lens of crowdsourcing. Preliminary numerical analyses indicate that the capital cost of MCDs is a significant factor on the charging service, and the system performance is sensitive to DEV owner's value of time (VOT) when VOTs are relatively low.
Deploying Mobility-On-Demand for All by Optimizing Paratransit Services
While on-demand ride-sharing services have become popular in recent years, traditional on-demand transit services cannot be used by everyone, e.g., people who use wheelchairs. Paratransit services, operated by public transit agencies, are a critical infrastructure that offers door-to-door transportation assistance for individuals who face challenges in using standard transit routes. However, with declining ridership and mounting financial pressure, public transit agencies in the USA struggle to operate existing services. We collaborate with a public transit agency from the southern USA, highlight the specific nuances of paratransit optimization, and present a vehicle routing problem formulation for optimizing paratransit. We validate our approach using real-world data from the transit agency, present results from an actual pilot deployment of the proposed approach in the city, and show how the proposed approach comprehensively outperforms existing approaches used by the transit agency. To the best of our knowledge, this work presents one of the first examples of using open-source algorithmic approaches for paratransit optimization.
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.
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.
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.
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.
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.
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.
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.
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.
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.
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
Interplay between multipolar order and multipole-induced superconductivity in PrTi 2 Al 20
Multipolar moments entail a new route to tackle frontier problems in superconductivity (SC). A key progress in the search for multipolar SC is the discovery of PrTr 2 Al 20 (Tr = Ti, V), which possesses quadrupolar and octupolar but no magnetic dipolar moments. The Kondo entanglement of these multipolar moments with conduction electrons leads to exotic SC within the multipolar ordered phase, though the precise nature of the SC remains unexplored. We experimentally investigate the SC gap structure of SC in PrTi 2 Al 20 and its La-doping evolution. Our results indicate deviations from a single s-wave gap, instead favoring nodal d-wave or multiple gaps. While the SC is robust against La dilution, the SC gap structure changes with minimal La doping, coinciding with a sharp change in the ferroquadrupolar (FQ) order. This suggests an intimate link between the quadrupolar order parameter and SC pairing, providing insight into the coexistence of SC with multipolar order.
Significance and challenges in dissecting cancer-bacteriome interactions
Cancer is the leading cause of death around the world. While some types of cancer have become manageable due to advancements in medicine, most cancers still lack available cures and treatments. Recent studies have shown that changes in the human microbiome, especially in the bacteriome, are associated with some cancers. Certain bacterial strains have been reported to promote the initiation and progression of cancer in humans. Other studies have used sequencing to observe changes in the bacteriome of healthy and cancer patients. However, studies that investigate the interactions between cancer cells and the complex bacteriome as a whole remain scarce. This is due to the absence of experimental methods to study the interactions between cancer cells and complex bacterial populations, which has delayed the progress in identifying cancer-causing and cancer-inhibiting bacteria, and in understanding the bacterial interactions and their influence on host cells. Here, we review approaches to studying cancer cell interactions with complex bacteriomes and suggest possible routes to overcome this problem, highlighting the need for interdisciplinary studies that may help advance this field. We speculate that a good understanding of cancer-bacteriome interactions may open the door to new lines of holistic bacteriotherapy for cancer that is otherwise unavailable.