Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 973 records · Page 54

Automated Control of Transactive HVACs in Energy Distribution Systems

Heating, Ventilation, and Air Conditioning (HVAC) systems contribute significantly to a building’s energy consumption. In the recent years, there is an increased interest in developing transactive approaches which could enable automated and flexible scheduling of HVAC systems based on the customer demand and the electricity prices decided by the suppliers. Flexible and automated scheduling of the HVAC systems make it a prime source for participation in residential demand response or transactive energy systems. Therefore, it is of significant interest to identify an optimal strategy to control the HVAC systems. Here, reducing the energy cost while keeping the comfort level acceptable to the users, we argue that such a control strategy should consider both the energy cost and user comfort simultaneously. Accordingly, we develop the control strategy through the solution of an optimization problem that balances between the energy cost and consumer’s dissatisfaction. This optimization enables us to solve a decision-making problem through first price prediction and then choosing HVAC temperature settings throughout the day based on the predicted price, history of the price and HVAC settings, and outside temperature. More specifically, we formulate the control design as a Markov decision process (MDP) using deep neural networks and use Deep Deterministic Policy Gradients (DDPG)-based deep reinforcement learning algorithm to find the optimal control strategy for HVAC systems that balances between electricity cost and user comfort.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Portfolio Optimization in a Semi-Markov Modulated Market

We address a portfolio optimization problem in a semi-Markov modulated market. We study both the terminal expected utility optimization on finite time horizon and the risk-sensitive portfolio optimization on finite and infinite time horizon. We obtain optimal portfolios in relevant cases. A numerical procedure is also developed to compute the optimal expected terminal utility for finite horizon problem.

97 MATHEMATICS AND COMPUTING↗

An efficient algorithm for pairwise local alignment of protein interaction networks

Recently, researchers seeking to understand, modify, and create beneficial traits in organisms have looked for evolutionarily conserved patterns of protein interactions. Their conservation likely means that the proteins of these conserved functional modules are important to the trait's expression. In this paper, we formulate the problem of identifying these conserved patterns as a graph optimization problem, and develop a fast heuristic algorithm for this problem. We compare the performance of our network alignment algorithm to that of the MaWISh algorithm [Koyuturk M, Kim Y, Topkara U, Subramaniam S, Szpankowski W, Grama A, Pairwise alignment of protein interaction networks, J Comput Biol 13(2): 182-199, 2006.], which bases its search algorithm on a related decision problem formulation. We find that our algorithm discovers conserved modules with a larger number of proteins in an order of magnitude less time. In conclusion, the protein sets found by our algorithm correspond to known conserved functional modules at comparable precision and recall rates as those produced by the MaWISh algorithm.

97 MATHEMATICS AND COMPUTING↗

Genetic-Algorithm Tool For Search And Optimization

SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

Wang, Lui↗

Utility Theory for Evaluation of Optimal Process Condition of SAW: A Multi-Response Optimization Approach

Multi-objective optimization problem has been solved in order to estimate an optimal process environment consisting of optimal parametric combination to achieve desired quality indicators (related to bead geometry) of submerged arc weld of mild steel. The quality indicators selected in the study were bead height, penetration depth, bead width and percentage dilution. Taguchi method followed by utility concept has been adopted to evaluate the optimal process condition achieving multiple objective requirements of the desired quality weld.

36 MATERIALS SCIENCE↗

An introduction to optimal power flow: Theory, formulation, and examples

The set of optimization problems in electric power systems engineering known collectively as Optimal Power Flow (OPF) is one of the most practically important and well-researched subfields of constrained nonlinear optimization. OPF has enjoyed a rich history of research, innovation, and publication since its debut five decades ago. Nevertheless, entry into OPF research is a daunting task for the uninitiated--both due to the sheer volume of literature and because OPF's ubiquity within the electric power systems community has led authors to assume a great deal of prior knowledge that readers unfamiliar with electric power systems may not possess. This article provides an introduction to OPF from an operations research perspective; it describes a complete and concise basis of knowledge for beginning OPF research. The discussion is tailored for the operations researcher who has experience with nonlinear optimization but little knowledge of electrical engineering. Topics covered include power systems modeling, the power flow equations, typical OPF formulations, and common OPF extensions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A method for determining optimum re-entry trajectories

The Pontryagin Maximum Principle is used to formulate the problem of finding optimum atmospheric vehicular reentry trajectories. The optimization problem is that of minimizing an integral which is a function of the state and control variables. The vehicle's motion is assumed to be influenced by a gravitational force and an aerodynamic force. The problem is formulated and the necessary equations are developed simultaneously for three sets of Euler angles. Computational procedures are suggested so that numerical trajectories may be generated.

Reiter, W. F.↗

ADS: A FORTRAN program for automated design synthesis: Version 1.10

A new general-purpose optimization program for engineering design is described. ADS (Automated Design Synthesis - Version 1.10) is a FORTRAN program for solution of nonlinear constrained optimization problems. The program is segmented into three levels: strategy, optimizer, and one-dimensional search. At each level, several options are available so that a total of over 100 possible combinations can be created. Examples of available strategies are sequential unconstrained minimization, the Augmented Lagrange Multiplier method, and Sequential Linear Programming. Available optimizers include variable metric methods and the Method of Feasible Directions as examples, and one-dimensional search options include polynomial interpolation and the Golden Section method as examples. Emphasis is placed on ease of use of the program. All information is transferred via a single parameter list. Default values are provided for all internal program parameters such as convergence criteria, and the user is given a simple means to over-ride these, if desired.

Vanderplaats, G. N.↗

OPTIMIZATION FRAMEWORK FOR A RADIO FREQUENCY GUN BASED INJECTOR

Linear accelerator based light sources are used to produce coherent x-ray beams with unprecedented peak intensity. In these devices, the key parameters of the photon beam such as brilliance and coherence are directly dependent on the electron beam parameters. This leads to stringent beam quality requirements for the electron beam source. Radio frequency (RF) guns are used in such light sources since they accelerate electrons to relativistic energies over a very short distance, thus minimizing the beam quality degradation due to space charge effects within the particle bunch. Designing such sources including optimization of its beam parameters is a complex process where one needs to meet many requirements simultaneously. It is useful to have a tool to automate the design optimization in the context of the injector beam dynamics performance. Evolutionary and genetic algorithms are powerful tools to apply to nonlinear multi-objective optimization problems, and they have been successfully used in injector optimizations where the electric field profiles for the accelerating devices are fixed. Here the genetic algorithm based approach is extended to modify and optimize the electric field profile for an RF gun concurrently with the injector performance. Two field modification methods are used. This dissertation presents an overview of the optimization system and examples of its application to a state of the art RF gun. Results indicate improved injector performance is possible with unbalanced electric field profiles where the peak field in the cathode cell is larger than in subsequent cells.

Hofler, Alicia↗

Planning and Scheduling for Fleets of Earth Observing Satellites

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

Frank, Jeremy↗

Strategic planning for disaster recovery with stochastic last mile distribution

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools and is deployed to aid federal organizations in the US.

97 MATHEMATICS AND COMPUTING↗

Modeling of thermal storage systems in MILP distributed energy resource models

Thermal energy storage (TES) and distributed generation technologies, such as combined heat and power (CHP) or photovoltaics (PV), can be used to reduce energy costs and decrease CO 2 emissions from buildings by shifting energy consumption to times with less emissions and/or lower energy prices. To determine the feasibility of investing in TES in combination with other distributed energy resources (DER), mixed integer linear programming (MILP) can be used. Such a MILP model is the well-established Distributed Energy Resources Customer Adoption Model (DER-CAM); however, it currently uses only a simplified TES model to guarantee linearity and short run-times. Loss calculations are based only on the energy contained in the storage. This paper presents a new DER-CAM TES model that allows improved tracking of losses based on ambient and storage temperatures, and compares results with the previous version. A multi-layer TES model is introduced that retains linearity and avoids creating an endogenous optimization problem. The improved model increases the accuracy of the estimated storage losses and enables use of heat pumps for low temperature storage charging. Ultimately,results indicate that the previous model overestimates the attractiveness of TES investments for cases without possibility to invest in heat pumps and underestimates it for some locations when heat pumps are allowed. Despite a variation in optimal technology selection between the two models, the objective function value stays quite stable, illustrating the complexity of optimal DER sizing problems in buildings and microgrids.

25 ENERGY STORAGE↗

Mathematical theory of a relaxed design problem in structural optimization

Various attempts have been made to construct a rigorous mathematical theory of optimization for size, shape, and topology (i.e. layout) of an elastic structure. If these are represented by a finite number of parametric functions, as Armand described, it is possible to construct an existence theory of the optimum design using compactness argument in a finite dimensional design space or a closed admissible set of a finite dimensional design space. However, if the admissible design set is a subset of non-reflexive Banach space such as L(sup infinity)(Omega), construction of the existence theory of the optimum design becomes suddenly difficult and requires to extend (i.e. generalize) the design problem to much more wider class of design that is compatible to mechanics of structures in the sense of variational principle. Starting from the study by Cheng and Olhoff, Lurie, Cherkaev, and Fedorov introduced a new concept of convergence of design variables in a generalized sense and construct the 'G-Closure' theory of an extended (relaxed) optimum design problem. A similar attempt, but independent in large extent, can also be found in Kohn and Strang in which the shape and topology optimization problem is relaxed to allow to use of perforated composites rather than restricting it to usual solid structures. An identical idea is also stated in Murat and Tartar using the notion of the homogenization theory. That is, introducing possibility of micro-scale perforation together with the theory of homogenization, the optimum design problem is relaxed to construct its mathematical theory. It is also noted that this type of relaxed design problem is perfectly matched to the variational principle in structural mechanics.

Kikuchi, Noboru↗

Portable parallel stochastic optimization for the design of aeropropulsion components

This report presents the results of Phase 1 research to develop a methodology for performing large-scale Multi-disciplinary Stochastic Optimization (MSO) for the design of aerospace systems ranging from aeropropulsion components to complete aircraft configurations. The current research recognizes that such design optimization problems are computationally expensive, and require the use of either massively parallel or multiple-processor computers. The methodology also recognizes that many operational and performance parameters are uncertain, and that uncertainty must be considered explicitly to achieve optimum performance and cost. The objective of this Phase 1 research was to initialize the development of an MSO methodology that is portable to a wide variety of hardware platforms, while achieving efficient, large-scale parallelism when multiple processors are available. The first effort in the project was a literature review of available computer hardware, as well as review of portable, parallel programming environments. The first effort was to implement the MSO methodology for a problem using the portable parallel programming language, Parallel Virtual Machine (PVM). The third and final effort was to demonstrate the example on a variety of computers, including a distributed-memory multiprocessor, a distributed-memory network of workstations, and a single-processor workstation. Results indicate the MSO methodology can be well-applied towards large-scale aerospace design problems. Nearly perfect linear speedup was demonstrated for computation of optimization sensitivity coefficients on both a 128-node distributed-memory multiprocessor (the Intel iPSC/860) and a network of workstations (speedups of almost 19 times achieved for 20 workstations). Very high parallel efficiencies (75 percent for 31 processors and 60 percent for 50 processors) were also achieved for computation of aerodynamic influence coefficients on the Intel. Finally, the multi-level parallelization strategy that will be needed for large-scale MSO problems was demonstrated to be highly efficient. The same parallel code instructions were used on both platforms, demonstrating portability. There are many applications for which MSO can be applied, including NASA's High-Speed-Civil Transport, and advanced propulsion systems. The use of MSO will reduce design and development time and testing costs dramatically.

Sues, Robert H.↗

Analysis of Control Behavior in Eco-Driving Speed Optimization Using Pontryagin’s Minimum Principle

The energy efficiency of autonomous vehicles can be improved by selecting an optimized speed profile. Energy savings can be maximized by performing control optimization with knowledge of the powertrain characteristics and future driving conditions. Previous studies have shown that Pontryagin’s minimum principle (PMP) performs well in vehicle speed optimization problems. Building on the methods proposed in previous studies, the contribution of this study is to derive meaningful observations from the concepts and results of PMP to enhance the understanding of the control problem. In particular, the switching behavior of the control mode is analyzed with supportive variables, such as ξ and mv, which dictates the changes in the control modes. Additionally, the existence of the singular control is analyzed, which helps in understanding the cruise driving in the control problem. Finally, we obtain several solutions that satisfy various boundary conditions along with a map of the reachable states, and discuss the impact of cruise driving. This is helpful for designing practical control concepts for real-world applications based on this map. Previous studies have contributed significantly to this control problem; however, this study provides a better understanding of the issue and offers guidance and inspiration for future real-world applications based on these meaningful observations.

33 ADVANCED PROPULSION SYSTEMS↗

A new algorithm for general multiobjective optimization

Described is a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints and the envelope of all functions in the set is searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

A new algorithm for general multiobjective optimization

The paper describes a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints, and the envelope of all functions in the set is searched for an unconstrained minimum. The technique can be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

Sobieszczanski-Sobieski, Jaroslaw↗

Spacial and objective decompositions for very large SCAPs

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight run-time constraints to be practical in real-world disaster situations. This paper revisits the SCAP algorithm proposed in and proposes new storage allocation models that are necessary to enable the algorithm to scale to problem sizes of three orders of magnitude greater (250, 500, 1000 storage locations). The new algorithms are validated on large-scale hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools.

97 MATHEMATICS AND COMPUTING↗