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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Optimizing the location and configuration of disaster resilience hubs under transportation and electric power network failures

Natural disasters often result in failures of transportation network components and blackouts that imperil the wellbeing of vulnerable populations. In response to these events, resilience hubs have been proposed as a pre-disaster planning strategy to improve access to critical services. This paper introduces an optimization-based approach to locate and configure electric power-generating resilience hubs considering the possibility of failures in transportation and electric power systems. The model's objective is to identify hub locations and configurations that maximize transportation accessibility to the hubs and maximize the satisfaction of basic energy needs through hub-generated electric power. Besides a budget constraint, the model accounts for limits on the levels of hub energy generation vis-à-vis community energy demands, and on the transportation network distance of communities to hubs. Three heuristics are presented for the proposed planning problem. The first heuristic is a genetic algorithm (GA) with problem-specific solution generation procedures. The other two heuristics implement greedy search techniques. Numerical experiments were conducted, using data from rural Puerto Rico, to illustrate the application of the proposed model and heuristics, and examine their performance. In the numerical experiments, the GA heuristic found better solutions than the greedy heuristics. Additionally, design solutions consisting of spatially dispersed hubs with low energy generation capacity were better than solutions with spatially concentrated high-capacity hubs. Lastly, across a wide range of hub demand scenarios, only a small number of candidate hub locations consistently ranked among the best locations for establishing a hub.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Oscillatory Spreading and Inertia in Power Grids

The increase in variable renewable generators (VRGs) in power systems has altered the dynamics from a historical experience. VRGs introduce new sources of power oscillations, and the stabilizing response provided by synchronous generators (SGs, e.g., natural gas, coal, etc.), which help avoid some power fluctuations, will lessen as VRGs replace SGs. These changes have led to the need for new methods and metrics to quickly assess the likely oscillatory behavior for a particular network without performing computationally expensive simulations. This work studies the impact of a critical dynamical parameter - the inertia value - on the rest of a power system's oscillatory response to representative VRG perturbations. We use a known localization metric in a novel way to quantify the number of nodes responding to a perturbation and the magnitude of those responses. This metric allows us to relate the spread and severity of a system's power oscillations with inertia. We find that as inertia increases, the system response to node perturbations transitions from localized (only a few close nodes respond) to delocalized (many nodes across the network respond). We introduce a heuristic computed from the network Laplacian to relate this oscillatory transition to the network structure. We show that our heuristic accurately describes the spread of oscillations for a realistic power-system test case. Using a heuristic to determine the likely oscillatory behavior of a system given a set of parameters has wide applicability in power systems, and it could decrease the computational workload of planning and operation.

dynamical systems↗
NASA NTRS1992

Learning to improve iterative repair scheduling

This paper presents a general learning method for dynamically selecting between repair heuristics in an iterative repair scheduling system. The system employs a version of explanation-based learning called Plausible Explanation-Based Learning (PEBL) that uses multiple examples to confirm conjectured explanations. The basic approach is to conjecture contradictions between a heuristic and statistics that measure the quality of the heuristic. When these contradictions are confirmed, a different heuristic is selected. To motivate the utility of this approach we present an empirical evaluation of the performance of a scheduling system with respect to two different repair strategies. We show that the scheduler that learns to choose between the heuristics outperforms the same scheduler with any one of two heuristics alone.

Zweben, Monte↗
DOE OSTI2014

Utility functions and resource management in an oversubscribed heterogeneous computing environment

We model an oversubscribed heterogeneous computing system where tasks arrive dynamically and a scheduler maps the tasks to machines for execution. The environment and workloads are based on those being investigated by the Extreme Scale Systems Center at Oak Ridge National Laboratory. Utility functions that are designed based on specifications from the system owner and users are used to create a metric for the performance of resource allocation heuristics. Each task has a time-varying utility (importance) that the enterprise will earn based on when the task successfully completes execution. We design multiple heuristics, which include a technique to drop low utility-earning tasks, to maximize the total utility that can be earned by completing tasks. The heuristics are evaluated using simulation experiments with two levels of oversubscription. The results show the benefit of having fast heuristics that account for the importance of a task and the heterogeneity of the environment when making allocation decisions in an oversubscribed environment. Furthermore, the ability to drop low utility-earning tasks allow the heuristics to tolerate the high oversubscription as well as earn significant utility.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Utility maximizing dynamic resource management in an oversubscribed energy-constrained heterogeneous computing system

The need for greater performance in high performance computing systems combined with rising costs of electricity to power these systems motivates the need for energy-efficient resource management. Driven by the requirements of the Extreme Scale Systems Center at Oak Ridge National Laboratory, our study addresses the problem of scheduling dynamically-arriving tasks to machines in an oversubscribed and energy-constrained heterogeneous distributed computing environment. Our goal is to maximize total “utility” earned by the system, where the utility of a task is defined by a monotonically-decreasing function that represents the value of completing that task at different times. To address this problem, we design four energy-aware resource allocation heuristics and compare their performance to heuristics from the literature. For our given energy-constrained environment, we also design an energy filtering technique that helps some heuristics regulate their energy consumption by allowing tasks to only consume up to an estimated fair-share of energy. Extensive sensitivity analyses of the heuristics in environments with different levels of heterogeneity show that heuristics with the ability to balance both energy consumption and utility exhibit the best performance because they save energy for use by future tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Grappolo

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose heuristics that are designed to break the sequential barrier. For evaluation purposes, we implemented our heuristics using OpenMP multithreading, and tested them over real world graphs derived from multiple application domains (e.g., internet, citation, biological). Compared to the serial Louvain implementation, our parallel implementation is able to produce community outputs with a higher modularity for most of the inputs tested, in comparable number of iterations, while providing real speedups of up to 8x using 32 threads. In addition, our parallel implementation was able to exhibit weak scaling properties on up to 32 threads.

Halappanavar, Mahantesh↗
NASA NTRS1990

Dynamic load-sharing using predicted process resource requirements

Heuristics which use predicted process resource requirements to make scheduling decisions are proposed. Four heuristics are presented. The first two, MINQ and SMPL, employ centralized scheduling and the remaining two, DMINQ and FDMINQ, use distributed scheduling. These heuristics are first compared against random scheduling and then against two conventional heuristics, CENTEX and DISTED, which schedule processes solely based on system state information. Results based on trace-driven simulations show that the proposed centralized heuristics offer significantly improved mean response time and they require fewer status update messages. In experiments using the same status update rates, SMPL response times were, on the average, 22 percent lower than those for CENTEX; MINQ response times were, on the average, 18 percent lower. The simulations also showed that MINQ and SMPL can perform as well as, or better than, CENTEX while using up to 70 percent fewer status update messages. The use of fewer status update messages imposes less overhead on the system. The use of prediction for distributed scheduling produced similar results. When prediction was used to filter small processes and execute them locally a 50 percent improvement in response times was obtained.

Goswami, Kumar K.↗
DOE OSTI2022

Optimizing power system restoration with damaged communications

Utility procedures for power system blackstart and restoration typically assume that energization decisions can be reliably communicated across the grid. In reality, the communications and control network would likely also be affected in power outages, such as those caused by extreme weather events or cyber-attacks. This paper studies the effect of damage to the power system communications and control infrastructure on restoration operations following a blackout. We model the communications infrastructure as a graph, overlaying the power grid, and imposing the requirement that every energized element in the power grid be observable from a control center. We expand on a specialized branch-and-bound algorithm from the literature to optimize the restoration process and devise an initialization heuristic and a rounding heuristic to improve solution speed. We perform numerical experiments on synthetic systems for Illinois and Texas with outages based on a solar flare or hurricane. We compare the results of our specialized branch-and-bound algorithm to the results from (i) the initialization heuristic alone, (ii) a variation of this heuristic that we use as a baseline, and (iii) the restoration optimization for the power system without communications constraints. Here, we find that damage to the communications infrastructure significantly increases the time required to re-energize the grid. Moreover, by simultaneously optimizing communications repairs and grid energization decisions, we are able to re-energize the grid significantly faster than if communications repairs and energization decisions were made independently or with partial coordination, motivating improvements to current industry practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Optimal deployment of thermal energy storage under diverse economic and climate conditions

This paper presents an investigation of the economic benefit of thermal energy storage (TES) for cooling, across a range of economic and climate conditions. Chilled water TES systems are simulated for a large office building in four distinct locations, Miami in the U.S.; Lisbon, Portugal; Shanghai, China; and Mumbai, India. Optimal system size and operating schedules are determined using the optimization model DER-CAM, such that total cost, including electricity and amortized capital costs are minimized. The economic impacts of each optimized TES system is then compared to systems sized using a simple heuristic method, which bases system size as fraction (50percent and 100percent) of total on-peak summer cooling loads. Results indicate that TES systems of all sizes can be effective in reducing annual electricity costs (5percent-15percent) and peak electricity consumption (13percent-33percent). The investigation also indentifies a number of criteria which drive TES investment, including low capital costs, electricity tariffs with high power demand charges and prolonged cooling seasons. In locations where these drivers clearly exist, the heuristically sized systems capture much of the value of optimally sized systems; between 60percent and 100percent in terms of net present value. However, in instances where these drivers are less pronounced, the heuristic tends to oversize systems, and optimization becomes crucial to ensure economically beneficial deployment of TES, increasing the net present value of heuristically sized systems by as much as 10 times in some instances.

25 ENERGY STORAGE↗
DOE OSTI2023

Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry

Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Impact of ionization peak location on measured opaqueness in DIII-D H-mode plasmas

This study investigates the relationship between electron pedestal density and the location of the ionization peak on neutral penetration in DIII-D H-mode plasmas, utilizing a database of Lyman-α emission measurements. The high electron density leads to neutrals being ‘screened’ and the ionization front being pushed out into the Scrape-Off Layer (SOL). This is also referred to as the neutral opaqueness, which is heuristically expected to scale with edge plasma density and machine size. However, at lower electron pedestal density, the penetration depth of the neutrals varies, and measured opaqueness deviates from the heuristic scaling. The database reveals that at low density, when the ionization peak is located in SOL region, the linear relationship between the electron density and neutral penetration holds. However, when the peak is located inside the separatrix, the penetration of the neutrals (λ n 0 ) is much wider ~3.0–3.5 cm, breaking the heuristic opaqueness approximation. These findings provide valuable insights into fueling efficiency and plasma behavior, with implications for Fusion Pilot Plants where high pedestal densities are anticipated and where the neutral opaqueness behaves like its heuristic approximation. This analysis offers a framework to refine neutral opaqueness approximations, enhancing the predictive capability for advanced tokamak operations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

DRAS: Deep Reinforcement Learning for Cluster Scheduling in High Performance Computing

Cluster schedulers are crucial in high-performance computing (HPC). They determine when and which user jobs should be allocated to available system resources. Existing cluster scheduling heuristics are developed by human experts based on their experience with specific HPC systems and workloads. However, the increasing complexity of computing systems and the highly dynamic nature of application workloads have placed tremendous burden on manually designed and tuned scheduling heuristics. More aggressive optimization and automation are needed for cluster scheduling in HPC. In this work, we present an automated HPC scheduling agent named DRAS (Deep Reinforcement Agent for Scheduling) by leveraging deep reinforcement learning. DRAS is built on a hierarchical neural network incorporating special HPC scheduling features such as resource reservation and backfilling. An efficient training strategy is presented to enable DRAS to rapidly learn the target environment. Once being provided a specific scheduling objective given by the system manager, DRAS automatically learns to improve its policy through interaction with the scheduling environment and dynamically adjusts its policy as workload changes. We implement DRAS into a HPC scheduling platform called CQGym. CQGym provides a common platform allowing users to flexibly evaluate DRAS and other scheduling methods such as heuristic and optimization methods. Furthermore, the experiments using CQGym with different production workloads demonstrate that DRAS outperforms the existing heuristic and optimization approaches by up to 50%.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Optimal Voltage Reference for Droop-Based DERs in Distribution Systems

Due to the newly issued standards on distributed energy resources (DERs), the droop-based operation modes (Q-V and P-V droops) become a requirement for all the interconnected DER units at the distribution level. Voltage references of the DER units can be assigned to improve the operational behavior of the distribution system in the smart grid context. This paper presents a novel formulation for optimally setting voltage reference of the droop-based DER units in distribution systems with the objective of minimizing the system ohmic loss. This problem is formulated as a mixed-integer quadratic convex optimization problem in MATLAB and solved by the MATLAB and CPLEX solvers. The IEEE 123-bus system and the EPRI test system Ckt5 are used to validate the proposed formulation. The result obtained from the proposed formulation is compared with the result of the original problem solved by the heuristic method. Based on the numerical study results, system loss can be reduced after the proposed voltage reference assignment. The computational expense of the new formulation is also much lower than that of the heuristic approach.

distributed energy resource integration↗
DOE OSTI2019

Performance Models for Data Transfers: A Case Study with Molecular Chemistry Kernels

In distributed memory systems, it is paramount to develop strategies to overlap the data transfers between memory nodes with the computations in order to exploit the full potential of these systems. In this paper, we consider the problem of determining the order of data transfers between two memory nodes for a set of independent tasks with the objective of minimizing the makespan. We prove that, with limited memory capacity, the problem of obtaining the optimal order of data transfers is NP-complete. We propose several heuristics to determine this order and discuss the conditions that might be favorable to different heuristics. We analyze our heuristics on traces obtained by running 2 molecular chemistry kernels, namely, Hartree–Fock (HF) and Coupled Cluster Single Double (CCSD) on 10 nodes of an HPC system. Our results show that some of our heuristics achieve significant overlap for moderate memory capacities and resulting in makespans that are very close to the lower bound.

Kumar, Suraj↗
DOE OSTI2022

Automated Production of Optimization-Based Control Logics for Dynamic Facade Systems, with Experimental Application to Two-Zone External Venetian Blinds

The primary goal of this research is to devise a system that produces controllers for complex fenestration systems that perform nearly as well as Model Predictive Control but at a level of cost and implementation complexity that rivals simple heuristic controls. To this end, a cloud-based automated controller production system has been set up for a motorized external Venetian blind device, with a simple web interface that can be used by non-experts. The computation cost per controller is in the range of a few dollars, and the control logic is simple enough to be implemented on small and cheap distributed controllers. The web interface allows the user to specify some details of their particular building and window configuration, including orientation, latitude, interior geometries, and lighting and HVAC system parameters. Upon submittal, a cloud-based system configures the necessary files and commands, and then runs thousands of optimizations with them. Once the calculations are finished, the system produces a lookup table and interpolation-based controller scripts that can be used on a simple and cheap distributed controller. This paper describes the underlying models and optimization processes. It also describes the resulting control logics for two cases tested at Lawrence Berkeley National Laboratory’s Advanced Windows Testbed Facility: illuminance maximization subject to glare constraints; and lighting + HVAC energy minimization. The performance of the model-based controllers produced by the automated web-based system are compared to a heuristic ‘block beam’ controller in physical experiments at the Testbed. The experimental results are supplemented by simulation experiments with the same configuration as the Testbed. The results show the illuminance maximizing controller significantly outperforms the heuristic controller in terms of glare avoidance, and also outperforms it in terms of hours of daylight autonomy. The energy minimizing controller also outperforms the heuristic controller. This paper also discusses how the web-based system may be extended to consider other configurations, such as electrochromic windows and thermally massive HVAC systems. Potential roles for this type of system within the building design and construction industry are discussed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1987

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗
NASA NTRS1989

Scheduling Tasks In Parallel Processing

Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.

Price, Camille C.↗
NASA NTRS1993

Decision theory for computing variable and value ordering decisions for scheduling problems

Heuristics that guide search are critical when solving large planning and scheduling problems, but most variable and value ordering heuristics are sensitive to only one feature of the search state. One wants to combine evidence from all features of the search state into a subjective probability that a value choice is best, but there has been no solid semantics for merging evidence when it is conceived in these terms. Instead, variable and value ordering decisions should be viewed as problems in decision theory. This led to two key insights: (1) The fundamental concept that allows heuristic evidence to be merged is the net incremental utility that will be achieved by assigning a value to a variable. Probability distributions about net incremental utility can merge evidence from the utility function, binary constraints, resource constraints, and other problem features. The subjective probability that a value is the best choice is then derived from probability distributions about net incremental utility. (2) The methods used for rumor control in Bayesian Networks are the primary way to prevent cycling in the computation of probable net incremental utility. These insights lead to semantically justifiable ways to compute heuristic variable and value ordering decisions that merge evidence from all available features of the search state.

Linden, Theodore A.↗