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 649 records · Page 36

A parallel variable population multi-objective optimizer for accelerator beam dynamics optimization

The simultaneous optimization of multiple objective functions is needed in many particle accelerator applications. In this paper, we present a parallel evolution based multi-objective optimizer that uses a variable population from generation to generation and an external storage to save good solutions. Two heuristic optimization methods, one uses the unified differential evolution and the other uses the real-coded genetic algorithm, are included in the optimizer to generate next generation candidate solutions, and are compared in the test examples. Finally, as an application, we applied this optimizer to the beam dynamics design optimization of a photoinjector and attained the optimal front solutions after 200 generations with the unified differential evolution offspring production scheme.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Drifts, currents, and power scrape-off width in SOLPS-ITER modeling of DIII-D

The effects of drifts and associated flows and currents on the width of the parallel heat flux channel (λ q ) in the tokamak scrape-off layer (SOL) are analyzed using the SOLPS-ITER 2D fluid transport code. Motivation is supplied by Goldston’s heuristic drift (HD) model for λ q , which yields the same approximately inverse poloidal magnetic field dependence seen in multi-machine regression. The analysis, focusing on a DIII-D H-mode discharge, reveals HD-like features, including comparable density and temperature fall-off lengths in the SOL, and up-down ion pressure asymmetry that allows net cross-separatrix ion magnetic drift flux to exceed net anomalous ion flux. In experimentally relevant high-recycling cases, scans of both toroidal and poloidal magnetic field (B tor and B pol ) are conducted, showing minimal λ q dependence on either component of the field. Insensitivity to B tor is expected, and suggests that SOLPS-ITER is effectively capturing some aspects of HD physics. Absence of λ q dependence on B pol , however, is inconsistent with both the HD model and experimental results. As a result, the inconsistency is attributed to strong variation in the parallel Mach number, which violates one of the premises of the HD model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs

Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.

97 MATHEMATICS AND COMPUTING↗

Generation of feasible integer solutions on a massively parallel computer using the feasibility pump

Here, we present an approach to parallelize generation of feasible mixed integer solutions of mixed integerlinear programs in distributed memory high performance computing environments. This approachcombines a parallel framework with feasibility pump (FP) as the rounding heuristic. It runs multiple FPinstances with different starting solutions concurrently, while allowing them to share information. Ourcomputational results suggest that the improvement resulting from parallelization using our approach is statistically significant.

97 MATHEMATICS AND COMPUTING↗

Faster solutions to the interdiction defense problem using suboptimal solutions

The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.

Computer science↗

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for the parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.

Push-relabel, matching, bipartite↗

Enhancing molecular design efficiency: Uniting language models and generative networks with genetic algorithms

This study examines the effectiveness of generative models in drug discovery, material science, and polymer science, aiming to overcome constraints associated with traditional inverse design methods relying on heuristic rules. Generative models generate synthetic data resembling real data, enabling deep learning model training without extensive labeled datasets. They prove valuable in creating virtual libraries of molecules for material science and facilitating drug discovery by generating molecules with specific properties. While generative adversarial networks (GANs) are explored for these purposes, mode collapse restricts their efficacy, limiting novel structure variability. To address this, we introduce a masked language model (LM) inspired by natural language processing. Although LMs alone can have inherent limitations, we propose a hybrid architecture combining LMs and GANs to efficiently generate new molecules, demonstrating superior performance over standalone masked LMs, particularly for smaller population sizes. This hybrid LM-GAN architecture enhances efficiency in optimizing properties and generating novel samples.

97 MATHEMATICS AND COMPUTING↗

Efficient bifurcation and tabulation of multi-dimensional combustion manifolds using deep mixture of experts: An a priori study

This work describes and validates an approach for autonomously bifurcating turbulent combustion man-ifolds to divide regression tasks amongst specialized artificial neural networks (ANNs). This approach relies on the mixture of experts (MoE) framework, where each neural network is trained to be specialized in a given portion of the input space. The assignment of different input regions to the experts is determined by a gating network, which is a neural network classifier. In some previous studies, it has been demonstrated that bifurcation of a complex combustion manifold and fitting different ANNs for each part leads to better fits or faster inference speeds. However, the manner of bifurcation in these studies was based on heuristic approaches or clustering techniques. In contrast, the proposed technique enables automatic bifurcation using non-linear planes in high-dimensional turbulent combustion manifolds that are often associated with complex behavior due to different dominating physics in various zones. Furthermore, the proposed concept is validated using 4-dimensional (4D) and 5D flamelet tables, showing that the errors obtained with a given network size, or conversely the network size required to achieve a given accuracy, is considerably reduced. The effect of the number of experts on inference speed is also investigated, showing that by increasing the number of experts from 1 to 8, the inference time can be approximately reduced by a factor of two. Moreover, it is shown that the MoE approach divides the input manifold in a physically intuitive manner, suggesting that the MoE framework can elucidate high-dimensional datasets in a physically meaningful way.

42 ENGINEERING↗

Virtual storage capability of residential buildings for sustainable smart city via model-based predictive control

This paper evaluates the virtual storage capability of a residential air-conditioning (AC) system by utilizing the building mass as a thermal storage to enable sustainable cities through model-based predictive control (MPC). The control-oriented building model was developed with a grey-box model structure based on the experimental data to predict the indoor air temperature. Based on the model, the operation cost-saving potential of the MPC was investigated in a single house with different comfort levels, electricity prices, and prediction horizons. The cost-saving of the MPC was approximately 10.6 % compared to the conventional control. The MPC was expanded to a residential building cluster considering the peak demand charge. In an hourly shedding and load-up scenario, the performances of the MPC and the heuristic prior-based control (PBC) are promising. When shedding was enforced all day, the peak demand saving of the MPC was 36~38 %, whereas that of the PBC was 25.7 % compared to the baseline. In addition, the monthly electricity bill, including the operation and peak demand cost, was investigated with different demand charge rates and weather conditions. The total saving decreased with a low demand charge rate and hot conditions, and the operation cost saving was compromised with more aggressive demand shedding.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Transient analysis and energy optimization of solar heating and cooling systems in various configurations

In this paper, a transient simulation model of solar-assisted heating and cooling systems (SHC) is presented. A detailed case study is also discussed, in which three different configurations are considered. In all cases, the SHC system is based on the coupling of evacuated solar collectors with a single-stage LiBr-H{sub 2}O absorption chiller, and a gas-fired boiler is also included for auxiliary heating, only during the winter season. In the first configuration, the cooling capacity of the absorption chiller and the solar collector area are designed on the basis of the maximum cooling load, and an electric chiller is used as the auxiliary cooling system. The second layout is similar to the first one, but, in this case, the absorption chiller and the solar collector area are sized in order to balance only a fraction of the maximum cooling load. Finally, in the third configuration, there is no electric chiller, and the auxiliary gas-fired boiler is also used in summer to feed the absorption chiller, in case of scarce solar irradiation. The simulation model was developed using the TRNSYS software, and included the analysis of the dynamic behaviour of the building in which the SHC systems were supposed to be installed. The building was simulated using a single-lumped capacitance model. An economic model was also developed, in order to assess the operating and capital costs of the systems under analysis. Furthermore, a mixed heuristic-deterministic optimization algorithm was implemented, in order to determine the set of the synthesis/design variables that maximize the energy efficiency of each configuration under analysis. The results of the case study were analyzed on monthly and weekly basis, paying special attention to the energy and monetary flows of the standard and optimized configurations. The results are encouraging as for the potential of energy saving. On the contrary, the SHC systems appear still far from the economic profitability: however, this is notoriously true for the great majority of renewable energy systems. (author)

14 SOLAR ENERGY↗

Influence of the air-cooled supercritical carbon dioxide recompression cycle design-point on molten salt power tower techno-economic performance

Here, this paper investigates the techno-economic performance of a molten salt power tower integrated with an air-cooled supercritical carbon dioxide recompression cycle. Prior research into the cycle design point showed trade-offs between efficiency, cost, and temperature difference across the heat input, resulting in trade-offs between the design-point generation of the molten salt power tower system and the cost of sensible-heat thermal energy storage. Prior research into cycle off-design showed that colder ambient temperature designs have higher efficiencies on cold days but lower efficiency and capacity degradation on hot days. We present a framework to evaluate how cycle design, cost, and corresponding off-design performance affect the techno-economic performance of the molten salt power tower system. We use a steady-state off-design cycle model assuming fixed shaft speeds, inventory control, and air-cooler fan power control and integrate the cycle model with the molten salt power tower model from the National Renewable Energy Laboratory's System Advisor Model. First, we present a surrogate model that uses a heuristic approach to correct the interpolation when the cycle reaches capacity limitations at ambient temperatures hotter than design. Next, we evaluate how the recompression cycle design-point ambient temperature, air-cooler approach temperature, air-cooler fan power, and recuperator conductance influence cycle and system design metrics. Finally, we complete annual simulations using an hourly "duck curve" pricing schedule and present annual performance metrics to evaluate the cumulative effects of the cycle design parameters and corresponding off-design performance on molten salt power tower techno-economics.

14 SOLAR ENERGY↗

srlife : a software tool for estimating the life of high temperature concentrating solar receivers. Part I – metallic receivers

Here, this paper introduces srlife, a tool for estimating the structural service life of concentrating solar power (CSP) receivers operating at high temperatures. Supporting both metallic and ceramic receiver designs, srlife is available as open-source software at https://github.com/applied-material-modeling/srlife and can be installed via the PyPi package manager (https://pypi.org). Given basic receiver geometry and incident heat flux, the tool performs thermohydraulic and structural analysis and estimates the life of a receiver. Designed for easy integration into a software stack, including solar field and levelized cost analysis, the tool can be utilized for optimizing receiver designs to meet service life and economic targets. This paper is Part I in a two-part series. Part I discusses the analysis process used to estimate the life of metallic receivers, along with a description of the required input data. Additionally, several heuristics applied within srlife can reduce analysis time significantly while maintaining accurate life estimations for metallic receivers when compared to full analyses. Several examples demonstrating the utility of srlife in receiver design are also discussed. Part II focuses on the life estimation of ceramic receivers, using time-dependent reliability analysis and various ceramic failure models implemented in srlife.

Creep-fatigue analysis↗

When the facts are just not enough: Credibly communicating about risk is riskier when emotions run high and time is short

When discussing risk with people, commonly subject matter experts believe that conveying the facts will be enough to allow people to assess a risk and respond rationally to that risk. Because of this expectation, experts often become exasperated by the seemingly illogical way people assess personal risk and choose to manage that risk. In crisis situations when the risk information is less defined and choices must be made within impossible time constraints, the thought processes may be even more susceptible to faulty heuristics. Understanding the perception of risk is essential to understanding why the public becomes more or less upset by events. This article explores the psychological underpinnings of risk assessment within emotionally laden events and the risk communication practices that may facilitate subject matter experts to provide the facts in a manner so they can be more certain those facts are being heard. Source credibility is foundational to risk communication practices. The public meeting is one example in which these best practices can be exercised. Risks are risky because risk perceptions differ and the psychosocial environment in which risk is discussed complicates making risk decisions. Experts who want to influence the actions of the public related to a threat or risk should understand that decisions often involve emotional as well as logical components. The media and other social entities will also influence the risk context. The Center for Disease Control and Prevention's crisis and emergency-risk communication (CERC) principles are intended to increase credibility and recognize emotional components of an event. During a risk event, CERC works to calm emotions and increase trust which can help people apply the expertise being offered by response officials.

60 APPLIED LIFE SCIENCES↗

A two-stage stochastic optimization model for scheduling electric vehicle charging loads to relieve distribution-system constraints

Electric vehicles (EVs) hold promise to improve the energy efficiency and environmental impacts of transportation. However, widespread EV use can impose significant stress on electricity-distribution systems due to their added charging loads. This paper proposes a centralized EV charging-control model, which schedules the charging of EVs that have flexibility. This flexibility stems from EVs that are parked at the charging station for a longer duration of time than is needed to fully recharge the battery. The model is formulated as a two-stage stochastic optimization problem. The model captures the use of distributed energy resources and uncertainties around EV arrival times and charging demands upon arrival, non-EV loads on the distribution system, energy prices, and availability of energy from the distributed energy resources. We use a Monte Carlo-based sample-average approximation technique and an L-shaped method to solve the resulting optimization problem efficiently. We also apply a sequential sampling technique to dynamically determine the optimal size of the randomly sampled scenario tree to give a solution with a desired quality at minimal computational cost. Here, we demonstrate the use of our model on a Central-Ohio-based case study. We show the benefits of the model in reducing charging costs, negative impacts on the distribution system, and unserved EV-charging demand compared to simpler heuristics. Lastly, we also conduct sensitivity analyses, to show how the model performs and the resulting costs and load profiles when the design of the station or EV-usage parameters are changed.

33 ADVANCED PROPULSION SYSTEMS↗

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗

Coordinated platooning with multiple speeds

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.

33 ADVANCED PROPULSION SYSTEMS↗

Joint Design of Multimodal Transit Networks and Shared Autonomous Mobility Fleets

Providing quality transit service to travelers in low-density areas, particularly travelers without personal vehicles, is a constant challenge for transit agencies. The advent of fully-autonomous vehicles (AVs) and their inclusion in mobility service fleets may allow transit agencies to offer better service and/or reduce their own capital and operational costs. This study focuses on the problem of allocating resources between transit patterns and operating (or subsidizing) shared-use AV mobility services (SAMSs) in a large metropolitan area. To address this question, a joint transit network redesign and SAMS fleet size determination problem (JTNR-SFSDP) is introduced, and a bi-level mathematical programming formulation and solution approach are presented. The upper-level problem modifies a transit network frequency setting problem (TNFSP) formulation via incorporating SAMS fleet size as a decision variable and allowing the removal of bus routes. The lower-level problem consists of a dynamic combined mode choice-traveler assignment problem (DCMC-TAP) formulation. The heuristic solution procedure involves solving the upper-level problem using a nonlinear programming solver and solving the lower-level problem using an iterative agent-based assignment-simulation approach. To illustrate the effectiveness of the modeling framework, this study uses traveler demand from Chicago along with the regions existing multimodal transit network. The computational results indicate significant traveler benefits, in terms of improved average traveler wait times, associated with optimizing the joint design of multimodal transit networks and SAMS fleets compared with the initial transit network design.

bi-level programming↗

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗