Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical programming formulations”

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 289 records · Page 16

TIES for Dummies 3rd Edition (Technology Identification, Evaluation, and Selection) Basic how to's to implement the TIES method

The TIES method is a forecasting environment whereby the decision-maker has the ability to easily assess and trade-off the impact of various technologies without sophisticated and time-consuming mathematical formulations. TIES provides a methodical approach where technically feasible alternatives can be identified with accuracy and speed to reduce design cycle time, and subsequently, life cycle costs, and was achieved through the use of various probabilistic methods, such as Response Surface Methodology and Monte Carlo Simulations. Furthermore, structured and systematic techniques are utilized from other fields to identify possible concepts and evaluation criteria by which comparisons can be made. This objective is achieved by employing the use of Morphological Matrices and Multi-Attribute Decision Making techniques. Through the execution of each step, a family of design alternatives for a given set of customer requirements can be identified and assessed subjectively or objectively. This methodology allows for more information (knowledge) to be brought into the earlier phases of the design process and will have direct implications on the affordability of the system. The increased knowledge allows for optimum allocation of company resources and quantitative justification for program decisions. Finally, the TIES method provided novel results and quantitative justification to facilitate decision making in the early stages of design so as to produce affordable and quality products.

Kirby, Michelle R.↗

A mixed formulation of the plane-stress problem to facilitate reuse of constitutive models in finite-element programs

Here, the plane-stress assumption can be challenging to support in a finite element program because it traditionally requires separate implementations of constitutive models than those intended for three-dimensional or two-dimensional plane-strain simulations. As a solution to this issue, this paper presents a method to solve the plane-stress problem using a mixed formulation. In this formulation, the out-of-plane strain is treated as a field variable that is solved for in addition to the standard in-plane displacement variables, in a manner that weakly enforces the condition that the out-of-plane stress is zero. The proposed formulation is non-intrusive, requiring no modifications to the constitutive models in contrast to the conventional plane-stress formulation. The proposed mixed formulation has been benchmarked against analytical solutions and numerical solutions, with good performance and accuracy.

97 MATHEMATICS AND COMPUTING↗

Optimal economic operation of liquid petroleum products pipeline systems

The majority of overland transport needs for crude petroleum and refined petroleum products are met using pipelines. Numerous studies have developed optimization methods for design of these systems in order to minimize construction costs while meeting capacity requirements. Here, we formulate problems to optimize the operations of existing single liquid commodity pipeline systems subject to physical flow and pump engineering constraints. The objectives are to maximize the economic value created for users of the system and to minimize operating costs. We present a general computational method for this class of continuous, non-convex nonlinear programs, and examine the use of pump operating settings and flow allocations as decision variables. Furthermore, the approach is applied to compute optimal operating regimes and perform engineering economic sensitivity analyses for a case study of a crude oil pipeline developed using publicly available data.

02 PETROLEUM↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Demand Response Operation of Electricity-Intensive Chemical Processes for Reduced Greenhouse Gas Emissions: Application to an Air Separation Unit

A recent push for reduced greenhouse gas (GHG) emissions has led (in part) to the addition of renewable electricity generation sources to the power generation mix. Renewables such as wind and solar are desynchronized from grid demand, requiring the use of fossil fuels to bridge the gap. We propose a novel production scheduling formulation, emissions-minimizing production (EMP), which utilizes time-based information on the nature of the power generation mix to lower GHG emissions related to the transmission and generation of electricity for industrial users. We demonstrate the application of EMP on a single-column air separation unit. The scheduling problem is cast as a mixed integer linear program that can be solved in a practical amount of time. Extensive numerical studies are used to place EMP in the context of other production scheduling methods (such as demand response), and demonstrate its potential for significant reductions in GHG emissions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal operations of a nuclear-based integrated energy system: A mixed integer program approach

A nuclear-based integrated energy system (IES), consisting of multiple carbon-free energy generation and conversion technologies to meet heterogeneous end-use demands, offers a promising approach to decarbonizing the U.S. economy. Operating such an IES is challenging due to its complexity and the diverse end-use demands, such as heating and electricity. This paper aims to address the optimal operation of an IES composed of a small modular reactor (SMR), a steam manifold, a balance of plant (BOP), a high-temperature steam electrolysis (HTSE) system, a district heating (DH) network, and electrical grids. We formulate the system’s operation as a mixed integer linear programming (MILP) problem to maximize net revenues from sales of electricity and hydrogen. To evaluate the efficacy of the proposed model, we conduct a 24-hour simulation considering day-ahead (DA) electricity prices from CAISO and a varying DH demand profile with hourly resolution. The simulation results show that our model effectively optimizes the operation by selling electricity during on-peak periods and purchasing electricity for hydrogen production during off-peak periods, while satisfying operating constraints within the IES.

08 HYDROGEN↗

Application of remote sensing for prediction and detection of thermal pollution, phase 2

The development of a predictive mathematical model for thermal pollution in connection with remote sensing measurements was continued. A rigid-lid model has been developed and its application to far-field study has been completed. The velocity and temperature fields have been computed for different atmospheric conditions and for different boundary currents produced by tidal effects. In connection with the theoretical work, six experimental studies of the two sites in question (Biscayne Bay site and Hutchinson Island site) have been carried out. The temperature fields obtained during the tests at the Biscayne Bay site have been compared with the predictions of the rigid-lid model and these results are encouraging. The rigid-lid model is also being applied to near-field study. Preliminary results for a simple case have been obtained and execution of more realistic cases has been initiated. The development of a free-surface model also been initiated. The governing equations have been formulated and the computer programs have been written.

Veziroglu, T. N.↗

An ILP based Algorithm for Optimal Customer Selection for Demand Response in SmartGrids

Demand Response (DR) events are initiated by utilities during peak demand periods to curtail consumption. They ensure system reliability and minimize the utility’s expenditure. Selection of the right customers and strategies is critical for a DR event. An effective DR scheduling algorithm minimizes the curtailment error which is the absolute difference between the achieved curtailment value and the target. State-of-the-art heuristics exist for customer selection, however their curtailment errors are unbounded and can be as high as 70%. In this work, we develop an Integer Linear Programming (ILP) formulation for optimally selecting customers and curtailment strategies that minimize the curtailment error during DR events in SmartGrids. We perform experiments on real world data obtained from the University of Southern California’s SmartGrid and show that our algorithm achieves near exact curtailment values with errors in the range of 10 -7 to 10 -5 , which are within the range of numerical errors. We compare our results against the state-of-the-art heuristic being deployed in practice in the USC SmartGrid. We show that for the same set of available customer strategy pairs our algorithm performs 103 to 107 times better in terms of the curtailment errors incurred.

97 MATHEMATICS AND COMPUTING↗

Optimal Black Start Allocation for Power System Restoration

Equipment failures, operator errors, natural disasters and cyber-attacks can and have caused extended blackouts of the electric grid. Even though such events are rare, preparedness for them is critical because extended power outages endanger human lives, compromise national security, or result in economic losses of billions of dollars. Since most of the generating units cannot restart without connecting to an energized grid, the system operator relies on a few units with the ability to start autonomously, called Black Start (BS) units, to restore the power system. Allocating and maintaining these units is costly and can severely impact the restoration security and time. We formulate an optimization problem to optimally allocate BS units in the grid, while simultaneously optimizing over the restoration sequence. We extend existing optimal allocation models by including grid considerations such as active power nodal balance, transmission switching, nodal reactive power support and voltage limits. In order to aid the branch and bound tree that solves the resulting large scale mixed integer program, we propose a randomized heuristic that is executed multiple times in parallel on a high-performance computing environment to find feasible solutions. Here, we proceed to solve the IEEE-39, the IEEE-118, and a simplified WECC system with 225 nodes and 136 generators to near optimality.

97 MATHEMATICS AND COMPUTING↗

Advanced Technology System Scheduling Governance Model

In the fall of 2005, the Advanced Simulation and Computing (ASC) Program appointed a team to formulate a governance model for allocating resources and scheduling the stockpile stewardship workload on ASC capability systems. This update to the original document takes into account the new technical challenges and roles for advanced technology (AT) systems and the new ASC Program workload categories that must be supported. The goal of this updated model is to effectively allocate and schedule AT computing resources among all three National Nuclear Security Administration (NNSA) laboratories for weapons deliverables that merit priority on this class of resource. The process outlined below describes how proposed work can be evaluated and approved for resource allocations while preserving high effective utilization of the systems. This approach will provide the broadest possible benefit to the Stockpile Stewardship Program (SSP).

97 MATHEMATICS AND COMPUTING↗

Solar Field Layout and Aimpoint Strategy Optimization

The existing methods that determine heliostat aiming strategies for concentrating solar power (CSP) central receiver plants typically use heuristics and/or are computationally expensive, and they lack flexibility for different desired flux profiles and receiver geometries. Because of the interaction between layout and aimpoint strategy, considering the former without accounting for the latter may yield solutions with superfluous heliostats that cannot be used efficiently without compromising receiver flux constraints. To that end, we develop a software decision tool that uses innovative optimization methods to both optimize aimpoint strategies and improve candidate layouts for the solar collection field of a CSP central receiver plant. A CSP plant’s effectiveness relies on the optical efficiency of the solar field, which may be limited by losses due to (i) the cosine effect, (ii) atmospheric attenuation, (iii) interference (i.e., shading and blocking) between heliostats, (iv) spillage as a result of heliostat positioning and geometry, and (iv) some heliostats’ inability to direct irradiance to the receiver without damage due to excessive thermal flux. The goal of this work is to obtain optimized aiming strategies and improved solar field layouts that reduce capital cost and increase field optical efficiency and utilization, while meeting the power requirements of a given CSP receiver design. We formulate the aimpoint optimization problem as a mixed-integer linear programming model, which we then decompose into submodels that we solve in parallel. The decomposition subdivides the solar field into sections, and aimpoint strategies for each section are obtained independently of the others. To improve existing layouts, we develop a utilization-weighted efficiency metric that we use to relocate heliostats to sections of the solar field with similar efficiency and higher utilization. Finally, to connect our software to high-fidelity flux models, we develop a Python application programming interface for SolarPILOT, a mature software package that characterizes solar field performance and generates the heliostat layouts and flux maps that serve as input to our models.

14 SOLAR ENERGY↗

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗

Developing a Hybrid Electric Vehicle Eco-Cooperative Adaptive Cruise Control System at Signalized Intersections.

This study develops an eco-driving strategy for hybrid electric vehicles (HEVs) in the vicinity of signalized intersections, entitled HEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The proposed system computes real-time, energy-optimized vehicle trajectories using HEV vehicle dynamics and energy consumption models. In the proposed system, a simple HEV energy model is used to compute the instantaneous fuel consumption. This HEV energy model is selected since it is general, transferable, and can be easily used to compute instantaneous energy consumption levels for HEVs without the additional input of vehicle engine data or complicated power control strategies. In addition, a vehicle dynamics model is used to capture the relationship between speed, acceleration level, and tractive/resistance forces on vehicles. The energy-optimum problem is formulated as an optimization problem with constraints, which is solved using a moving-horizon dynamic programming approach. The proposed HEV Eco-CACC-I system was tested to evaluate its performance for various speed limits, roadway grades, and signal timings. Lastly, the proposed HEV controller was implemented in a microscopic traffic simulation software to test its network-wide performance. The test results from an arterial corridor with three signalized intersections demonstrate that the proposed system can effectively reduce stop-and-go traffic in the vicinity of signalized intersections producing savings of 7.4% in energy consumption, 5.8% in traffic delay and 23% vehicle stops, respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Formal Requirements-Based Programming for Complex Systems

Computer science as a field has not yet produced a general method to mechanically transform complex computer system requirements into a provably equivalent implementation. Such a method would be one major step towards dealing with complexity in computing, yet it remains the elusive holy grail of system development. Currently available tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The gap that such tools and methods leave unfilled is that the formal models cannot be proven to be equivalent to the system requirements as originated by the customer For the classes of complex systems whose behavior can be described as a finite (but significant) set of scenarios, we offer a method for mechanically transforming requirements (expressed in restricted natural language, or appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations. While other techniques are available, this method is unique in offering full mathematical tractability while using notations and techniques that are well known and well trusted. We illustrate the application of the method to an example procedure from the Hubble Robotic Servicing Mission currently under study and preliminary formulation at NASA Goddard Space Flight Center.

Rash, James L.↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

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↗

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗

Communication-Constrained Expansion Planning for Resilient Distribution Systems

Distributed generation and remotely controlled switches have emerged as important technologies to improve the resiliency of distribution grids against extreme weather-related disturbances. Therefore it becomes important to study how best to place them on the grid in order to meet a resiliency criteria, while minimizing costs and capturing their dependencies on the associated communication systems that sustain their distributed operations. This paper introduces the Optimal Resilient Design Problem for Distribution and Communication Systems (ORDPDC) to address this need. The ORDPDC is formulated as a two-stage stochastic mixed-integer program that captures the physical laws of distribution systems, the communication connectivity of the smart grid components, and a set of scenarios that specifies which components are affected by potential disasters. The paper proposes an exact branch-and-price algorithm for the ORDPDC that features a strong lower bound and a variety of acceleration schemes to address degeneracy. The ORDPDC model and branch-and-price algorithm were evaluated on a variety of test cases with varying disaster intensities and network topologies. The results demonstrate the significant impact of the network topologies on the expansion plans and costs, as well as the computational benefits of the proposed approach.

97 MATHEMATICS AND COMPUTING↗