Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 325 records · Page 18

Optimum Planning for Inductively Charged On-Demand Automated Electric Shuttles at Greenville, South Carolina

Wireless charging technology presents perfect fits for autonomous electric vehicles for realizing a fully automated system (vehicle and charger). This paper presents a planning optimization analysis for a pilot project of in-route wireless charging infrastructure serving fixed-route on-demand shared automated electric shuttles (SAESs) at Greenville, South Carolina, USA. A single-objective non-linear integer planning optimization problem is formulated. A comprehensive cost function representing the inductively charged SAESs is developed, considering road construction, power electronics and materials, traction battery, and installation costs. The optimization problem is solved to determine the best combination of the system key design parameters (number and allocations of wireless chargers, charging power level, track length and on-board battery capacity) that show the most cost-effective solution and allow the SAESs realizing charge sustaining operation. The planning platform incorporates representative simulated traffic data (drive cycles and routes) for four SAESs at Greenville project using the Simulation of Urban Mobility (SUMO) tool. These data are fed to a vehicle powertrain model and a wireless charger power model to predict the battery power, energy and state-of-charge (SOC) profiles, which are provided to the search algorithm to assess the design objectives under specific constraints. The results indicated that implementing wireless charging at a few designated stops for fixed-route SAESs with proper design allows the vehicles realizing charge sustaining operation, infinite range and zero recharge downtime, with a significant reduction in the on-board battery (36 % ) and road coverage (69%), at minimum cost.

33 ADVANCED PROPULSION SYSTEMS↗

Eigenfrequency constrained topology optimization of finite strain hyperelastic structures

This paper incorporates hyperelastic materials, nonlinear kinematics, and preloads in eigenfrequency constrained density–based topology optimization. The formulation allows for initial finite deformations and subsequent small harmonic oscillations. The optimization problem is solved by the method of moving asymptotes, and the gradients are calculated using the adjoint method. Both simple and degenerate eigenfrequencies are considered in the sensitivity analysis. A well-posed topology optimization problem is formulated by filtering the volume fraction field. Numerical issues associated with excessive distortion and spurious eigenmodes in void regions are reduced by removing low volume fraction elements. The optimization objective is to maximize stiffness subject to a lower bound on the fundamental eigenfrequency. Numerical examples show that the eigenfrequencies drastically change with the load magnitude, and that the optimization is able to produce designs with the desired fundamental eigenfrequency.

42 ENGINEERING↗

A Distance Measure Comparison to Improve Crowding in Multi-Modal Problems.

Solving multi-modal optimization problems are of interest to researchers solving real world problems in areas such as control systems and power engineering tasks. Extensions of simple Genetic Algorithms, particularly types of crowding, have been developed to help solve these types of problems. This paper examines the performance of two distance measures, Mahalanobis and Euclidean, exercised in the processing of two different crowding type implementations against five minimization functions. Within the context of the experiments, empirical evidence shows that the statistical based Mahalanobis distance measure when used in Deterministic Crowding produces equivalent results to a Euclidean measure. In the case of Restricted Tournament selection, use of Mahalanobis found on average 40% more of the global optimum, maintained a 35% higher peak count and produced an average final best fitness value that is 3 times better.

97 MATHEMATICS AND COMPUTING↗

Agent-Supervisor Coordination for Decentralized Event-Triggered Optimization

This letter proposes decentralized resource-aware coordination schemes for solving network optimization problems defined by objective functions that combine locally evaluable costs with network-wide coupling components. These methods are well suited for a group of supervised agents trying to solve an optimization problem under mild coordination requirements. Each agent has information on its local cost and coordinates with the network supervisor for information about the coupling term of the cost. The proposed approach is feedback-based and asynchronous by design, guarantees anytime feasibility, and ensures the asymptotic convergence of the network state to the desired optimizer. Numerical simulations on a power system example illustrate our results.

decentralized algorithms↗

Electric Grid Expansion Planning with High Levels of Variable Generation

Renewables are taking a large proportion of generation capacity in U.S. power grids. As their randomness has increasing influence on power system operation, it is necessary to consider their impact on system expansion planning. To this end, this project studies the generation and transmission expansion co-optimization problem of the US Eastern Interconnection (EI) power grid with a high wind power penetration rate. In this project, the generation and transmission expansion problem for the EI system is modeled as a mixed-integer programming (MIP) problem. This study analyzed a time series creation method to capture the diversity of load and wind power across balancing regions in the EI system. The obtained time series can be easily introduced into the MIP co-optimization problem and then solved robustly through available MIP solvers. Simulation results show that the proposed time series generation method and the expansion co-optimization model and can improve the expansion result significantly after considering the diversity of wind and load across EI regions. The improved expansion plan that combines generation and transmission will aid system planners and policy makers to maximize the social welfare. This study shows that modelling load and wind variations and diversities across balancing regions will produce significantly different expansion result compared with former studies. For example, if wind is modeled in more details (by increasing the number of wind output levels) so that more wind blocks are considered in expansion planning, transmission expansion will be larger and the expansion timing will be earlier. Regarding generation expansion, more wind scenarios will slightly reduce wind generation expansion in the EI system and increase the expansion of other generation such as gas. Also, adopting detailed wind scenarios will reveal that it may be uneconomic to expand transmission networks for transmitting a large amount of wind power through a long distance in the EI system. Incorporating more details of renewables in expansion planning will inevitably increase the computational burden. Therefore, high performance computing (HPC) techniques are urgently needed for power system operation and planning optimization. As a scoping study task, this project tested some preliminary parallel computation techniques such as breaking down the simulation task into several sub-tasks based on chronology splitting or sample splitting, and then assigning these sub-tasks to different cores. Testing results show significant time reduction when a simulation task is split into several sub-tasks for parallel execution.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Real-Time Control of an Ensemble of Heterogeneous Resources

This paper focuses on the problem of controlling an ensemble of heterogeneous resources connected to an electrical grid at the same point of common coupling (PCC). The controller receives an aggregate power setpoint for the ensemble in real time and tracks this setpoint by issuing individual optimal setpoints to the resources. The resources can have continuous or discrete nature (e.g., heating systems consisting of a finite number of heaters that each can be either switched on or off) and/or can be highly uncertain (e.g., photovoltaic (PV) systems or residential loads). A naive approach would lead to a stochastic mixed-integer optimization problem to be solved at the controller at each time step, which might be infeasible in real time. Instead, we allow the controller to solve a continuous convex optimization problem and compensate for the errors at the resource level by using a variant of the well-known error diffusion algorithm. We give conditions guaranteeing that our algorithm tracks the power setpoint at the PCC on average while issuing optimal setpoints to individual resources. We illustrate the approach numerically by controlling a collection of batteries, PV systems, and discrete loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Stochastic optimization of GeantV code by use of genetic algorithms

GeantV is a complex system based on the interaction of different modules needed for detector simulation, which include transport of particles in fields, physics models simulating their interactions with matter and a geometrical modeler library for describing the detector and locating the particles and computing the path length to the current volume boundary. The GeantV project is recasting the classical simulation approach to get maximum benefit from SIMD/MIMD computational architectures and highly massive parallel systems. This involves finding the appropriate balance between several aspects influencing computational performance (floating-point performance, usage of off-chip memory bandwidth, specification of cache hierarchy, etc.) and handling a large number of program parameters that have to be optimized to achieve the best simulation throughput. This optimization task can be treated as a black-box optimization problem, which requires searching the optimum set of parameters using only point-wise function evaluations. Here, the goal of this study is to provide a mechanism for optimizing complex systems (high energy physics particle transport simulations) with the help of genetic algorithms and evolution strategies as tuning procedures for massive parallel simulations. One of the described approaches is based on introducing a specific multivariate analysis operator that could be used in case of resource expensive or time consuming evaluations of fitness functions, in order to speed-up the convergence of the black-box optimization problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Heuristic Static Load-Balancing Algorithm Applied to the Community Earth System Model

We propose to use the heuristic static loadbalancing (HSLB) algorithm for solving load-balancing problems in the Community Earth System Model (CESM), a climate model, using fitted benchmark data as an alternative to the current manual approach. The problem of allocating the optimal number of CPU cores to CESM components is formulated as a mixed-integer nonlinear optimization problem which is solved by using an optimization branch-and-bound solver implemented in the MINLP package MINOTAUR. The key feature of the branch-and- bound method is that it guarantees to provide an optimal solution or show that none exists. Our algorithm was tested for the 1 degrees and 1/8 degrees resolution simulations on 32,768 nodes (131,072 cores) of IBM Blue Gene/P where we consistently achieved well load-balanced results. This work is a part of a broader effort to eliminate the need for manual tuning of the code for each platform and simulation type, improve the performance and scalability of CESM, and develop automated tools to achieve these goals.

Alekseev, Yury↗

A two-stage stochastic optimization model for scheduling electric vehicle charging loads to relieve distribution-system constraints

Electric vehicles (EVs) hold promise to improve the energy efficiency and environmental impacts of transportation. However, widespread EV use can impose significant stress on electricity-distribution systems due to their added charging loads. This paper proposes a centralized EV charging-control model, which schedules the charging of EVs that have flexibility. This flexibility stems from EVs that are parked at the charging station for a longer duration of time than is needed to fully recharge the battery. The model is formulated as a two-stage stochastic optimization problem. The model captures the use of distributed energy resources and uncertainties around EV arrival times and charging demands upon arrival, non-EV loads on the distribution system, energy prices, and availability of energy from the distributed energy resources. We use a Monte Carlo-based sample-average approximation technique and an L-shaped method to solve the resulting optimization problem efficiently. We also apply a sequential sampling technique to dynamically determine the optimal size of the randomly sampled scenario tree to give a solution with a desired quality at minimal computational cost. Here, we demonstrate the use of our model on a Central-Ohio-based case study. We show the benefits of the model in reducing charging costs, negative impacts on the distribution system, and unserved EV-charging demand compared to simpler heuristics. Lastly, we also conduct sensitivity analyses, to show how the model performs and the resulting costs and load profiles when the design of the station or EV-usage parameters are changed.

33 ADVANCED PROPULSION SYSTEMS↗

Sequential Construction of Costly Networks

Natural disasters or attacks often disrupt infrastructure networks requiring a costly recovery. This motivates an optimization problem where the objecitve is to construct the nodes of a graph G(V;E), and the cost of each node is dependent on the number of its neighbors previously constructed, or more generally, any properties of the previously-completed subgraph. In this optimization problem the objective is to find a permutation of the nodes which results in the least construction cost. We prove that in the case where the cost of nodes is a convex function in the number of neighbors, the optimal construction sequence is to start at a single node and move outwards. We also introduce algorithms and heuristics for solving various instances of the problem. Those methods can be applied to help reduce the cost of recovering from disasters as well as to plan the deployment of new network infrastructure.

ALGORITHMS↗

Planning Optimization for Inductively Charged On-demand Automated Electric Shuttles Project at Greenville, South Carolina

Wireless charging technology presents an ideal fit for autonomous electric vehicles for realizing a fully automated system (vehicle and charger). This paper presents a planning optimization analysis for a pilot project of in-route wireless charging infrastructure serving fixed-route on-demand shared automated electric shuttles (SAESs) at Greenville, South Carolina, USA. A single-objective non-linear mixed integer system planning optimization problem is formulated. A comprehensive cost model representing the overall inductively charged SAESs system is developed, considering road construction, power electronics and materials, traction battery, and installation costs. The optimization problem is solved to determine the best combination of the system key design parameters (number and allocations of wireless chargers, charging power level, track length and on-board battery capacity) that show the most cost-effective solution and allow the SAESs to achieve charge-sustaining operation. The planning platform incorporates representative simulated traffic data (driving speed and routes) for four SAESs in the Greenville using the Simulation of Urban Mobility tool. These data are fed to a vehicle powertrain model and a wireless charger power model to predict the battery power, energy and state-of-charge profiles, which are provided to the search algorithm to assess the design objectives under specific constraints. Finally, the results indicate that implementing high-power (100 kW) wireless charger at a few designated stops for fixed-route SAESs with the proper track length allows the vehicles to realize charge-sustaining operation, infinite range, and zero recharge downtime, with a significant reduction in the on-board battery (36%) and road coverage (69%), at minimum cost.

33 ADVANCED PROPULSION SYSTEMS↗

SUSPECT: MINLP special structure detector for Pyomo

We present SUSPECT, an open source toolkit that symbolically analyzes mixed-integer nonlinear optimization problems formulated using the Python algebraic modeling library Pyomo. We present the data structures and algorithms used to implement SUSPECT. SUSPECT works on a directed acyclic graph representation of the optimization problem to perform: bounds tightening, bound propagation, monotonicity detection, and convexity detection. We show how the tree-walking rules in SUSPECT balance the need for lightweight computation with effective special structure detection. SUSPECT can be used as a standalone tool or as a Python library to be integrated in other tools or solvers. Here, we highlight the easy extensibility of SUSPECT with several recent convexity detection tricks from the literature. We also report experimental results on the MINLPLib 2 dataset.

97 MATHEMATICS AND COMPUTING↗

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗

On Anomaly Detection for Transactive Energy Systems with Competitive Market

Two anomaly-detection criteria are proposed for transactive energy systems with competitive markets. Participants of transactive energy systems seek an optimal power allocation through hybrid economic-control methods to facilitate the integration of various types of distributed energy resources to power distribution systems. In transactive energy systems, every participant is assumed to be a rational entity, and consumers have diminishing marginal utility and suppliers have increasing marginal cost. With the first proposed anomaly-detection criterion, the monotonicity of marginal cost and marginal utility are examined. The impact of line flow constraints is also taken into consideration. Then, the second anomaly-detection criterion is proposed for TESs with marginal cost and marginal utility which change faster than a certain rate. The second criterion is more accurate than the first one for TES with marginal cost and marginal utility which change faster than a certain rate, but it requires the knowledge of that rate. Neither criteria requires more data than those necessary to find the optimal power allocation and the market-clear price in a transactive energy system. Therefore, the proposed criteria do not disclose any more data than necessary. As the monotonicity of marginal cost and marginal utility in a TES with competitive markets results in convex objective functions in an optimization problem and strongly convex ones when marginal cost and marginal utility changes faster than a certain rate, the two detection criteria are also applicable to anomaly detection of general convex optimization problems. Simulations are carried out to show the efficacy of the proposed criteria to detect anomalies caused by cyberattacks.

Wang, Peng↗

Optimization of District Heating Network Parameters in Steady-State Operation

Here we examine the modeling, simulation, and optimization of district heating systems, which are widely used for thermal transport using steam or hot water as a carrier. We propose a generalizable framework to specify network models and scenario parameters, and develop an optimization method for evaluating system states including pressures, fluid flowrates, and temperatures throughout the network. The network modeling includes pipes, thermal plants, pumps, and passive or controllable loads as system components. We propose basic models for thermodynamic fluid transport and enforce the balance of physical quantities in steady-state flow over co-located outgoing and return networks. We formulate an optimization problem with steam and hot water as the outgoing and return carriers, as in legacy twentieth century systems. The physical laws and engineering limitations are specified for each component type, and the thermal network flow optimization problem is formulated and solved for a realistic test network under several scenarios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

HybridSystemsSimulations.jl - Solving the Merchant Collocated Facilities with JuMP

The development of new clean-generation technologies also leads to new plant-level architectures that combine several generation and storage assets behind the point of connection. These co-located generation resources (Hybrid Systems) primarily operate as merchant assets that employ automated market bidding models and internal Energy Management Systems (EMS) to comply with the operator's signals. Formulating an optimal bidding model requires embedding the EMS control model into the bidding algorithm, resulting in a bi-level optimization problem. In this presentation, we first showcase using JuMP to formulate and solve this problem effectively for multiple merchant systems and the bidding outcomes considering different model formulations. Second, the bidding outcomes are later integrated into a PowerSimulations.jl (also built with JuMP) simulation to study the system-level effects of the various merchant bidding and the interactions between market-clearing models and the embedded EMS model. We will showcase simulations conducted in the RTS system considering different levels of merchant hybrid systems participation. The presentation provides the following specific insights on JuMP usage: 1) the Formulation of specialized bi-level problems with custom cuts to solve the merchant hybrid system bidding problem; 2) the integration of a modular model within a complex simulation workflow supported by JuMP in PowerSimulations.jl; 3) Accelerating the solution of power systems operations simulation that employ agent optimization problems using JuMP.

energy markets↗