Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “heuristic”

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 577 records · Page 32

High-Throughput Microstructural Characterization and Process Correlation Using Automated Electron Backscatter Diffraction

The need to optimize the processing conditions of additively manufactured (AM) metals and alloys has driven advances in throughput capabilities for material property measurements such as tensile strength or hardness. High-throughput (HT) characterization of AM metal microstructure has fallen significantly behind the pace of property measurements due to intrinsic bottlenecks associated with the artisan and labor-intensive preparation methods required to produce highly polished surfaces. This inequality in data throughput has led to a reliance on heuristics to connect process to structure or structure to properties for AM structural materials. In this study, we show a transformative approach to achieve laser powder bed fusion (LPBF) printing, HT preparation using dry electropolishing and HT electron backscatter diffraction (EBSD). This approach was used to construct a library of > 600 experimental EBSD sample sets spanning a diverse range of LPBF process conditions for AM Kovar. This vast library is far more expansive in parameter space than most state-of-the-art studies, yet it required only approximately 10 labor hours to acquire. Build geometries, surface preparation methods, and microscopy details, as well as the entire library of >600 EBSD data sets over the two sample design versions, have been shared with intent for the materials community to leverage the data and further advance the approach. Using this library, we investigated process–structure relationships and uncovered an unexpected, strong dependence of microstructure on location within the build, when varied, using otherwise identical laser parameters.

Characterization and Analytical Technique↗

Evolutionary computation algorithms to coordinating order acceptance and batch delivery for an integrated supply chain scheduling

This paper proposes a novel approach of coordinating decisions in an integrated supply chain (ISC): coordinating order acceptance (OA) and batch delivery (BD) due to round trip transportation (RTT) and using third-party logistics (3PL) vehicles. The paper aims at trading off among accepted orders revenue, delivery costs as well as any penalties incurred in the ISC to maximize the total benefit. A novel mixed-integer programming is proposed for the problem. In addition, the paper provides a heuristic to form batches and develops a hybrid evolutionary computation algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA) to solve the problem. An information sharing mechanism is improved and applied. To explore and to locate the proposed PSO in a better neighborhood, a local search is proposed. Taguchi experimental design is utilized to set the appropriate values of the algorithms’ parameters and random instances are generated to evaluate the performance of the algorithms. The paper investigates the profitability sensitivity of the problem to parameters and analyzes the effect of the changes in the parameters on the performance of our proposed algorithms. The attained results show the appropriate performance of our algorithms.

97 MATHEMATICS AND COMPUTING↗

An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm.

97 MATHEMATICS AND COMPUTING↗

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↗

Combining shallow-water and analytical wake models for tidal array micro-siting

For tidal-stream energy to become a competitive renewable energy source, clustering multiple turbines into arrays is paramount. Array optimisation is thus critical for achieving maximum power performance and reducing cost of energy. However, ascertaining an optimal array layout is a complex problem, subject to specific site hydrodynamics and multiple inter-disciplinary constraints. In this work, we present a novel optimisation approach that combines an analytical-based wake model, FLORIS, with an ocean model, Thetis. The approach is demonstrated through applications of increasing complexity. By utilising the method of analytical wake superposition, the addition or alteration of turbine position does not require re-calculation of the entire flow field, thus allowing the use of simple heuristic techniques to perform optimisation at a fraction of the computational cost of more sophisticated methods. Using a custom condition-based placement algorithm, this methodology is applied to the Pentland Firth for arrays with turbines of 3.05 m/s rated speed, demonstrating practical implications whilst considering the temporal variability of the tide. For a 24-turbine array case, micro-siting using this technique delivered an array 15.8% more productive on average than a staggered layout, despite flow speeds regularly exceeding the rated value. Performance was evaluated through assessment of the optimised layout within the ocean model that treats turbines through a discrete turbine representation. Used iteratively, this methodology could deliver improved array configurations in a manner that accounts for local hydrodynamic effects.

16 TIDAL AND WAVE POWER↗

Allocating limited deicing resources in winter snow events

As the number and severity of snowfall events continue to grow, the need to direct road maintenance intelligently during these snowfall events will also grow. In several locations, local governments lack the resources to treat all roadways completely during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming (MIP) formulation to allocate resources to manage snowfall on roads using meteorological, geographical, and environmental parameters. Furthermore, given that MIPs often scale poorly with problem size, we also present a constructive heuristic designed for the problem. Finally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.

97 MATHEMATICS AND COMPUTING↗

Quasilinear theory: the lost ponderomotive effects and why they matter

Quasilinear theory (QLT) has been used for modeling wave–plasma interactions for decades but remains largely heuristic. Plasma inhomogeneity, ponderomotive effects, microscopic fluctuations, and collisions are not easily accommodated from first principles in QLT, and typically are ignored entirely, due to the limitations of the standard Fourier–Laplace global-mode approach. This results in inconsistencies, for example, violation of the action conservation for nonresonant waves. However, these issues can be avoided, and the theory can be substantially generalized and corrected, if QLT is formulated using more suitable analytical tools, particularly, the Weyl symbol calculus. Here, an attempt is made to deliver an accessible review of this modern formulation, provide intuitive calculations for special cases, and elaborate on the connection with the ‘oscillation-center QLT’ originally proposed by Dewar (Phys Fluids 16:1102, 1973). A Fokker–Planck equation for a ‘dressed’ distribution is derived from the Klimontovich equation and captures quasilinear diffusion, ponderomotive forces, and interactions with background fields for a generic Hamiltonian, so many known formulations of QLT for specific plasma models become corollaries of a single unifying theory. Also, waves are allowed to be off-shell (not constrained by a dispersion relation), which allows them to accommodate microscopic fluctuations. This leads to a collision integral of the Balescu–Lenard type that has all the usual properties but is not restricted to any specific plasma model. For on-shell waves, a generalized version of the classic oscillation-center QLT is obtained. Finally, combined with the wave-kinetic equation, this formulation not only conserves particles, momentum, and energy, like the classic QLT but also reinstates the action conservation for nonresonant waves.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗

A data-centric weak supervised learning for highway traffic incident detection

Using the data from loop detector sensors for near-real-time detection of traffic incidents on highways is crucial to averting major traffic congestion. While recent supervised machine learning methods offer solutions to incident detection by leveraging human-labeled incident data, the false alarm rate is often too high to be used in practice. Specifically, the inconsistency in the human labeling of the incidents significantly affects the performance of supervised learning models. To that end, we focus on a data-centric approach to improve the accuracy and reduce the false alarm rate of traffic incident detection on highways. We develop a weak supervised learning workflow to generate high-quality training labels for the incident data without the ground truth labels, and we use those generated labels in the supervised learning setup for final detection. This approach comprises three stages. First, we introduce a data preprocessing and curation pipeline that processes traffic sensor data to generate high-quality training data through leveraging labeling functions, which can be domain knowledge-related or simple heuristic rules. Second, we evaluate the training data generated by weak supervision using three supervised learning models-random forest, k-nearest neighbors, and a support vector machine ensemble-and long short-term memory classifiers. The results show that the accuracy of all of the models improves significantly after using the training data generated by weak supervision. Third, we develop an online real-time incident detection approach that leverages the model ensemble and the uncertainty quantification while detecting incidents. Finally, we show that our proposed weak supervised learning workflow achieves a high incident detection rate (0.90) and low false alarm rate (0.08).

97 MATHEMATICS AND COMPUTING↗

NASA analysis of space mission options for the 2025 planetary defense conference hypothetical asteroid impact threat scenario

The 2025 Planetary Defense Conference (PDC) hypothetical asteroid impact threat exercise is being conducted in coordination with the United Nations-endorsed Space Mission Planning Advisory Group (SMPAG), exercising SMPAG's processes for assessing space mission options and communicating to decision makers. Here, in this paper, we describe the work performed by our NASA-led team and present the results we contributed to the SMPAG effort for the exercise. Our NASA-led team assessed mission options for asteroid reconnaissance (flyby and rendezvous), deflection, and robust disruption using several viable techniques: kinetic impactors, ion beam deflection, and nuclear explosive devices. Our simulations and analyses considered how much change-in-velocity an asteroid can tolerate before fragmentation onset, and we worked towards establishing requirements for robustly disrupting an asteroid. Heuristics informed by the simulation results are incorporated into optimization of deflection and disruption mission campaign options. Finally, we make some observations about useful generalizations from these results with potential applicability to any planetary defense scenario.

Asteroid deflection↗

Segregation-induced changes in grain boundary cohesion and embrittlement in binary alloys

Grain boundary embrittlement occurs when a solute enriches at a grain boundary and lowers its cohesive energy. While grain boundary enrichment is usually attributed to equilibrium segregation effects, most models of embrittlement consider either the energetics of decohesion or the equilibrium adsorption at the boundary, but not both phenomena together. We develop an approach for the change in cohesive energy of a grain boundary of a pure metal upon introduction of solute under conditions of equilibrium segregation prior to fracture. A heuristic grain boundary cohesion map is presented to delineate whether a given solute–solvent pair will exhibit weakening or strengthening of grain boundaries. The analysis helps to clarify that grain boundary embrittlement necessitates a solute that will both lower the cohesive energy of the boundary and segregate in the first place. The map reasonably captures known metal–metal embrittling pairs.

36 MATERIALS SCIENCE↗

Sensor impacts on building and HVAC controls: A critical review for building energy performance

Building operations rely heavily on control systems and sensors. This paper provides a sophisticated literature review on sensor systems in building/HVAC systems, particularly in the context of controls, and their impacts on energy efficiency and thermal comfort. This study aims to understand the previous and current research and identify future research opportunities on this subject. The reviewed sensor systems were used for heuristic rule-based controls, local controls, and advanced optimal controls for existing and emerging technologies. Five major aspects of sensors are reviewed here: control loops for sensors, sensor types, sensor locations, sensor data, and a sensor impact evaluation framework. To augment the literature review, comprehensive standardized interviews were also conducted with relevant industry experts and practitioners. These interviews were designed and performed to (1) identify significant factors for selecting sensor sets and current undergoing issues, (2) identify potential improvements in sensor configuration/deployment, and (3) integrate expert (e.g., researcher, building operation practitioner) knowledge and experiences to develop structured use-case scenarios. Researchers collected and analyzed 31 interview responses for this paper.

Building control↗

Revisiting the definition of field capacity as a functional parameter in a layered agronomic soil profile beneath irrigated maize

The soil water content at the condition of field capacity (θ FC ) is a key parameter in irrigation scheduling and has been suggested to be determined by running a synthetic drainage experiment until the flux rate (q) at the bottom of the soil profile achieves a predefined negligible value (q FC ). We question the impact of q FC on the assessment of field capacity. Moreover, calculating θ FC as the integral mean of the water content profile when q is equal to q FC is strictly valid only for uniform soil profiles. By contrast, this practice is ambiguous and biased for stratified soil profiles due to the soil water content discontinuity at the layer interfaces. In this study, the concept of field capacity was revisited and adapted to practical agronomic heuristics. By resorting to the assessment of root-zone water storage capacity (W), we envision field capacity as a functional hydraulic parameter derived from synthetic irrigation scheduling scenarios to minimize drought stress, drainage, and nitrate leachate below the root zone. A functional analysis was carried out on a 135-cm-thick layered soil profile beneath maize in eastern Nebraska. On-farm irrigation scheduling applications and agricultural practices were recorded for 20 years (2001–2020) at a daily time step. Hydrus-1D was calibrated and validated with direct measurements of the soil water retention curve and soil water content data, respectively, in each soil layer. A set of functional field capacity values was derived from 24 irrigation scheduling scenarios, and the optimal water storage capacity at field capacity (W FC ) was approximately 50 cm (corresponding to about 80% saturation in the soil profile). An average irrigation amount of 217.5 mm distributed over 21 events was obtained by using optimal irrigation scheduling, which was initiated when the matric pressure head took on a value of –700 cm and the irrigation rate was set at 1.0 cm d –1 . This irrigation practice ensured water storage at approximately the same level (ideally at W FC ) by sustaining only evapotranspiration fluxes in the uppermost portion of the root zone and by limiting excessive drainage. This protocol can be transferred to other agricultural fields.

54 ENVIRONMENTAL SCIENCES↗

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Quantum Graphical Models and Belief Propagation

Belief Propagation algorithms acting on Graphical Models of classical probability distributions, such as Markov Networks, Factor Graphs and Bayesian Networks, are amongst the most powerful known methods for deriving probabilistic inferences amongst large numbers of random variables. This paper presents a generalization of these concepts and methods to the quantum case, based on the idea that quantum theory can be thought of as a noncommutative, operator-valued, generalization of classical probability theory. Some novel characterizations of quantum conditional independence are derived, and definitions of Quantum n-Bifactor Networks, Markov Networks, Factor Graphs and Bayesian Networks are proposed. The structure of Quantum Markov Networks is investigated and some partial characterization results are obtained, along the lines of the Hammersley-Clifford theorem. A Quantum Belief Propagation algorithm is presented and is shown to converge on 1-Bifactor Networks and Markov Networks when the underlying graph is a tree. The use of Quantum Belief Propagation as a heuristic algorithm in cases where it is not known to converge is discussed. Applications to decoding quantum error correcting codes and to the simulation of many-body quantum systems are described.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Building thermal load prediction through shallow machine learning and deep learning

Building thermal load prediction informs the optimization of cooling plant and thermal energy storage. Physics-based prediction models of building thermal load are constrained by the model and input complexity. In this study, we developed 12 data-driven models (7 shallow learning, 2 deep learning, and 3 heuristic methods) to predict building thermal load and compared shallow machine learning and deep learning. The 12 prediction models were compared with the measured cooling demand. It was found XGBoost (Extreme Gradient Boost) and LSTM (Long Short Term Memory) provided the most accurate load prediction in the shallow and deep learning category, and both outperformed the best baseline model, which uses the previous day's data for prediction. Then, we discussed how the prediction horizon and input uncertainty would influence the load prediction accuracy. Major conclusions are twofold: first, LSTM performs well in short-term prediction (1 h ahead) but not in long term prediction (24 h ahead), because the sequential information becomes less relevant and accordingly not so useful when the prediction horizon is long. Second, the presence of weather forecast uncertainty deteriorates XGBoost's accuracy and favors LSTM, because the sequential information makes the model more robust to input uncertainty. Training the model with the uncertain rather than accurate weather data could enhance the model's robustness. Finally, our findings have two implications for practice. First, LSTM is recommended for short-term load prediction given that weather forecast uncertainty is unavoidable. Second, XGBoost is recommended for long term prediction, and the model should be trained with the presence of input uncertainty.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Dynamic optimization and economic evaluation of flexible heat integration in a hybrid concentrated solar power plant

Hybridization of concentrated solar power (CSP) plants provides flexibility in operation that can drastically improve the solar-to-electric (STE) efficiency and levelized cost of electricity (LCOE) relative to standalone CSP plants. Flexible heat integration (FHI) is a novel concept where the collection and integration of CSP within a power plant is modified relative to the amount of solar energy available. FHI improves the thermal efficiency of a hybrid solar tower steam Rankine cycle power plant but leads to increased pumping needs due to continuously elevated molten salt flow rates through the collection system, which can negatively impact STE efficiency. The present work is carried out to maximize the STE efficiency of a hybrid CSP plant utilizing FHI by employing a dynamic optimization framework where a genetic algorithm optimizes the operation of the plant over a given solar irradiance profile. The study concerns a plant hypothetically located in Salt Lake City, Utah. Here, the optimization results confirm the accuracy of a predictive heuristic where the preferred operation of the plant can be estimated relative to local peaks in the incident power generated by the heliostat collection field. The optimized FHI operation demonstrates a yearly STE efficiency of 13.8%, whereas the equivalent base-level hybrid and solar-only plants exhibit solar efficiencies of 13.4% and 11.2%, respectively. Economic analysis shows that FHI reduces yearly natural gas costs, leading to a $\$0.5$/MWh reduction in LCOE relative to the base-level hybrid configuration. Overall, the results show that hybrid FHI schemes exhibit economic benefits along with observed thermodynamic improvements.

14 SOLAR ENERGY↗