Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 37 records · Page 2

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↗

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↗

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↗

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↗

Characterizing detonator output using dynamic witness plates

A sub-microsecond, time-resolved micro-particle-image velocimetry (PIV) system is developed to investigate the output of explosive detonators. Detonator output is directed into a transparent solid that serves as a dynamic witness plate and instantaneous shock and material velocities are measured in a two-dimensional plane cutting through the shock wave as it propagates through the solid. For the case of unloaded initiators (e.g. exploding bridge wires, exploding foil initiators, etc.) the witness plate serves as a surrogate for the explosive material that would normally be detonated. The velocity-field measurements quantify the velocity of the shocked material and visualize the geometry of the shocked region. Furthermore, the time-evolution of the velocity-field can be measured at intervals as small as 10 ns using the PIV system. Current experimental results of unloaded exploding bridge wire output in polydimethylsiloxane (PDMS) witness plates demonstrate 20 MHz velocity-field sampling just 300 ns after initiation of the wire.

66↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: I. Model implementation

We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l 1 norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Numerical estimation of the relative entropy of entanglement

We propose a practical algorithm for the calculation of the relative entropy of entanglement (REE), defined as the minimum relative entropy between a state and the set of states with positive partial transpose. Our algorithm is based on a practical semidefinite cutting plane approach. In low dimensions the implementation of the algorithm in matlab provides an estimation for the REE with an absolute error smaller than 10{sup -3}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dependence on pressure of the refractive indices of wurtzite ZnO, GaN, and AlN

We have measured both the ordinary and extraordinary refractive index of m-plane cuts of wurtzite ZnO, GaN, and AlN single crystals at room temperature and as a function of hydrostatic pressure up to 8 GPa. For that purpose we have developed an alternative optical interference method, called bisected-beam method, which leads, in general, to high contrast interference fringes. Its main feature, however, is to be particularly suitable for high pressure experiments with the diamond anvil cell, when the refractive index of the sample is low and similar to that of diamond and/or the pressure transmitting medium, as is the case here. For all three wide-gap materials we observe a monotonous decrease of the ordinary and extraordinary refractive indices with increasing pressure, being most pronounced for GaN, less marked for ZnO, and the smallest for AlN. The frequency dependence of the refractive indices was extrapolated to zero energy using a critical-point-plus-Lorentz-oscillator model of the ordinary and extraordinary dielectric function. In this way, we determined the variation with pressure of the electronic part (no-phonon contribution) of the static dielectric constant epsilon(infinity). Its volume derivative, r = d ln epsilon(infinity)/d ln V, serves as single scaling coefficient for comparison with experimental and/or theoretical results for other semiconductors, regarding the pressure effects on the dielectric properties. We have obtained an ordinary/extraordinary average value (r) over bar of 0.49(15) for ZnO, 1.22(9) for GaN, and 0.32(4) for AlN. With the values for the ordinary and extraordinary case being within experimental uncertainty, there is thus no apparent change in dielectric anisotropy under pressure for these wurtzite semiconductors. Results are discussed in terms of the pressure-dependent electronic band structure of the materials.

Goni, AR↗

Structure of an Exploding Laser-Produced Plasma

We describe the first-ever volumetric, time-resolved measurements performed with a moving probe within an expanding dense plasma, embedded in a background magnetized plasma. High-resolution probe measurements of the magnetic field and floating potential in multiple 2D cut planes combined with a 1 Hz laser system reveal complex three-dimensional current systems within the expanding plasma. Static ({omega}{sub real}=0) flutelike density striations are observed at the leading edge of the plasma, which are correlated to variations in the current layer at the edge of the expanding plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

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↗

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↗

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Zhang, Jiang↗

Roughness of the SiC/SiO{sub 2} vicinal interface and atomic structure of the transition layers

The SiC/SiO{sub 2} interface is generally considered to be the cause for the reduced electron mobility of SiC power devices. Previous studies have shown a correlation between the mobility and the transition layer width at the SiC/SiO{sub 2} interface. The authors investigated this interface with atomic resolution Z-contrast imaging and electron energy-loss spectroscopy, and discovered that this transition region was due to the roughness of the vicinal interface. The roughness of a vicinal interface consisted of atomic steps and facets deviating from the ideal off-axis cut plane. The authors conclude that this roughness is limiting the mobility in the channels of SiC MOSFETs.

36 MATERIALS SCIENCE↗

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

Coiled Fiber Pulsed Laser Simulator

This suite of codes simulates the transient output pulse from an optically-pumped coiled fiber amplifier. The input pulse is assumed to have a Gaussian time dependence and a spatial dependence that may be Gaussian or an eigenmode of the straight of bent fiber computed using bend10 or bend20. Only one field component is used (semivectorial approximation). The fully-spatially-dependent fiber gain profile is specified is subroutines "inversion" and "interp_inversion" and is presently read from a data file, although other means of specifying fiber gain could be realized through modification of these subroutines. The input pulse is propagated through the fiber, including the following physical effects: spatial and temporal gain saturation, self-focusing, bend losses, and confinement from a user-defined fiber index profile. The user can follow the propagation progress with 3D graphics that show an intensity profile via user-modifiable cutting planes through the time space axes. A restart capability is also included. Approximate solutions in the frequency domain may be obtained much faster using the auxiliary codes bendbpm10 (full vector), bendbpm20 (semivectoral), and bendbpm21 (semivectoral with gain sheet approximation for gain and self-focusing). These codes all include bend loss and spatial (but not temporal) gain saturation.

Hadley, G.↗

Laparoscopic Isolated Total Caudate Lobectomy for Hepatocellular Carcinoma Located in the Paracaval Portion of the Cirrhotic Liver

Background: Despite the widespread use of laparoscopic hepatectomies in past decades, laparoscopic isolated total caudate lobectomy for hepatocellular carcinoma (HCC) remains challenging,{sup 1,2} especially for patients with cirrhosis. Moreover, a laparoscopic isolated total caudate lobectomy for HCC originating in the paracaval portion of the caudate lobe is very rare. We herein present a video showing laparoscopic total caudate lobectomy for a cirrhotic patient with HCC located in the paracaval portion of the caudate lobe. Methods: A 58-year-old woman who suffered from hepatitis C virus-related cirrhosis was admitted to our institution. The preoperative computed tomography showed a 2.5 × 2.0 cm liver mass located in segment I that was very close to the right hepatic pedicle. Although her liver function was Child–Pugh A, the indocyanine green (ICG)-15 test was high at 10.9%. Right hepatectomy plus caudate lobectomy was not adopted because of the severe cirrhosis and the elevated ICG-15. Thus, laparoscopic isolated total caudate lobectomy was contemplated. Results: The patient was placed in the supine position. After full mobilization, the caudate lobe was exposed. The third porta of the liver was then dissected and the short hepatic veins were controlled with clips and LigaSure. The dissection was finished when the whole third porta of the liver was freed. Subsequently, the portal branches to the caudate lobe were ligated and cut. The combination between the left- and right-sided laparoscopic approaches was used to transect liver parenchyma. The superficial parenchyma was divided using an harmonic scalpel, while the deeper tissue was divided using a Cavitron ultrasonic aspirator (CUSA). The Pringle maneuver was used intermittently during the parenchymal transection as necessary. In the left-sided approach, the caudate lobe was resected along the left and middle hepatic vein toward the right side, to expose the dorsal semicircle of the right hepatic vein. In the right-sided approach, the resection started from the right border of the process portion to the root of the right hepatic vein in the cranial direction. Finally, the whole caudate lobe was resected and the three main hepatic veins were exposed on the cutting plane. The specimen was removed from suprapubic incision. The operative time was 300 min and the total Pringle time was 50 min. The postoperative course was uneventful. Conclusions: A laparoscopic isolated total caudate lobectomy for HCC located in the paracaval portion of the cirrhotic liver seems to be feasible and safe in selected patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗