Search NASA⌕ Search

SEARCH · Search NASA

Results for “cutting planes”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Riemann–Hilbert Problems on a Cut Plane

We consider the Riemann–Hilbert-type boundary-value problems in the case of several unknown functions and obtain solvability conditions and index formulas for the linear conjugation problem, the Riemann–Hilbert problem, and the Riemann–Hilbert–Poincaré problem on a plane cut along several regular arcs in various weighted functional classes. We also examine the general differential boundary-value problem for analytic functions and boundary-value problems with shifts and complex conjugation on a cut plane.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Orbital Conflict: Cutting Planes for Symmetric Integer Programs

Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. Furthermore, the inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Cutting planes for the multistage stochastic unit commitment problem

As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Complementary Measurements of Residual Stresses Before and After Base Plate Removal in an Intricate Additively-Manufactured Stainless-Steel Valve Housing

Residual stress measurements using neutron diffraction and the contour method were performed on a valve housing made from 316 L stainless steel powder with intricate three-dimensional internal features using laser powder-bed fusion additive manufacturing. The measurements captured the evolution of the residual stress fields from a state where the valve housing was attached to the base plate to a state where the housing was cut free from the base plate. Making use of this cut, thus making it a non-destructive measurement in this application, the contour method mapped the residual stress component normal to the cut plane (this stress field is completely relieved by cutting) over the whole cut plane, as well as the change in all stresses in the entire housing due to the cut. The non-destructive nature of the neutron diffraction measurements enabled measurements of residual stress at various points in the build prior to cutting and again after cutting. Good agreement was observed between the two measurement techniques, which showed large, tensile build-direction residual stresses in the outer regions of the housing. The contour results showed large changes in multiple stress components upon removal of the build from the base plate in two distinct regions: near the plane where the build was cut free from the base plate and near the internal features that act as stress concentrators. These observations should be useful in understanding the driving mechanisms for builds cracking near the base plate and to identify regions of concern for structural integrity. Neutron diffraction measurements were also used to show the shear stresses near the base plate were significantly lower than normal stresses, an important assumption for the contour method because of the asymmetric cut.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗
DOE OSTI2020

Kirigami Engineering—Nanoscale Structures Exhibiting a Range of Controllable 3D Configurations

Abstract Kirigami structures provide a promising approach to transform flat films into 3D complex structures that are difficult to achieve by conventional fabrication approaches. By designing the cutting geometry, it is shown that distinct buckling‐induced out‐of‐plane configurations can be obtained, separated by a sharp transition characterized by a critical geometric dimension of the structures. In situ electron microscopy experiments reveal the effect of the ratio between the in‐plane cut size and film thickness on out‐of‐plane configurations. Moreover, geometrically nonlinear finite element analyses (FEA) accurately predict the out‐of‐plane modes measured experimentally, their transition as a function of cut geometry, and provide the stress–strain response of the kirigami structures. The combined computational–experimental approach and results reported here represent a step forward in the characterization of thin films experiencing buckling‐induced out‐of‐plane shape transformations and provide a path to control 3D configurations of micro‐ and nanoscale buckling‐induced kirigami structures. The out‐of‐plane configurations promise great utility in the creation of micro‐ and nanoscale systems that can harness such structural behavior, such as optical scanning micromirrors, novel actuators, and nanorobotics. This work is of particular significance as the kirigami dimensions approach the sub‐micrometer scale which is challenging to achieve with conventional micro‐electromechanical system technologies.

Zhang, Xu↗
DOE OSTI2018

Probabilistic N - k failure-identification for power systems

This work considers a probabilistic generalization of the N - k failure-identification problem in power transmission networks, where the probability of failure of each component in the network is known a priori and the goal of the problem is to find a set of k components that maximizes disruption to the system loads weighted by the probability of simultaneous failure of the k components. The resulting problem is formulated as a bilevel mixed-integer nonlinear program. Convex relaxations, linear approximations, and heuristics are developed to obtain feasible solutions that are close to the optimum. A general cutting-plane algorithm is proposed to solve the convex relaxation and linear approximations of the N - k problem. Extensive numerical results corroborate the effectiveness of the proposed algorithms on small-, medium-, and large-scale test instances; the test instances include the IEEE 14-bus system, the IEEE single-area and three-area RTS96 systems, the IEEE 118-bus system, the WECC 240-bus test system, the 1354-bus PEGASE system, and the 2383-bus Polish winter-peak test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Robust vehicle routing under uncertainty via branch-price-and-cut

Here, this paper contemplates how branch-price-and-cut solvers can be employed along with the robust optimization paradigm to address parametric uncertainty in the context of vehicle routing problems. In this setting, given postulated uncertainty sets for customer demands and vehicle travel times, one aims to identify a set of cost-effective routes for vehicles to traverse, such that the vehicle capacities and customer time window constraints are respected under any anticipated demand and travel time realization, respectively. To tackle such problems, we propose a novel approach that combines cutting-plane techniques with an advanced branch-price-and-cut algorithm. Specifically, we use deterministic pricing procedures to generate "partially robust" vehicle routes and then utilize robust versions of rounded capacity inequalities and infeasible path elimination constraints to guarantee complete robust feasibility of routing designs against demand and travel time uncertainty. In contrast to recent approaches that modify the pricing algorithm, our approach is both modular and versatile. It permits the use of advanced branch-price-and-cut technologies without significant modification, while it can admit a variety of uncertainty sets that are commonly used in robust optimization but could not be previously employed in a branch-price-and-cut setting.

42 ENGINEERING↗
DOE OSTI2025

XFEM Development for Modeling Crack Growth in Prototypical Welded Components

Nuclear power plant components are subjected to harsh operating environments that can lead to multiple degradation mechanisms in which fracture can play a prominent role. Predicting crack growth is important for assessing the integrity of welded components. The extended finite element method (XFEM) is an important tool for modeling such crack growth, and XFEM capabilities have been developed within the MOOSE framework. This report documents work in the MOOSE XFEM module to model fractures in three-dimensional representations of components using a topologically two-dimensional mesh to define cutting planes. Crack growth algorithms have been implemented to evolve the cutting mesh based on equations for stress corrosion cracking. Additionally, several usability and robustness improvements have been developed to enable three-dimensional fracture simulations. The cutting algorithms were demonstrated on a three-dimensional model of a prototypical reactor component undergoing stress corrosion cracking driven by idealized weld residual stresses. This is an incremental step toward using this capability to model more complex components with residual stresses computed through welding process simulations.

42 - ENGINEERING↗
DOE OSTI2018

Feasibility of Percutaneous Intrahepatic Split by Microwave Ablation (PISA) After Portal Vein Embolization for Hypertrophy of Future Liver Remnant: The Radiological Stage-1 ALPPS

PurposeTo assess the feasibility of radiological stage-1 ALPPS, associating liver partition and portal vein ligation for staged hepatectomy, by combining portal vein embolization (PVE) with percutaneous intrahepatic split by ablation (PISA).Materials and MethodsThree patients (mean age 65.0 ± 7.3 years) underwent PVE and PISA. PISA was performed 21 days after PVE by microwave ablation to create a continuous intrahepatic cutting plane. Abdominal CT examinations were performed before and after PVE and PISA. The future liver remnant (FLR) volume was calculated by semiautomatic segmentation, and increase was reported as a percentage of the pre-procedural volume. The FLR/body weight (FLR/BW) ratio was calculated; a ratio greater than 0.8% was considered sufficient for guaranteeing adequate liver function after surgery. The liver function before and after PISA was also evaluated by 99mTc-mebrofenin hepatobiliary scintigraphy. Patients’ laboratory tests, performance status, ability to walk were assessed before and after PVE and PISA procedures.ResultsNo procedure-related complications were recorded. The FLR volume increase in each patient was 42.0, 33.1 and 30.4% within 21 days of PVE and 109.3, 68.1 and 71.7% within 10 days after PISA. The FLR/BW ratios were 0.76, 0.66, 0.63% and 1.13, 0.83, 0.83% after PVE and PISA procedures, respectively. Two patients underwent successful right hepatectomy; in one patient, despite 1.13% FLR/BW, surgery was not performed because of the absolute rejection of blood transfusion due to the patient’s religious convictions.ConclusionRadiological stage-1 ALPPS is a feasible, minimally invasive option to be further investigated to become an effective alternative to surgical stage-1 ALPPS.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Parallel projection—An improved return mapping algorithm for finite element modeling of shape memory alloys

Here, we present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal/constitutive state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.

42 ENGINEERING↗
DOE OSTI2021

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗
DOE OSTI2020

Designing a drone delivery network with automated battery swapping machines

Drones are projected to alter last-mile delivery, but their short travel range is a concern. In this study, we propose a drone delivery network design using automated battery swapping machines (ABSMs) to extend ranges. The design minimizes the long-term delivery costs, including ABSM investment, drone ownership, and cost of the delivery time, and locates ABSMs to serve a set of customers. We build a mixed-integer nonlinear program that captures the nonlinear waiting time of drones at ABSMs. To solve the problem, we create an exact solution algorithm that finds the globally optimal solution using a derivative-supported cutting-plane method. To validate the applicability of our program, we conduct a case study on the Chicago Metropolitan area using cost data from leading ABSM manufacturer and geographical data from the planning and operations language for agent-based regional integrated simulation (more commonly known as POLARIS). A sensitivity analysis identifies that ABSM service times and costs are the key parameters impacting the long-term adoption of drone delivery.

25 ENERGY STORAGE↗
DOE OSTI2026

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↗
DOE OSTI2021

Efficient Topology Design Algorithms for Power Grid Stability

The dynamic response of power grids to small disturbances influences their overall stability. This letter examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes H 2 -norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. Finally, the efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

A robust approach to chance constrained optimal power flow with renewable generation

Optimal Power Flow (OPF) dispatches controllable generation at minimum cost subject to operational constraints on generation and transmission assets. The uncertainty and variability of intermittent renewable generation is challenging current deterministic OPF approaches. Recent formulations of OPF use chance constraints to limit the risk from renewable generation uncertainty, however, these new approaches typically assume the probability distributions which characterize the uncertainty and variability are known exactly. We formulate a robust chance constrained (RCC) OPF that accounts for uncertainty in the parameters of these probability distributions by allowing them to be within an uncertainty set. The RCC OPF is solved using a cutting-plane algorithm that scales to large power systems. We demonstrate the RRC OPF on a modified model of the Bonneville Power Administration network, which includes 2209 buses and 176 controllable generators. In conclusion, deterministic, chance constrained (CC), and RCC OPF formulations are compared using several metrics including cost of generation, area control error, ramping of controllable generators, and occurrence of transmission line overloads as well as the respective computational performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗