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 253 records · Page 14

Optimal Integration of Departures and Arrivals in Terminal Airspace

Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations - spatial, temporal, and hybrid separations - were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buffer, spatial separation outperformed temporal separation when the uncertainty buffer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buffer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buffer sizes.

terminal airspace↗

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗

A Review of Function Allocation and En Route Separation Assurance

Today's air traffic control system has reached a limit to the number of aircraft that can be safely managed at the same time. This air traffic capacity bottleneck is a critical problem along the path to modernization for air transportation. The design of the next separation assurance system to address this problem is a cornerstone of air traffic management research today. This report reviews recent work by NASA and others in the areas of function allocation and en route separation assurance. This includes: separation assurance algorithms and technology prototypes; concepts of operations and designs for advanced separation assurance systems; and specific investigations into air-ground and human-automation function allocation.

Lewis, Timothy A.↗

High-fraction brookite films from amorphous precursors

Structure-specific synthesis processes are of key importance to the growth of polymorphic functional compounds such as TiO 2 , where material properties strongly depend on structure as well as chemistry. The robust growth of the brookite polymorph of TiO 2 , a promising photocatalyst, has been difficult in both powder and thin-film forms due to the disparity of reported synthesis techniques, their highly specific nature, and lack of mechanistic understanding. In this work, we report the growth of high-fraction (~95%) brookite thin films prepared by annealing amorphous titania precursor films deposited by pulsed laser deposition. We characterize the crystallization process, eliminating the previously suggested roles of substrate templating and Na helper ions in driving brookite formation. Instead, we link phase selection directly to film thickness, offering a novel, generalizable route to brookite growth that does not rely on the presence of extraneous elements or particular lattice-matched substrates. In addition to providing a new synthesis route to brookite thin films, our results take a step towards resolving the problem of phase selection in TiO 2 growth, contributing to the further development of this promising functional material.

14 SOLAR ENERGY↗

Nanothermodynamics of large iron clusters by means of a flat histogram Monte Carlo method

The thermodynamics of iron clusters of various sizes, from 76 to 2452 atoms, typical of the catalyst particles used for carbon nanotubes growth, has been explored by a flat histogram Monte Carlo (MC) algorithm (called the σ-mapping), developed by Soudan et al. [J. Chem. Phys. 135, 144109 (2011), Paper I]. This method provides the classical density of states, g{sub p}(E{sub p}) in the configurational space, in terms of the potential energy of the system, with good and well controlled convergence properties, particularly in the melting phase transition zone which is of interest in this work. To describe the system, an iron potential has been implemented, called “corrected EAM” (cEAM), which approximates the MEAM potential of Lee et al. [Phys. Rev. B 64, 184102 (2001)] with an accuracy better than 3 meV/at, and a five times larger computational speed. The main simplification concerns the angular dependence of the potential, with a small impact on accuracy, while the screening coefficients S{sub ij} are exactly computed with a fast algorithm. With this potential, ergodic explorations of the clusters can be performed efficiently in a reasonable computing time, at least in the upper half of the solid zone and above. Problems of ergodicity exist in the lower half of the solid zone but routes to overcome them are discussed. The solid-liquid (melting) phase transition temperature T{sub m} is plotted in terms of the cluster atom number N{sub at}. The standard N{sub at}{sup −1/3} linear dependence (Pawlow law) is observed for N{sub at} >300, allowing an extrapolation up to the bulk metal at 1940 ±50 K. For N{sub at} <150, a strong divergence is observed compared to the Pawlow law. The melting transition, which begins at the surface, is stated by a Lindemann-Berry index and an atomic density analysis. Several new features are obtained for the thermodynamics of cEAM clusters, compared to the Rydberg pair potential clusters studied in Paper I.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evidence for Turbulent Concentration in Particle-Laden Midplane Layers of Planet-Forming Disks: Preliminary Findings

The formation of the first planetesimals during the first million years of the solar nebula remains a vexing problem. The Streaming Instability (SI) is the leading candidate mechanism that offers a route to form 100 km objects from mm-sized grains, but it appears to not be strongly active based on recent findings [1]. The idea of turbulent concentration offers a possible alternate route to forming these bodies. Is there evidence for this process in bonafide 3D disk models of particle-gas dynamics?

O M Umurhan↗

Multi-Commodity Traffic Signal Control and Routing With Connected Vehicles

We report a real-time traffic management policy that integrates traffic signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed policy is based on a multi-commodity formulation of the store-and-forward model and assumes all vehicles are able to exchange information with the infrastructure. Vehicles share information about their current location and final destination. Based on this information, the strategy determines both optimized signal timings at every intersection and vehicle-specific routing information at every link of the network. The control actions, i.e., signal times and routing information, are updated at every cycle and delivered by a finite horizon optimal control problem cast into a rolling horizon framework. The underlying optimization problem is convex, and thus the method is suitable for real-time operation in large networks. The method is validated via a micro-simulation study in networks with up to twenty intersections and, in all simulations, outperforms a real-time traffic-responsive signal control strategy that is based on a single-commodity store-and-forward model. The scalable computation effort for increasing network sizes and prediction horizon confirms the computational efficiency of the method.

42 ENGINEERING↗

Accelerating a fluvial incision and landscape evolution model with parallelism

Solving inverse problems, performing sensitivity analyses, and achieving statistical rigour in landscape evolution models require running many model realizations. Parallel computation is necessary to achieve this in a reasonable time. However, no previous landscape evolution algorithm is able to leverage modern parallelism. In this report, I describe an algorithm that can utilize the parallel potential of GPUs and many-core processors, in addition to working well in serial. The new algorithm runs 43× faster (70 s vs. 3000 s on a 10,000×10,000 input) than the previous state-of-the-art and exhibits sublinear scaling with input size. I also identify key techniques for multiple flow direction routing and quickly eliminating landscape depressions and local minima. Complete, well-commented, easily adaptable source code for all versions of the algorithm is available on Github and Zenodo.

58 GEOSCIENCES↗

Enhanced Thermal Stability and Magnetic Properties in NaCl-Type FePt-MnO Binary Nanocrystal Superlattices

We report the growth of NaCl-type binary nanocrystal (NC) superlattice membranes by coassembly of FePt and MnO NCs at the liquid-air interface. The constituent FePt NCs were converted into the hard magnetic L1(0) phase by thermal annealing at 650 degrees C without degradation of the long-range NC ordering. In contrast, both FePt-only NC superlattices and FePt-MnO disordered NC mixtures showed substantial FePt sintering under the same annealing conditions. Our results demonstrate that the incorporation of FePt NCs into binary superlattices can solve the problems of FePt sintering during conversion to the L1(0) phase, opening a new route to the fabrication of ordered ferromagnetic NC arrays on a desired substrate for high-density data storage applications.

Dong, AG↗

Structure and dynamics of H{sub 2}O vis-á-vis phenylalanine recognition at a DPPC lipid membrane via interfacial H-bond types: Insights from polarized FT-IRRAS and ADMP simulations

Preferential and enantioselective interactions of L-/D-Phenylalanine (L-Phe and D-Phe) and butoxycarbonyl-protected L-/D-Phenylalanine (LPA and DPA) as guest with 1,2-dipalmitoyl-sn-glycero-3-phosphocholine (L-DPPC) as host were tapped by using real time Fourier transform infrared reflection absorption spectroscopy (FT-IRRAS). Polarization-modulated FT-IRRAS of DPPC monolayers above the phenylalanine modified subphases depicted fine structure/conformation differences under considerations of controlled 2D surface pressure. Selective molecular recognition of D-enantiomer over L-enantiomer driven by the DPPC head group via H-bonding and electrostatic interactions was evident spectroscopically. Accordingly, binding constants (K) of 145, 346, 28, and 56 M{sup −1} for LPA, DPA, L-Phe, and D-Phe, respectively, were estimated. The real time FT-IRRAS water bands were strictly conformation sensitive. The effect of micro-solvation on the structure and stability of the 1:1 diastereomeric L-lipid⋯, LPA/DPA and L-lipid⋯, (L/D)-Phe adducts was investigated with the aid of Atom-centered Density Matrix Propagation (ADMP), a first principle quantum mechanical molecular dynamics approach. The phosphodiester fragment was the primary site of hydration where specific solvent interactions were simulated through single- and triple- “water-phosphate” interactions, as water cluster’s “tetrahedral dice” to a “trimeric motif” transformation as a partial de-clusterization was evident. Under all the hydration patterns considered in both static and dynamic descriptions of density functional theory, L-lipid/D-amino acid enantiomer adducts continued to be stable structures while in dynamic systems, water rearranged without getting “squeezed-out” in the process of recognition. In spite of the challenging computational realm of this multiscale problem, the ADMP simulated molecular interactions complying with polarized vibrational spectroscopy unraveled a novel route to chiral recognition and interfacial water structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Space physics analysis network node directory (The Yellow Pages): Fourth edition

The Space Physics Analysis Network (SPAN) is a component of the global DECnet Internet, which has over 17,000 host computers. The growth of SPAN from its implementation in 1981 to its present size of well over 2,500 registered SPAN host computers, has created a need for users to acquire timely information about the network through a central source. The SPAN Network Information Center (SPAN-NIC) an online facility managed by the National Space Science Data Center (NSSDC) was developed to meet this need for SPAN-wide information. The remote node descriptive information in this document is not currently contained in the SPAN-NIC database, but will be incorporated in the near future. Access to this information is also available to non-DECnet users over a variety of networks such as Telenet, the NASA Packet Switched System (NPSS), and the TCP/IP Internet. This publication serves as the Yellow Pages for SPAN node information. The document also provides key information concerning other computer networks connected to SPAN, nodes associated with each SPAN routing center, science discipline nodes, contacts for primary SPAN nodes, and SPAN reference information. A section on DECnet Internetworking discusses SPAN connections with other wide-area DECnet networks (many with thousands of nodes each). Another section lists node names and their disciplines, countries, and institutions in the SPAN Network Information Center Online Data Base System. All remote sites connected to US-SPAN and European-SPAN (E-SPAN) are indexed. Also provided is information on the SPAN tail circuits, i.e., those remote nodes connected directly to a SPAN routing center, which is the local point of contact for resolving SPAN-related problems. Reference material is included for those who wish to know more about SPAN. Because of the rapid growth of SPAN, the SPAN Yellow Pages is reissued periodically.

Peters, David J.↗

Flight Demonstration of the Tailored Arrival Manager

A flight demonstration of arrival traffic management automation was conducted in partnership between NASA, FAA and Boeing as an element of the latter’s ecoDemonstrator2020 flight program. For the demonstration, NASA’s prototype Tailored Arrival Manager(TAM) was used to compute efficient trajectory-based solutions to traffic management problems representing those encountered during time-based metering operations today. TAM solutions involving route modifications were uplinked to a Boeing 787 airplane using Controller Pilot Data Link Communications and seamlessly loaded into the airplane’s Flight Management System (FMS). The paper describes the concept and technology behind TAM along with the data exchanges and procedures involved with the demonstration. All TAM solutions were delivered in a timely manner and successfully integrated with the airplane’s FMS, thereby demonstrating the basic feasibility of trajectory-based arrival management using currently available data communications and avionics equipage. Although TAM solutions were not executed during this initial demonstration, a limited study of trajectory prediction accuracy was possible given that the airplane flew uninterrupted, automated descents with known route and speed intent. Analysis revealed that TAM meter-fix arrival time predictions were accurate to within ± 30 seconds for time horizons of 30 minutes or less, which matched closely with FMS predictions acquired through real-time data exchange. Top-of-descent predictions over similar time horizons were found accurate to within ± 5 nautical miles.

air traffic management↗

Flight Demonstration of the Tailored Arrival Manager

A flight demonstration of arrival traffic management automation was conducted in partnership between NASA, FAA and Boeing as an element of the latter’s ecoDemonstrator2020 flight program. For the demonstration, NASA’s prototype Tailored Arrival Manager(TAM) was used to compute efficient trajectory-based solutions to traffic management problems representing those encountered during time-based metering operations today. TAM solutions involving route modifications were uplinked to a Boeing 787 airplane using Controller Pilot Data Link Communications and seamlessly loaded into the airplane’s Flight Management System (FMS). The paper describes the concept and technology behind TAM along with the data exchanges and procedures involved with the demonstration. All TAM solutions were delivered in a timely manner and successfully integrated with the airplane’s FMS, thereby demonstrating the basic feasibility of trajectory-based arrival management using currently available data communications and avionics equipage. Although TAM solutions were not executed during this initial demonstration, a limited study of trajectory prediction accuracy was possible given that the airplane flew uninterrupted, automated descents with known route and speed intent. Analysis revealed that TAM meter-fix arrival time predictions were accurate to within ± 30 seconds for time horizons of 30 minutes or less, which matched closely with FMS predictions acquired through real-time data exchange. Top-of-descent predictions over similar time horizons were found accurate to within ± 5 nautical miles.

Air traffic managment↗

Symmetric Random Butterfly Transform (SRBT) Based Preconditioner

Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.

interior point optimization↗

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

The route to chaos for the Kuramoto-Sivashinsky equation

The results of extensive numerical experiments of the spatially periodic initial value problem for the Kuramoto-Sivashinsky equation. This paper is concerned with the asymptotic nonlinear dynamics at the dissipation parameter decreases and spatio-temporal chaos sets in. To this end the initial condition is taken to be the same for all numerical experiments (a single sine wave is used) and the large time evolution of the system is followed numerically. Numerous computations were performed to establish the existence of windows, in parameter space, in which the solution has the following characteristics as the viscosity is decreased: a steady fully modal attractor to a steady bimodal attractor to another steady fully modal attractor to a steady trimodal attractor to a periodic attractor, to another steady fully modal attractor, to another periodic attractor, to a steady tetramodal attractor, to another periodic attractor having a full sequence of period-doublings (in parameter space) to chaos. Numerous solutions are presented which provide conclusive evidence of the period-doubling cascades which precede chaos for this infinite-dimensional dynamical system. These results permit a computation of the length of subwindows which in turn provide an estimate for their successive ratios as the cascade develops. A calculation based on the numerical results is also presented to show that the period doubling sequences found here for the Kuramoto-Sivashinsky equation, are in complete agreement with Feigenbaum's universal constant of 4,669201609... . Some preliminary work shows several other windows following the first chaotic one including periodic, chaotic, and a steady octamodal window; however, the windows shrink significantly in size to enable concrete quantitative conclusions to be made.

Papageorgiou, Demetrios T.↗

The route to chaos for the Kuramoto-Sivashinsky equation

The results of extensive numerical experiments of the spatially periodic initial value problem for the Kuramoto-Sivashinsky equation. This paper is concerned with the asymptotic nonlinear dynamics at the dissipation parameter decreases and spatio-temporal chaos sets in. To this end the initial condition is taken to be the same for all numerical experiments (a single sine wave is used) and the large time evolution of the system is followed numerically. Numerous computations were performed to establish the existence of windows, in parameter space, in which the solution has the following characteristics as the viscosity is decreased: a steady fully modal attractor to a steady bimodal attractor to another steady fully modal attractor to a steady trimodal attractor to a periodic attractor, to another steady fully modal attractor, to another periodic attractor, to a steady tetramodal attractor, to another periodic attractor having a full sequence of period-doublings (in parameter space) to chaos. Numerous solutions are presented which provide conclusive evidence of the period-doubling cascades which precede chaos for this infinite-dimensional dynamical system. These results permit a computation of the length of subwindows which in turn provide an estimate for their successive ratios as the cascade develops. A calculation based on the numerical results is also presented to show that the period doubling sequences found here for the Kuramoto-Sivashinsky equation, are in complete agreement with Feigenbaum's universal constant of 4,669201609 .... Some preliminary work shows several other windows following the first chaotic one including periodic, chaotic, and a steady octamodal window; however, the windows shrink significantly in size to enable concrete quantitative conclusions to be made.

Papageorgiou, Demetrios T.↗

Optimizing Flight Departure Delay and Route Selection Under En Route Convective Weather

This paper presents a linear Integer Programming model for managing air traffic flow in the United States. The decision variables in the model are departure delays and predeparture reroutes of aircraft whose trajectories are predicted to cross weather-impacted regions of the National Airspace System. The model assigns delays to a set of flights while ensuring their trajectories are free of any conflicts with weather. In a deterministic setting, there is no airborne holding due to unexpected weather incursion in a flight s path. The model is applied to solve a large-scale traffic flow management problem with realistic weather data and flight schedules. Experimental results indicate that allowing rerouting can reduce departure delays by nearly 57%, but it is associated with an increase in total airborne time due to longer routes flown by aircraft. The computation times to solve this problem were significantly lower than those reported in the earlier studies.

Mukherjee, Avijit↗