Search NASA⌕ Search

SEARCH · Search NASA

Results for “Integer Optimization”

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 397 records · Page 22

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

In this paper, we address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality.

97 MATHEMATICS AND COMPUTING↗

Optimal blending management of biomass resources used for biochemical conversion

This research develops an optimization model to describe the tradeoff among blend components in the least-cost biomass blend, based on resource availability, quality requirements, and logistics cost for a biochemical conversion. A mixed-integer linear programming model is developed to determine the least-cost blend from a set of candidate feedstocks. A case study – based on a biorefinery located in western Kansas that uses three-pass corn stover, two-pass corn stover, switchgrass, miscanthus, and municipal solid waste fractions to meet biochemical conversion specifications and feedstock demand – shows that the delivered cost of an optimal blend that meets carbohydrate and ash specifications is 12.12% higher than the delivered cost of optimal blend that meets a carbohydrate specification only. The results indicate that a least-cost blend that meets both carbohydrate and ash specifications consists of miscanthus (48.2%) and switchgrass (29.4%) whereas the least-cost blend meeting carbohydrate specification only comprises three-pass corn stover (55.4%) and two-pass corn stover (20.4%). Here an optimal blend uses a low-cost municipal solid waste fraction in all cases, implying that blending could be a potential strategy to reduce delivered feedstock cost.

09 BIOMASS FUELS↗

Data-Enabled Building Energy Savings (D-E BES)

Building sector energy consumption represents a significant fraction of the overall energy consumption in urban communities. While there has been increasing focus on the development of smart environments to support energy savings in urban commercial buildings, the development of smart environments for the residential sector has been less common. Instead, urban residential energy-saving efforts have focused on improving a building's physical infrastructure, introducing energy-saving appliances, and motivating residents to adopt energy conservation practices. Herein this paper illustrates that creating an affinity between a building resident's thermal preferences and a building apartment's unregulated thermal environment represents an alternative means of generating an energy-efficient environment for multi-family, residential buildings. Two years of 15-min interval summer data, obtained from smart cyber-physical systems installed in 310 apartments across two New York City buildings, is used to develop data-enabled (D-E) models of resident thermal preference and unregulated apartment temperatures. Both of these models use a linear mixed-effects approach. The alignment of optimal resident-apartment pairs is then formulated as an integer-programming problem to explore the building energy saving (BES) potential associated with minimizing the difference between unregulated apartment temperature and the residents' thermal preference based on summer cooling loads. The work shows that the energy saving potential vary with a building's physical characteristics as well as the variation in residents' thermal preferences. The work further demonstrates that both the unregulated temperature and the resident's preferred temperature in a given apartment are not only affected by outside temperature and external relative humidity, but also strongly affected by the apartment's geographic orientation. For the specific buildings considered, up to 28% cooling energy saving is possible with full alignment. The paper provides all building monitoring data as an open source data set.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Restoration using Distributed Energy Resources for Resilient Power Distribution Networks

In this paper, we propose a restorative method to minimize the unserved demand in a power distribution network where some islands are formed due to multiple line outages. The restoration is achieved by tie-line switching and by solving a mixed-integer non-linear problem. Due to combinatorial issues of the optimization problem, a method is proposed which restores the system by setting up microgrids boundaries within the islands and connecting them through tie-lines for exchange of active power in between them. The optimal tie-line to interconnect the microgrids is decided through information exchange between the microgrid operators. Case studies on IEEE 33-bus distribution network is presented to illustrate the results and validate the performance of the proposed method.

Sarkar, Ranadhir↗

HOPSPACK 2.0 user manual.

HOPSPACK (Hybrid Optimization Parallel Search PACKage) solves derivative-free optimization problems using an open source, C++ software framework. The framework enables parallel operation using MPI or multithreading, and allows multiple solvers to run simultaneously and interact to find solution points. HOPSPACK comes with an asynchronous pattern search solver that handles general optimization problems with linear and nonlinear constraints, and continuous and integer-valued variables. This user manual explains how to install and use HOPSPACK to solve problems, and how to create custom solvers within the framework.

97 MATHEMATICS AND COMPUTING↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

Aerial drone fleet deployment optimization with endogenous battery replacements for direct delivery of time-sensitive products

Aerial drones offer a distinct potential to reduce the delivery time and energy consumption for the delivery of time-sensitive and small products. However, there is still a need in the relevant industry to understand the performance of drone-based delivery under different business needs and drone operating conditions. We studied a drone deployment optimization problem for direct delivery of time-sensitive products with release dates to customers maintaining a specified time window. This paper presents a new mixed-integer programming model, new valid inequalities, a new greedy heuristic algorithm, and a Genetic algorithm to help business owners optimally schedule and route their drone fleet minimizing the required fleet size, the required number of additional batteries, and total energy consumption. A realistic feature of the optimization method is that instead of replacing the drone battery after each return to the depot, it keeps track of the remaining energy in the drone battery and decides on battery replacements accounting for the drone routing and the user-specified minimum required battery energy. Numerical results based on real data from drone flight tests and prepared food delivery industry provide insights into the effect of different practical drone operating parameters on the required fleet size, the required number of battery replacements, and energy consumption. Here, results demonstrate that the proposed heuristic algorithm substantially outperforms the accelerated CPLEX in runtime while sacrificing the solution quality by a small amount. Additionally, results show that using a mixed fleet of hexacopter and quadcopter drones reduces the total energy consumption by 48.52% compared to using a homogeneous fleet of only hexacopters.

Drone energy consumption↗

Integrating event detection system operation characteristics into sensor placement optimization.

We consider the problem of placing sensors in a municipal water network when we can choose both the location of sensors and the sensitivity and specificity of the contamination warning system. Sensor stations in a municipal water distribution network continuously send sensor output information to a centralized computing facility, and event detection systems at the control center determine when to signal an anomaly worthy of response. Although most sensor placement research has assumed perfect anomaly detection, signal analysis software has parameters that control the tradeoff between false alarms and false negatives. We describe a nonlinear sensor placement formulation, which we heuristically optimize with a linear approximation that can be solved as a mixed-integer linear program. We report the results of initial experiments on a real network and discuss tradeoffs between early detection of contamination incidents, and control of false alarms.

54 ENVIRONMENTAL SCIENCES↗

Design and analysis of optimal pre-cooling in residential buildings

Existing pre-cooling strategies provide a means of shifting or reducing the peak demand and/or energy cost in residential buildings. However, majority of them are rule-based and therefore may not be optimal in terms of cost saving, leaving room for improvement. In this paper, an integer linear programming problem that accounts for the thermal properties of a specific home, HVAC system capacity, utility rate structure, and weather conditions and makes use of a home thermal model is formulated. This problem determines the HVAC on/off control signal that minimizes the 24-h energy cost while maintaining thermal comfort and calculates the corresponding optimal indoor air temperature. The model is constructed using home thermal properties identified via data training in real-time. Through simulation, the energy performance of the proposed optimal pre-cooling strategy is investigated and compared with three rule-based operation strategies from the literature. It is found that the optimal strategy requires the least energy consumption without sacrificing thermal comfort. The superb energy performance of the optimal strategy is attributed to a longer runtime of the HVAC system in cool outdoor air conditions and to the elimination of deadband in HVAC operation, which is required by the rule-based strategies, to allow the indoor air temperature to stay near the thermal comfort upper bound as much as possible. In terms of energy cost, the rule-based operation strategies require 3.52, 1.90, and 2.79, respectively, while the optimal strategy only requires 1.52. These figures represent a saving of 56.82%, 20.00%, and 45.52%, respectively. The results suggest that the optimal strategy is indeed significantly more effective than the existing rule-based operation strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗

Co-optimized trading of hybrid wind power plant with retired EV batteries in energy and reserve markets under uncertainties

To be competitive in the electricity markets, various technologies have been reported to increase profits of wind farm owners. Combining battery storage system, wind farms can be operated as conventional power plants which promotes the integration of wind power into the power grid. However, high expenses on batteries keep investors away. Retired EV batteries, fortunately, still have enough capacity to be reused and could be obtained at a low price. In this work, a two-stage optimization of a wind energy retired EV battery-storage system is proposed. The economic performance of the proposed system is examined concerning its participation in the frequency containment normal operation reserve (FCR-N) market and the spot market simultaneously. To account uncertainties in the wind farm output, various electricity market prices, and up/down regulation status, a scenario-based stochastic programming method is used. The sizing of the equipment is optimized on top of daily operations of the hybrid system which formulates a mixed-integer linear programming (MILP) problem. Scenarios are generated with the Monte Carlo simulation (MCS) and Roulette Wheel Mechanism (RWM), which are further reduced with the simultaneous backward method (SBM) to increase computational efficiency. A 21 MW wind farm is selected as a case study. Here, the optimization results show that by integrating with a retired EV battery-storage system (RESS) and a bi-directional inverter, the wind farm can increase its profits significantly when forwarding bids in both of the aforementioned electricity markets.

17 WIND ENERGY↗

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗

Optimization of battery swapping infrastructure for e-commerce drone delivery

Drone delivery is widely-researched to alter the current e-commerce delivery convention for providing short delivery lead times. Yet, flight range of drones, constrained by the available battery technology, sets a milestone toward realizing the sole-drone delivery. To tackle with the flight range limitation, locating automated battery swapping machines (ABSM) have been proposed and a few studies modeled the problem. Using the ABSMs, drones can be loaded with fully-charged batteries along the route to a demand location. Here, we introduce a mixed-integer nonlinear program to model the problem. The objective of the program is to optimally select ABSM locations, determine the delivery-mode choices (drone-only, truck-only, and mixed delivery) of demand locations, find drone delivery routes, and approximate the baseline requirements for the number of drones and batteries needed. The program minimizes the overall delivery system costs including: ABSM, delivery, drone ownership, battery inventory, and service congestion. A cutting-plane method is developed to find exact solutions in finite iterations. Computational experiments showed that the method quickly yields the optimal solution to instances with less than 60 ABSM candidates and 20 demand locations. A case study shows that the optimal drone delivery infrastructure can save almost 20% cost compared to the conventional truck-only delivery. Sensitivity analyses were conducted to reveal the impact of key parameters in the decision-making and found that a decrease in the ABSM and drone costs highly affect the system cost.

25 ENERGY STORAGE↗

A mixed integer linear programming approach for the design of chemical process families

Tackling climate change goals requires widespread deployment of process technology variants across many decentralized sites with different geographical, environmental, and operational requirements. Conventional engineering approaches focus on unique designs for each installation (process variant), while missing opportunities for manufacturing standardization. Here, instead we seek to optimize a process platform of common unit designs while simultaneously designing an entire family of process variants that make use of that platform. This reduces engineering effort, deployment timelines, and manufacturing costs. We propose a nonlinear generalized disjunctive programming formulation and convert this to an efficient mixed-integer linear programming (MILP) formulation through discretization of the design space. We formulate our optimization in Pyomo with costing from IDAES, and we demonstrate the computational performance and solution quality on a water treatment desalination system from the PARETO framework and a carbon capture system built in Aspen Plus as part of CCSI2.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Optimization-Based Approach for Simultaneous Chemical Process and Heat Exchanger Network Synthesis

We propose a mixed-integer nonlinear programming (MINLP) model for simultaneous chemical process and heat exchanger network synthesis. The model allows process stream inlet/outlet temperatures and flow rates to vary and can be extended to handle unclassified streams, thereby facilitating integration with a process synthesis model. The proposed model is based on a generalized transshipment approach in which the heat cascade is built upon a “dynamic” temperature grid. Both hot and cold streams can cascade heat so that exchanger inlet and outlet temperature, heat duty, and area can be calculated at each temperature interval. Here, we develop mixed-integer constraints to model the number of heat exchangers in the network. Finally, we present several solution strategies tailored to improve the computation performance of the proposed models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗