Search NASA⌕ Search

SEARCH · Search NASA

Results for “branch and bound algorithm”

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.

14 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Learning to Branch with Interpretable Machine Learning Models

Machine learning is being increasingly used in improving decisions made within branch-and-bound algorithms for solving mixed-integer programs (MIPs). Branching is a key component in branch-and-bound algorithms, this work presents IDAES-core project update on building simple and interpretable machine learning models for branching and improving decision-making tools applied for the optimization of advanced energy systems.

Bayramoglu, Selin↗
DOE OSTI2023

Material Identification From Radiographs Without Energy Resolution

We propose a method for performing material identification from radiographs without energy-resolved measurements. Material identification has a wide variety of applications, including in biomedical imaging, nondestructive testing, and security. While existing techniques for radiographic material identification make use of dual energy sources, energy-resolving detectors, or additional (e.g., neutron) measurements, such setups are not always practical— requiring additional hardware and complicating imaging. We tackle material identification without energy resolution, allowing standard X-ray systems to provide material identification information without requiring additional hardware. Assuming a setting where the geometry of each object in the scene is known and the materials come from a known set of possible materials, we pose the problem as a combinatorial optimization with a loss function that accounts for the presence of scatter and an unknown gain and propose a branch and bound algorithm to efficiently solve it. We present experiments on both synthetic data and real, experimental data with relevance to security applications— thick, dense objects imaged with MeV X-rays. We show that material identification can be efficient and accurate, for example, in a scene with three shells (two copper, one aluminum), our algorithm ran in six minutes on a consumer-level laptop and identified the correct materials as being among the top 10 best matches out of 8,000 possibilities.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Systemwide Planning with a Branch-and-Price Algorithm for Pavement-Marking Assessment Data Collection via the Mobile Retroreflectivity Unit Routing Model

The visibility of pavement markings is one of the most critical factors for traffic safety, and a periodical assessment plan is crucial for maintaining this function. Traditional assessment methods, such as visual windshield surveys or manual testing using handheld devices, are unsafe, time-consuming, and labor-intensive. In recent years, transportation agencies have begun to adopt the use of mobile retroreflectivity units (MRUs) for condition assessment of pavement markings. MRUs, different from other manual methods, can be utilized to collect large-scale retroreflectivity data in an efficient manner. However, no relevant research has yet proposed a mathematical optimization model for arranging the evaluation schedule and paths of MRUs. This study aims to propose a MRU routing model, and an efficient solution methodology. A branch-and-price algorithm, including column generation and branch-and-bound, was implemented. Computational experiments have been conducted based on actual tasks from the Florida MRU program for validation. In conclusion, results show that the proposed solution methodology with a set partitioning model in this study not only finds the optimal solution for problems with tasks less than 60, but also effectively narrows the solution gap to be within 1.0% for problems with tasks less than 131.

42 ENGINEERING↗
DOE OSTI2024

Compressing branch-and-bound trees

A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certifies a dual bound, can we obtain a smaller tree with the same (or stronger) bound by either (1) applying a different disjunction at some node in T or (2) removing leaves from T? Here we believe such post-hoc analysis of BB trees may assist in identifying helpful general disjunctions in BB algorithms. We initiate our study by considering computational complexity and limitations of TCP. We then conduct experiments to evaluate the compressibility of realistic branch-and-bound trees generated by commonly-used branching strategies, using both an exact and a heuristic compression algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2023

Barium stars as tracers of s -process nucleosynthesis in AGB stars: II. Using machine learning techniques on 169 stars

Barium (Ba) stars are characterised by an abundance of heavy elements made by the slow neutron capture process (s-process). This peculiar observed signature is due to the mass transfer from a stellar companion, bound in a binary stellar system, to the Ba star observed today. The signature is created when the stellar companion is an asymptotic giant branch (AGB) star. We aim to analyse the abundance pattern of 169 Ba stars using machine learning techniques and the AGB final surface abundances predicted by the FRUITY and Monash stellar models. We developed machine learning algorithms that use the abundance pattern of Ba stars as input to classify the initial mass and metallicity of each Ba star’s companion star using stellar model predictions. We used two algorithms. The first exploits neural networks to recognise patterns, and the second is a nearest-neighbour algorithm that focuses on finding the AGB model that predicts the final surface abundances closest to the observed Ba star values. In the second algorithm, we included the error bars and observational uncertainties in order to find the best-fit model. The classification process was based on the abundances of Fe, Rb, Sr, Zr, Ru, Nd, Ce, Sm, and Eu. We selected these elements by systematically removing s-process elements from our AGB model abundance distributions and identifying the elements whose removal had the biggest positive effect on the classification. We excluded Nb, Y, Mo, and La. Our final classification combined the output of both algorithms to identify an initial mass and metallicity range for each Ba star companion. With our analysis tools, we identified the main properties for 166 of the 169 Ba stars in the stellar sample. The classifications based on both stellar sets of AGB final abundances show similar distributions, with an average initial mass of M = 2.23 M ⊙ and 2.34 M ⊙ and an average [Fe/H] = –0.21 and –0.11, respectively. We investigated why the removal of Nb, Y, Mo, and La improves our classification and identified 43 stars for which the exclusion had the biggest effect. We found that these stars have statistically significant and different abundances for these elements compared to the other Ba stars in our sample. We discuss the possible reasons for these differences in the abundance patterns.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Bridging the gap: Deploying AI-based Models in Real-Time Fusion Plasma Control Systems

Achieving reliable real-time control in fusion plasma experiments requires strict timing guarantees across entire control algorithms. In earlier work by Abbate et al. (2023), we demonstrated the feasibility of neural-network-based control algorithms on the DIII-D tokamak using the internally developed open-source Keras2C library for model conversion into C (Conlin et al. (2021)). However, the initial implementations relied on data buffering and branching logic outside the neural network code, causing variability in execution times. Subsequent deployments on DIII-D and KSTAR—including the RTCAKENN algorithm for kinetic profile reconstruction—proved that minimizing branching and buffering throughout the pipeline yields consistent millisecond-level cycle times under real experimental conditions (Shousha et al. (2023)). However, keeping pace with rapidly evolving AI frameworks (e.g. PyTorch) is challenging. Finally, we, therefore, propose a community-driven open-source effort to expand the tool, enabling real-time deployment across diverse systems that require strictly bounded execution times.

AI-based models↗
DOE OSTI2026

Discovery and Spectroscopic Characterization of a Distant, Compact Milky Way Satellite in Gemini

We present the discovery of a compact Milky Way satellite in the constellation of Gemini. This system was discovered by cross-matching detections from two independent search algorithms applied to Blanco/DECam data from the third data release of the DECam Local Volume Exploration survey (DELVE DR3), and confirmed with deeper imaging from Gemini/GMOS-N. Based on these data, we determine that the system is an ultra-faint ($M_V = -2.1^{+0.4}_{-0.6}$), compact ($r_{1/2} = 8.6^{+1.4}_{-1.2}$ pc) system located at a heliocentric distance of $120^{+7}_{-6}$ kpc. These physical properties place the system in the regime of ambiguous, ultra-faint compact Milky Way halo satellites that cannot be confidently classified as dwarf galaxies or star clusters from morphology alone; we therefore name the system DELVE 8/Gemini I. From medium-resolution Keck/DEIMOS spectroscopy, we securely identify four members including two blue horizontal branch stars, confirming the system as a bound satellite moving at a mean radial velocity of $v_{\rm hel} = -82.7^{+3.7}_{-3.9} {\rm km\,s}^{-1}$. We also use these spectra to place an upper limit of $\rm [Fe/H] \lesssim -2.5$ on the metallicity of DELVE 8/Gemini I's brightest star, supporting the classification of the system as either an ancient star cluster or ultra-faint dwarf galaxy. The discovery of faint, distant systems similar to DELVE 8/Gemini I is expected to become more common with upcoming surveys.

Overdeck, K. [Chicago U., Astron. Astrophys. Ctr.;↗
DOE OSTI2024

Advanced Method Optimization for Sampling and Analysis Instrumentation

This work presents a generalized approach for analytical method optimization that branches the gap between techniques historically employed and accurate modern optimization techniques suitable for various applications. The novelty of the described strategy is the utilization of multivariate, multiobjective optimization with Karush-Kuhn-Tucker conditions to bound the optimization space to solutions within the physical limitations of instrumentation. Briefly, the basic steps outlined in this paper are to (1) determine the objective(s) that should be maximized or minimized based on the goals of the analytical application, (2) conduct a screening experiment, (3) perform ANOVA to determine the parameters which have a statistically significant effect on the objective, (4) conduct an experiment (e.g., Box-Behnken design) to collect data for fitting the objective equation, and (5) determine the physical constraints of the parameters and solve the Lagrangian to determine the optimal method parameters. A broad approach to optimization target selection allows for robust method tuning to develop improved data sets amenable for chemometrics and machine learning algorithm development. Gas chromatography-mass spectrometry was selected as a use case due to its broad use across scientific fields and time-consuming method development involving numerous parameters. In conclusion, this strategy can reduce the cost of research, improve data quality, and enable the rapid development of new analytical technique.

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

Constraints on the normal branch of DGP gravity from SPT galaxy clusters with DES and HST weak-lensing mass calibration and from P l a n c k PR4 CMB anisotropies

We present constraints on the normal branch of the Dvali-Gabadadze-Porrati (nDGP) braneworld gravity model from the abundance of massive galaxy clusters. On scales below the nDGP crossover scale r c , the nDGP model features an effective gravitylike fifth force that alters the growth of structure, leading to an enhancement of the halo mass function (HMF) on cluster scales. The enhanced cluster abundance allows for constraints on the nDGP model using cluster samples. We employ the South Pole Telescope (SPT) cluster sample, selected through the thermal Sunyaev-Zel’dovich effect with the SPT and with mass calibration using weak-lensing data from the Dark Energy Survey (DES) and the Hubble Space Telescope (HST). The cluster sample contains 1,005 clusters with redshifts 0.25 < z < 1.78 , which are confirmed with the multicomponent matched filter algorithm using optical and near-infrared data. Weak-lensing data from DES and HST enable a robust mass measurement of the cluster sample. We use DES Year 3 data for 688 clusters with redshifts z < 0.95 , and HST data for 39 clusters with redshifts 0.6 < z < 1.7 . We account for the enhancement in the HMF through a semi-analytic correction factor to the standard cosmology HMF derived from the spherical collapse model in the nDGP model. We then further calibrate this model using N -body simulations. In addition, for the first time, we analyze the primary CMB temperature and polarization anisotropy measurements from Planck PR4 within the nDGP model. We obtain a competitive constraint from the joint analysis of the SPT cluster abundance with the Planck PR4 data, and report an upper bound of 1 / H 0 r c < 1.41 at 95% when assuming a cosmology with massive neutrinos.

Vogt, S. M.L. [Munich U. Observ.; LMU Munich (main↗