Search NASA⌕ Search

SEARCH · Search NASA

Results for “nonlinear programming problem”

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

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗

DEPLOYING FAST CHARGING INFRASTRUCTURE FOR ELECTRIC VEHICLES IN URBAN NETWORKS: AN ACTIVITY-BASED APPROACH

This paper explores an important problem under the domain of network modeling, the optimal configuration of charging infrastructure for electric vehicles (EVs) in urban networks considering EV users' daily activities and charging behavior. This study proposes a charging behavior simulation model considering different initial state of charge (SOC), travel distance, availability of home chargers, and the daily schedule of trips for each traveler. The proposed charging behavior simulation model examines the complete chain of trips for EV users as well as the interdependency of trips traveled by each driver. The problem of finding the optimum charging configuration is then formulated as a mixed-integer nonlinear programming problem that considers the dynamics of travel time and travel distance, the interdependency of trips made by each driver, limited range of EVs, remaining battery capacity for recharging, waiting time in queue, and detour to access a charging station. This problem is solved using a metaheuristic approach for a large-scale case network. A series of examples are presented to demonstrate the model efficacy and explore the impact of energy consumption on the final SOC and the optimum charging infrastructure.

Chain of Trips↗

Algorithmic Perspectives on Problem Formulations in MDO

This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem.

Alexandrov, Natalia M.↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

An active set algorithm for tracing parametrized optima

Optimization problems often depend on parameters that define constraints or objective functions. It is often necessary to know the effect of a change in a parameter on the optimum solution. An algorithm is presented here for tracking paths of optimal solutions of inequality constrained nonlinear programming problems as a function of a parameter. The proposed algorithm employs homotopy zero-curve tracing techniques to track segments where the set of active constraints is unchanged. The transition between segments is handled by considering all possible sets of active constraints and eliminating nonoptimal ones based on the signs of the Lagrange multipliers and the derivatives of the optimal solutions with respect to the parameter. A spring-mass problem is used to illustrate all possible kinds of transition events, and the algorithm is applied to a well-known ten-bar truss structural optimization problem.

Rakowska, J.↗

Joint Optimization for Transport and Bucket Loading Phases of Automated Wheel Loaders

This article investigates optimization of fuel-efficiency and productivity for automated wheel loaders. A control-oriented model for both the transport phase and bucket loading phase is proposed. Here, the vehicle model includes an automatic gear shift schedule that can be incorporated into the optimization problem. Based on the model, the multistage optimization problem is formulated to simultaneously consider all phases of a short cycle with physical constraints. Cycle time and fuel efficiency are used as the weighted performance indexes in a multiobjective cost function. Bucket fill factor is included as a constraint during the bucket loading phase. A nonlinear programming problem is created with collocation using MATLAB and CasADi. The optimization solver IPOPT solves the problem to obtain the optimal state and control trajectories, which can be used as a reference for automated wheel loaders or even as a driver advisory for human-driven wheel loaders.

42 ENGINEERING↗

TAS: 89 0227: TAS Recovery Act - Optimization and Control of Electric Power Systems: ARRA

The name SuperOPF is used to refer several projects, problem formulations and soft-ware tools intended to extend, improve and re-define some of the standard methods of optimizing electric power systems. Our work included applying primal-dual interior point methods to standard AC optimal power flow problems of large size, as well as extensions of this problem to include co-optimization of multiple scenarios. The original SuperOPF problem formulation was based on co-optimizing a base scenario along with multiple post-contingency scenarios, where all AC power flow models and constraints are enforced for each, to find optimal energy contracts, endogenously determined locational reserves and appropriate nodal energy prices for a single period optimal power flow problem with uncertainty. This led to example non-linear programming problems on the order of 1 million constraints and half a million variables. The second generation SuperOPF formulation extends this by adding multiple periods and multiple base scenarios per period. It also incorporates additional variables and constraints to model load following reserves, ramping costs, and storage resources. A third generation of the multi-period SuperOPF, adds both integer variables and a receding horizon framework in which the problem type is more challenging (mixed integer), the size is even larger, and it must be solved more frequently, pushing the limits of currently available algorithms and solvers. The consideration of transient stability constraints in optimal power flow (OPF) problems has become increasingly important in modern power systems. Transient stability constrained OPF (TSCOPF) is a nonlinear optimization problem subject to a set of algebraic and differential equations. Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability in OPF. To handle the dynamics in TSCOPF, the set of differential equations can be approximated or converted into equivalent algebraic equations before they are included in an OPF formulation. In Chapter 4, a rigorous evaluation of using a predefined and fixed threshold for rotor angles as a mean to determine transient stability of the system is developed. TSCOPF can be modeled as a large-scale nonlinear programming problem including the constraints of differential-algebraic equations (DAE). Solving a TSCOPF problem can be challenging due to (i) the differential-equation constraints in an optimization problem, (ii) the lack of a true analytical expression for transient stability constraint in OPF. Unfortunately, even the current best TSCOPF solvers still suffer from the curse of dimensionality and unacceptable computational time, especially for large-scale power systems with multiple contingencies. In chapter 5, thse issues will be addressed and a new method to incorporate the transient stability constraints will be presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Applications of Wireless Sensor Networks for Area Coverage in Microgrids

Area coverage is a critical issue which will have a major impact on the sensing quality over targeted regions in wireless sensor networks. This paper studies the area coverage problem (ACP) with non-penetrable obstacles in microgrids, where a sensor cannot be deployed or sensing signals cannot pass through. The target coverage region is discretized in a deployment map representation of non-penetrable obstacles. A probability detection model is utilized to represent sensors with a variable distance coverage. The ACP is formulated as a mixed integer nonlinear programming problem and an iterative process is developed to solve the problem. The microgrid at Illinois Institute of Technology (IL Tech) is used as a practical example. Both the normal and the N-1 contingency deployments of sensors are simulated for optimizing the ACP at the IL Tech microgrid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Toplogical optimization of structures using Fourier representations

The minimization of compliance subject to a mass constraint is the topology optimization design problem of interest. The goal is to determine the optimal configuration of material within an allowed volume. Our approach builds upon the well-known density method in which the decision variable is the material density in every cell in a mesh. In it’s most basic form the density method consists of three steps: 1) the problem is convexified by replacing the integer material indicator function with a volume fraction, 2) the problem is regularized by filtering the volume fraction field to impose a minimum length scale; 3) the filtered volume fraction is penalized to steer the material distribution toward binary designs. The filtering step is used to yield a mesh-independent solution and to eliminate checkerboard instabilities. In image processing terms this is a low-pass filter, and a consequence is that the decision variables are not independent and a change of basis could significantly reduce the dimension of the nonlinear programming problem. Based on this observation, we represent the volume fraction field with a truncated Fourier representation. Furthermore, this imposes a minimal length scale on the problem, eliminates checkerboard instabilities, and also reduces the number of decision variables by over 100 × (two dimensions) or 1000 × (three dimensions).

97 MATHEMATICS AND COMPUTING↗

Optimization of groundwater artificial recharge systems using a genetic algorithm: a case study in Beijing, China

An optimization approach is used for the operation of groundwater artificial recharge systems in an alluvial fan in Beijing, China. The optimization model incorporates a transient groundwater flow model, which allows for simulation of the groundwater response to artificial recharge. The facilities’ operation with regard to recharge rates is formulated as a nonlinear programming problem to maximize the volume of surface water recharged into the aquifers under specific constraints. This optimization problem is solved by the parallel genetic algorithm (PGA) based on OpenMP, which could substantially reduce the computation time. To solve the PGA with constraints, the multiplicative penalty method is applied. In addition, the facilities’ locations are implicitly determined on the basis of the results of the recharge-rate optimizations. Two scenarios are optimized and the optimal results indicate that the amount of water recharged into the aquifers will increase without exceeding the upper limits of the groundwater levels. Optimal operation of this artificial recharge system can also contribute to the more effective recovery of the groundwater storage capacity.

58 GEOSCIENCES↗

Analytical and Computational Properties of Distributed Approaches to MDO

Historical evolution of engineering disciplines and the complexity of the MDO problem suggest that disciplinary autonomy is a desirable goal in formulating and solving MDO problems. We examine the notion of disciplinary autonomy and discuss the analytical properties of three approaches to formulating and solving MDO problems that achieve varying degrees of autonomy by distributing the problem along disciplinary lines. Two of the approaches-Optimization by Linear Decomposition and Collaborative Optimization-are based on bi-level optimization and reflect what we call a structural perspective. The third approach, Distributed Analysis Optimization, is a single-level approach that arises from what we call an algorithmic perspective. The main conclusion of the paper is that disciplinary autonomy may come at a price: in the bi-level approaches, the system-level constraints introduced to relax the interdisciplinary coupling and enable disciplinary autonomy can cause analytical and computational difficulties for optimization algorithms. The single-level alternative we discuss affords a more limited degree of autonomy than that of the bi-level approaches, but without the computational difficulties of the bi-level methods. Key Words: Autonomy, bi-level optimization, distributed optimization, multidisciplinary optimization, multilevel optimization, nonlinear programming, problem integration, system synthesis

Alexandrov, Natalia M.↗

Loss Minimization With Optimal Power Dispatch in Multi-Frequency HVac Power Systems

Low-frequency high-voltage ac transmission scheme has recently been proposed as an alternative approach for bulk power transmission. This paper proposes a multi-period optimal power flow (OPF) for a multi-frequency HVac transmission system that interconnects both conventional 50/60-Hz and low-frequency grids using back-to-back converters with a centralized control scheme. The OPF objective is to minimize system losses by determining the optimal dispatch for generators, shunt capacitors, and converters. The OPF constraints include the operational constraints of all HVac grid and converter stations. The resulting mixed-integer nonlinear programing problem is solved using a proposed framework based on the predictor-corrector primal-dual interior-point method. The proposed OPF formulation and solution approach are verified using a multi-frequency HVac transmission system that is modified from the IEEE 57-bus system. Here, the results with the optimal dispatch from the proposed method during a simulated day show a significant loss reduction and an improved voltage regulation compared to those when an arbitrary dispatch is chosen.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Coordinated Planning Strategy for Integrated Energy Systems in a District Energy Sector

With the ever-growing integration of diverse distributed energy resources, modern district energy sectors are transitioning into integrated energy systems (IESs), which generally consist of various energy carriers such as electric power, natural gas, and heat. Instead of modeling individual energy carriers, the emergence of IESs requires comprehensive consideration of all involved energy systems in both planning and operation phases. This paper proposes a comprehensive planning strategy for a district energy sector to address the challenges of IES planning considering the coupling of power, gas, and heat systems. The proposed planning model contains an operational module that develops a steady-state optimal multi-energy flow (OMEF) for the IES considered and a multi-stage expansion module that optimizes the investment decisions. To efficiently solve the proposed planning model, which is formulated as a mixed-integer nonlinear programming problem, an improved generalized Benders decomposition algorithm that utilizes dynamic dual multipliers to improve the convergence speed is employed. The effectiveness of the proposed planning model and the feasibility of the improved Benders decomposition algorithm are verified in case studies.

coordinated planning↗

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗

The value of improved (ERS) information based on domestic distribution effects of U.S. agriculture crops

The value of improving information for forecasting future crop harvests was investigated. Emphasis was placed upon establishing practical evaluation procedures firmly based in economic theory. The analysis was applied to the case of U.S. domestic wheat consumption. Estimates for a cost of storage function and a demand function for wheat were calculated. A model of market determinations of wheat inventories was developed for inventory adjustment. The carry-over horizon is computed by the solution of a nonlinear programming problem, and related variables such as spot and future price at each stage are determined. The model is adaptable to other markets. Results are shown to depend critically on the accuracy of current and proposed measurement techniques. The quantitative results are presented parametrically, in terms of various possible values of current and future accuracies.

Bradford, D. F.↗

Computable optimal value bounds for generalized convex programs

It has been shown by Fiacco that convexity or concavity of the optimal value of a parametric nonlinear programming problem can readily be exploited to calculate global parametric upper and lower bounds on the optimal value function. The approach is attractive because it involves manipulation of information normally required to characterize solution optimality. A procedure is briefly described for calculating and improving the bounds as well as its extensions to generalized convex and concave functions. Several areas of applications are also indicated.

Fiacco, Anthony V.↗