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 73 records · Page 4

Switched Systems and Motion Coordination: Combinatorial Challenges

Problems of routing commercial air traffic in a terminal airspace encounter different constraints: separation assurance, aircraft performance limitations, regulations. The general setting of these problems is that of a switched control system. Such a system combines the differentiable motion of the aircraft with the combinatorial choices of choosing precedence when traffic routes merge and choosing branches when the routes diverge. This presentation gives an overview of the problem, the ATM context, related literature, and directions for future research.

terminal airspace↗

Scheduling of an aircraft fleet

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

Paltrinieri, Massimo↗

Coordinated Platoon Routing in a Metropolitan Network

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

Larson, Jeffrey↗

Vehicle routing for the last mile of power system restoration

This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Delay Tolerant Network Routing as a Machine Learning Classification Problem

This paper discusses a machine learning-based approach to routing for delay tolerant networks (DTNs) [1]. DTNs are networks which experience frequent disconnections between nodes, uncertainty of an end-to-end path, long one-way trip times, and may have high error rates and asymmetric links. Such networks exist in deep space satellite networks, very rural environments, disaster areas and underwater environments. In this work, we use machine learning classifiers to predict a set of neighboring nodes which are the most likely to deliver a message to a desired location based on message history delivery information.We use the Common Open Research Emulator (CORE) [2] to emulate the DTN environment based on real-world location traces and collect network traffic statistics from the Bundle Protocol implementation IBR-DTN [3]. The software architecture for classification-based routing, analysis and preparation of the network history data and prediction results are discussed.

Delay Tolerant Networks↗

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↗

Analog Processor To Solve Optimization Problems

Proposed analog processor solves "traveling-salesman" problem, considered paradigm of global-optimization problems involving routing or allocation of resources. Includes electronic neural network and auxiliary circuitry based partly on concepts described in "Neural-Network Processor Would Allocate Resources" (NPO-17781) and "Neural Network Solves 'Traveling-Salesman' Problem" (NPO-17807). Processor based on highly parallel computing solves problem in significantly less time.

Duong, Tuan A.↗

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↗

Contactless conductivity detector for microchip capillary electrophoresis

A microfabricated electrophoresis chip with an integrated contactless conductivity detection system is described. The new contactless conductivity microchip detector is based on placing two planar sensing aluminum film electrodes on the outer side of a poly(methyl methacrylate) (PMMA) microchip (without contacting the solution) and measuring the impedance of the solution in the separation channel. The contactless route obviates problems (e.g., fouling, unwanted reactions) associated with the electrode-solution contact, offers isolation of the detection system from high separation fields, does not compromise the separation efficiency, and greatly simplifies the detector fabrication. Relevant experimental variables, such as the frequency and amplitude of the applied ac voltage or the separation voltage, were examined and optimized. The detector performance was illustrated by the separation of potassium, sodium, barium, and lithium cations and the chloride, sulfate, fluoride, acetate, and phosphate anions. The response was linear (over the 20 microM-7 mM range) and reproducible (RSD = 3.4-4.9%; n = 10), with detection limits of 2.8 and 6.4 microM (for potassium and chloride, respectively). The advantages associated with the contactless conductivity detection, along with the low cost of the integrated PMMA chip/detection system, should enhance the power and scope of microfluidic analytical devices.

NASA Center JPL↗

Design of a cooperative problem-solving system for en-route flight planning: An empirical evaluation

Both optimization techniques and expert systems technologies are popular approaches for developing tools to assist in complex problem-solving tasks. Because of the underlying complexity of many such tasks, however, the models of the world implicitly or explicitly embedded in such tools are often incomplete and the problem-solving methods fallible. The result can be 'brittleness' in situations that were not anticipated by the system designers. To deal with this weakness, it has been suggested that 'cooperative' rather than 'automated' problem-solving systems be designed. Such cooperative systems are proposed to explicitly enhance the collaboration of the person (or a group of people) and the computer system. This study evaluates the impact of alternative design concepts on the performance of 30 airline pilots interacting with such a cooperative system designed to support en-route flight planning. The results clearly demonstrate that different system design concepts can strongly influence the cognitive processes and resultant performances of users. Based on think-aloud protocols, cognitive models are proposed to account for how features of the computer system interacted with specific types of scenarios to influence exploration and decision making by the pilots. The results are then used to develop recommendations for guiding the design of cooperative systems.

Layton, Charles↗

Design of a cooperative problem-solving system for en-route flight planning: An empirical evaluation

Both optimization techniques and expert systems technologies are popular approaches for developing tools to assist in complex problem-solving tasks. Because of the underlying complexity of many such tasks, however, the models of the world implicitly or explicitly embedded in such tools are often incomplete and the problem-solving methods fallible. The result can be 'brittleness' in situations that were not anticipated by the system designers. To deal with this weakness, it has been suggested that 'cooperative' rather than 'automated' problem-solving systems be designed. Such cooperative systems are proposed to explicitly enhance the collaboration of the person (or a group of people) and the computer system. This study evaluates the impact of alternative design concepts on the performance of 30 airline pilots interacting with such a cooperative system designed to support enroute flight planning. The results clearly demonstrate that different system design concepts can strongly influence the cognitive processes and resultant performances of users. Based on think-aloud protocols, cognitive models are proposed to account for how features of the computer system interacted with specific types of scenarios to influence exploration and decision making by the pilots. The results are then used to develop recommendations for guiding the design of cooperative systems.

Layton, Charles↗

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↗

A Formal Algorithm for Routing Traces on a Printed Circuit Board

This paper addresses the classical problem of printed circuit board routing: that is, the problem of automatic routing by a computer other than by brute force that causes the execution time to grow exponentially as a function of the complexity. Most of the present solutions are either inexpensive but not efficient and fast, or efficient and fast but very costly. Many solutions are proprietary, so not much is written or known about the actual algorithms upon which these solutions are based. This paper presents a formal algorithm for routing traces on a print- ed circuit board. The solution presented is very fast and efficient and for the first time speaks to the question eloquently by way of symbolic statements.

Hedgley, David R., Jr.↗

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↗