Search NASA⌕ Search

SEARCH · Search NASA

Results for “Integer Optimization”

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 595 records · Page 33

Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications (Final Report)

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operation optical WDM networks.

97 MATHEMATICS AND COMPUTING↗

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)

Costly and/or insufficiently robust simulations or experiments can often pose difficulties when their use extends well beyond a single evaluation. This is case with the numerous evaluations of uncertainty quantification, when an algebraic model is needed for optimization, as well as numerous other areas. To overcome these difficulties, we generate an accurate set of algebraic surrogate models of disaggregated process blocks of the experiment or simulation. We developed a method that uses derivative-based and derivative-free optimization alongside machine learning and statistical techniques to generate the set of surrogate models using data sampled from experiments or detailed simulations. Our method begins by building a low-complexity surrogate model for each block from an initial sample set. The model is built using a best subset technique that leverages a mixed-integer linear problem formulation to allow for very large initial basis sets. The models are then tested, exploited, and improved through the use of derivative-free solvers to adaptively sample new simulation or experimental points. The sets of surrogate models from each disaggregated process block are then combined with heat and mass balances around each disaggregated block to generate a full algebraic model of the process. The full model can be used for cheap and accurate evaluations of the original simulation or experiment or combined with design specifications and an objective for nonlinear optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

NbTaV_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution ternary alloys niobium-tantalum-vanadium (Nb-Ta-V). The first-principle code that has been used to run the calculations is the closed-source Vienna Ab-Initio Simulation Package (VASP). The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 8. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 10,500 randomized atomic structures over 105 chemical compositions. The calculations have been collected on NERSC-Perlmutter using the VASP 6.3.2. The VASP calculations for every atomic structure have been performed in 2 main steps: 1. Starting from an ideal body-centered-cubic (BCC) structure, geometry optimization with low precision has been executed to perform a preliminary optimization of the atomic structure. The output for this calculations is available in the files 0.CONTCAR, 0.OUTCAR, rlx1.out. 2. Using the atomic structure resulting from the preliminary geometry optimization, a second geometry optimization has been performed using normal precision. The output for this calculations is available in the files CONTCAR, OUTCAR, rlx2.out, vaspout.h5, and vasprun.xml. Every chemical composition sampled across the composition range in the dataset has its own directory. The convention used to name the directories for ternary alloys is AXBYCZ, where A, B, and C refer to the constituents, and X, Y, and Z are positive integers that represent the number of atoms for each constituent and their values still sum up to 128. Each atomic structure associated with a specific chemical composition has its own sub-directory within the directory of the corresponding chemical composition. The sub-directories for each atomic structure for each chemical composition are named 'case-*', where * is a positive integer that spans all the values from 1 through 100, extremes included. The files contained in each sub-directory 'case-*' for each atomic structure are as follows: 1. INCAR: input file that contains various parameters and settings for controlling the behavior of the electronic structure calculations 2. 0.POSCAR: input file that defines the atomic structure of a system 3. 0.CONTCAR: output file that provides the atomic positions and cell parameters after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 4. 0.OUTCAR: output file that contains detailed information about the progress of a calculation after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 5. rlx1.out: file with diagnostic information about the execution of the first geometry optimization with precision variable set to PREC=Low in the INCAR file 6. POSCAR: input file that defines the atomic structure of a system after the first geometry optimization has been run at low precision. This represents the input for the second geometry optimization run with the precision variable set to PREC=Normal in the INCAR file 7. CONTCAR: output file that provides the atomic positions and cell parameters after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 8. OUTCARL: output file that contains detailed information about the progress of a calculation after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 9. rlx2.out: file with diagnostic information about the execution of the second geometry optimization with precision variable set to PREC=Normal in the INCAR file 10. vaspout.h5: hierarchical HDF5 file containing the inputs and outputs of a VASP calculation. To analyze the data in this file we recommend using py4vasp. This file is only produced if the VASP version used is compiled with HDF5 support 11. vasprun.xml: contains similar information to OUTCAR, but in an xml format. This research is sponsored by the Artificial Intelligence Initiative as part of the Laboratory Directed Research and Development (LDRD) Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC, for the US Department of Energy under contract DE-AC05-00OR22725. This work used resources of the Oak Ridge Leadership Computing Facility, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725, under Directorate Discretionary awards MAT025 (Materials Science) and LRN026 (Machine Learning), and INCITE award MAT201. This work also used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231, under award ERCAP0025216.

36 MATERIALS SCIENCE↗

An L$_0$L$_1$-norm compressive sensing paradigm for the construction of sparse predictive lattice models using mixed integer quadratic programming

First-principles based lattice models allow the modeling of ab initio thermodynamics of crystalline mixtures for applications such as the construction of phase diagrams and the identification of ground state atomic orderings. The recent development of compressive sensing approaches for the construction of lattice models has further enabled the systematic construction of sparse physical models without the need for human intuition other than requiring the compactness of effective cluster interactions. However, conventional compressive sensing based on L1-norm regularization is strictly only applicable to certain classes of optimization problems and is otherwise not guaranteed to generate optimally sparse and transferable results, so that the method can only be applied to some materials science applications. In this paper, we illustrate a more robust L0L1-norm compressive-sensing method that removes the limitations of conventional compressive sensing and generally results in sparser lattice models that are at least as predictive as those obtained from L1-norm compressive sensing. Apart from the theory, a practical implementation based on state-of-the-art mixed-integer quadratic programming (MIQP) is proposed. The robustness of our methodology is illustrated for four different transition-metal oxides with relevance as battery cathode materials: Li2xTi2(1-x)O2, Li2xNi2yO2, MgxCr2O4, and NaxCrO2. This method provides a practical and robust approach for the construction of sparser and more predictive lattice models, improving on the compressive sensing paradigm and making it applicable to a much broader range of applications.

Huang, W↗

A gradient-based optimization approach for the detection of partially connected surfaces using vibration tests

The integrity of engineering structures is often compromised by embedded surfaces that result from incomplete bonding during the manufacturing process, or initiation of damage from fatigue or impact processes. Examples include delaminations in composite materials, incomplete weld bonds when joining two components, and internal crack planes that may form when a structure is damaged. In many cases the areas of the structure in question may not be easily accessible, thus precluding the direct assessment of structural integrity. In this paper, we present a gradient-based, partial differential equation (PDE)-constrained optimization approach for solving the inverse problem of interface detection in the context of steady-state dynamics. An objective function is defined that represents the difference between the model predictions of structural response at a set of spatial locations, and the experimentally measured responses. One of the contributions of our work is a novel representation of the design variables using a density field that takes values in the range [0, 1] and raised to an integer exponent that promotes solutions to be near the extrema of the range. The density field is combined with the penalty method for enforcing a zero gap condition and realizing partially bonded surfaces. Furthermore the use of the penalty method with a density field representation leads to objective functions that are continuously differentiable with respect to the unknown parameters, enabling the use of efficient gradient-based optimization algorithms. Numerical examples of delaminated plates are presented to demonstrate the feasibility of the approach.

42 ENGINEERING↗

Higher Multipoles in 3rd Integer Resonance Extraction

The efficiency of slow extraction is becoming a limiting factor, as the demand for delivered beam power is constantly growing. New methods for improving extraction efficiency include folding the extraction separatrix using the higher multipoles. In this report we discuss a simple and effective approach to determine an optimal placement of those multipoles in the storage ring. This allows reduction of the beam losses and therefore, the level of prompt and residual radioactivity in the accelerator components and surrounding buildings by as much as 40% or more. We also explore here manipulating the higher order effects produced in the pure sextupole configurations for the same purpose and demonstrate that similar results can be achieved by only rearranging the sextupole magnets in the lattice.

43 PARTICLE ACCELERATORS↗

A Vehicle-to-Grid planning framework incorporating electric vehicle user equilibrium and distribution network flexibility enhancement

The rapid surge in electric vehicle (EV) adoption, coupled with advancements in charging technologies, emphasizes the critical necessity for expanding EV recharging infrastructure. Simultaneously, the Distribution Network (DN) encounters escalating challenges in meeting charging demand during peak traffic periods. Consequently, there is a mounting demand for the deployment of innovative Vehicle-to-Grid (V2G) technologies to augment the DN’s flexibility in power dispatch and alleviate travel costs for EV users. Hence, this paper proposes an EV-user-equilibrium-(UE)-constrained V2G planning framework that enhances flexibility in the DN. The framework aims to ascertain the optimal placement and capacity of EV charging stations (EVCSs) and V2G charging piles within the Transportation Network (TN). It takes into account the equilibrium condition stemming from competitive EV charging and routing behaviors alongside the optimal expansion of DN energy resources to accommodate the electricity supplied by the V2G piles. This study commences by analyzing EV drivers’ travel decisions, considering the influence of charging and V2G pile locations and sizes. Subsequently, we tackle the Traffic Assignment Problem with User Equilibrium (TAP-UE) model to characterize the steady-state traffic flow distribution of EVs. Following this, we formulate the optimization model for the Coordinated Power and Transportation Network (CPTN), which encompasses the optimal expansion of DN facilities and traffic flow regulation under UE conditions. To mitigate the computational complexity associated with the V2G planning model, we introduce a series of linearization methods to obtain a manageable Mixed-Integer Linear Programming (MILP) solution. Finally, to validate the efficacy of our proposed planning framework, we apply it to two test systems, including a real-world case study. Through these case studies, we explore the necessity and potential benefits of V2G technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multi-Period Active Distribution Network Planning Using Multi-Stage Stochastic Programming and Nested Decomposition by SDDIP

This paper presents a multi-period active distribution network planning (ADNP) with distributed generation (DG). The objective of the proposed ADNP is to minimize the total planning cost, subject to both investment and operation constraints. The paper proposes a multi-stage stochastic optimization model to address DG uncertainties over several periods, in which the decisions are made sequentially by only using the present-stage information. A nested decomposition method is proposed which applies the stochastic dual dynamic integer programming (SDDIP) method to address computational intractabilities of the proposed ADNP approach. The presented numerical results and discussions on a 33-bus distribution system and a large-scale 906-bus system verify the effectiveness of the proposed ADNP method and its solution method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ON MORE SENSITIVE PERIODOGRAM STATISTICS

Period searches in event data have traditionally used the Rayleigh statistic, R {sup 2}. For X-ray pulsars, the standard has been the Z {sup 2} statistic, which sums over more than one harmonic. For γ-rays, the H-test, which optimizes the number of harmonics to sum, is often used. These periodograms all suffer from the same problem, namely artifacts caused by correlations in the Fourier components that arise from testing frequencies with a non-integer number of cycles. This article addresses this problem. The modified Rayleigh statistic is discussed, its generalization to any harmonic, R{sub k}{sup 2}, is formulated, and from the latter, the modified Z {sup 2} statistic, Z{sup 2}, is constructed. Versions of these statistics for binned data and point measurements are derived, and it is shown that the variance in the uncertainties can have an important influence on the periodogram. It is shown how to combine the information about the signal frequency from the different harmonics to estimate its value with maximum accuracy. The methods are applied to an XMM-Newton observation of the Crab pulsar for which a decomposition of the pulse profile is presented, and shows that most of the power is in the second, third, and fifth harmonics. Statistical detection power of the R{sub k}{sup 2} statistic is superior to the FFT and equivalent to the Lomb--Scargle (LS). Response to gaps in the data is assessed, and it is shown that the LS does not protect against the distortions they cause. The main conclusion of this work is that the classical R {sup 2} and Z {sup 2} should be replaced by R{sub k}{sup 2} and Z{sup 2} in all applications with event data, and the LS should be replaced by the R{sub k}{sup 2} when the uncertainty varies from one point measurement to another.

79 ASTRONOMY AND ASTROPHYSICS↗

Modeling the Strategic Behavior of an Active Distribution Network in the ISO Markets

With increasing integration of distributed energy resources (DERs), active distribution networks (ADNs) can actively participate in the electricity markets by dispatching their DERs, which can change the existing electricity market paradigm. It is essential to investigate the strategic behaviors of ADNs and their DER dispatch when they participate in the wholesale market as price-makers. This paper proposes a bi-level optimization model to study the strategic behavior of an ADN in both energy and reserve markets. The optimal scheduling of DERs in the ADN is modeled as the upper level problem and the joint energy and reserve market-clearing of the ISO is modeled as the lower-level problem. The two-level optimization models exchange bidding information and energy/reserve prices with each other. The proposed bi-Ievel optimization problem is converted to a mathematical programming with equilibrium constraints (MPEC) by using Karush-Kuhn Tucker (KKT) conditions and strong duality theory. Further, the MPEC problem is reformulated as a computationally-solvable mixed integer second order cone programming (MISOCP) model. The simulation results on an illustrative case demonstrate the impact of the strategic bidding of the ADN on the day-ahead energy and reserve market prices.

Xue, Yaosuo↗

REopt: Enabling Renewable Energy, Storage, and Combined Heat and Power

Deployment of distributed energy resources including combined heat and power (CHP), photovoltaics (PV), and battery storage is growing as building and campus owners seek to reduce energy costs and increase resilience to grid outages. While deployment of a single technology is widespread, integrated systems of multiple technologies are also becoming more common to provide maximum economic and resilience benefits. To accelerate deployment, decision makers require tools to evaluate the technical and economic feasibility of these integrated systems. This paper presents a framework for optimizing the size and dispatch strategy of CHP with PV and battery storage to minimize life-cycle cost of energy. The modeling methodology is presented, with a particular focus on the linearization of cost and performance metrics required for implementation in a mixed integer linear program. A case study is used to examine the technical and economic viability of integrated CHP, PV, and battery systems, compared to CHP-only or PV+battery storage systems. In the case study we show how the integrated systems can provide increased economic and resilience benefits compared to single technologies on their own. The case study presented shows the combined CHP, PV, and battery system resulted in a 7% lower life cycle cost than CHP only, and a 22% lower life cycle cost than PV+battery storage. The life cycle emissions for CHP, PV, and battery storage resulted in a 24% reduction than CHP only and a 17% increase than PV+battery storage.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Full Demand Response Model in Co-Optimized Energy and

It has been widely accepted that demand response will play an important role in reliable and economic operation of future power systems and electricity markets. Demand response can not only influence the prices in the energy market by demand shifting, but also participate in the reserve market. In this paper, we propose a full model of demand response in which demand flexibility is fully utilized by price responsive shiftable demand bids in energy market as well as spinning reserve bids in reserve market. A co-optimized day-ahead energy and spinning reserve market is proposed to minimize the expected net cost under all credible system states, i.e., expected total cost of operation minus total benefit of demand, and solved by mixed integer linear programming. Numerical simulation results on the IEEE Reliability Test System show effectiveness of this model. Compared to conventional demand shifting bids, the proposed full demand response model can further reduce committed capacity from generators, starting up and shutting down of units and the overall system operating costs.

bidding mechanism↗

Long-term strategic planning of inter-city fast charging infrastructure for battery electric vehicles

Here, this study introduces a multistage mixed integer modeling framework for long-term strategic planning of the battery electric vehicle (BEV) inter-city fast charging infrastructure. In response to the growing BEV inter-city travel demand, the framework integrates both an optimization model for decisions on where and when to build charging stations and a stochastic queuing model to determine how many chargers are needed for each station. A genetic algorithm based heuristic method is developed to efficiently solve the problem. The model is applied to investigate the long-term infrastructure requirement in the state of California where significant growth in BEV demand is expected in coming decades. Our findings indicate that the charging infrastructure is expanded in both network coverage (number of stations) and service capacity (number of chargers per station) as the BEV demand grows. We also found that the infrastructure requirement is dependent on many factors, such as the BEV electrified range, the required level of service at charging stations, and the range anxiety cost. For most simulated scenarios, the results show that it is beneficial to invest in the inter-city fast charging infrastructure, even though the range anxiety cost is at its low end.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

Integrated solution techniques for security constrained unit commitment problem

Apparatus and methods are disclosed for solving Mixed Integer Programming (MIP) problems, such as Security Constrained Unit Commitment (SCUC) problems used by power grid authorities to perform day-ahead market clearing. In certain examples, a plurality of threads of a software tool implementing a concurrent optimizer can be executed concurrently and sequentially to generate new solutions to a SCUC problem for an upcoming planning horizon. Data can be shared among the concurrently executing threads, such as intermediate/incumbent solutions and hints regarding the fixing of variables and constraints to reduce the size of the SCUC problem. In some examples, the threads are seeded with historical solutions from prior planning horizons. The software tool can select a best solution from the solutions generated by the threads, and determine dispatch instructions for a device coupled to the power grid for the upcoming planning horizon based at least in part on the selected solution.

Pan, Feng↗

TH-A-9A-06: Inverse Planning of Gamma Knife Radiosurgery Using Natural Physical Models

Purpose: Treatment-planning systems rely on computer intensive optimization algorithms in order to provide radiation dose localization. We are investigating a new optimization paradigm based on natural physical modeling and simulations, which tend to evolve in time and find the minimum energy state. In our research, we aim to match physical models with radiation therapy inverse planning problems, where the minimum energy state coincides with the optimal solution. As a prototype study, we have modeled the inverse planning of Gamma Knife radiosurgery using the dynamic interactions between charged particles and demonstrate the potential of the paradigm. Methods: For inverse planning of Gamma Knife radiosurgery: (1) positive charges are uniformly placed on the surface of tumors and critical structures. (2) The Gamma Knife dose kernels of 4mm, 8mm and 16mm radii are modeled as geometric objects with variable charges. (3) The number of shots per each kernel radii is obtained by solving a constrained integer-linear problem. (4) The shots are placed into the tumor volume and move under electrostatic forces. The simulation is performed until internal forces are zero or maximum iterations are reached. (5) Finally, non-negative least squares (NNLS) is used to calculate the beam-on times for each shot. Results: A 3D C-shaped tumor surrounding a spherical critical structure was used for testing the new optimization paradigm. These tests showed that charges spread out evenly covering the tumor while keeping distance from the critical structure, resulting in a high quality plan. Conclusion: We have developed a new paradigm for dose optimization based on the simulation of physical models. As prototype studies, we applied electrostatic models to Gamma Knife radiosurgery and demonstrated the potential of the new paradigm. Further research and fine-tuning of the model are underway. NSF CBET-0853157.

60 APPLIED LIFE SCIENCES↗

Poisson Log-Normal Process for Count Data Prediction

Modeling count data is important in physics and other scientific disciplines, where measurements often involve discrete, non-negative quantities such as photon or neutrino detection events. Traditional parametric approaches can be trained to generate integer-count predictions but may struggle with capturing complex, non-linear dependencies often observed in the data. Gaussian process (GP) regression provides a robust non-parametric alternative to modeling continuous data; however, it cannot generate integer outputs. We propose the Poisson Log-Normal (PoLoN) process, a framework that employs GP to model Poisson log-rates. As in GP regression, our approach relies on the correlations between data points captured via GP kernel structure rather than explicit functional parameterizations. We demonstrate that the PoLoN predictive distribution is Poisson-LogNormal and provide an algorithm for optimizing kernel hyperparameters. Furthermore, we adapt the PoLoN approach to the problem of detecting weak localized signals superimposed on a smoothly varying background - a task of considerable interest in many areas of science and engineering. Our framework allows us to predict the strength, location and width of the detected signals. We evaluate PoLoN's performance using both synthetic and real-world datasets, including the open dataset from CERN which was used to detect the Higgs boson at the Large Hadron Collider. Our results indicate that the PoLoN process can be used as a non-parametric alternative for analyzing, predicting, and extracting signals from integer-valued data.

Saha, Anushka [Rutgers U., Piscataway]↗