Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 163 records · Page 9

Peak Power Reduction for HVAC Operations in Multi-unit Commercial Buildings

The load profiles of most commercial consumers are characterized by brief periods of very high power consumption followed by intervals of relatively lower demand. In order to flatten commercial load profiles, several power utilities in addition to billing energy consumption, levy a demand charge (DC) on the monthly peak demand. In this work, we consider the problem of joint optimization of energy costs (EC) and DC incurred by a multi-unit building which follows a demand response (DR) program. Despite the non-linear structure of the problem, we show how the optimal solutions can be obtained efficiently using linear programming. We evaluate the performance of the proposed power control scheme for various climate zones in the US. We show that depending on the ambient conditions and the prescribed tariff structure, our strategy can result in savings of up to nearly 19% compared to the baseline.

Raza Naqvi, Syed A.↗

Dispatch optimization of concentrating solar power with utility-scale photovoltaics

Concentrating solar power (CSP) tower technologies capture thermal radiation from the sun utilizing a field of solar-tracking heliostats. When paired with inexpensive thermal energy storage (TES), CSP technologies can dispatch electricity during peak-market-priced hours, day or night. The cost of utility-scale photovoltaic (PV) systems has dropped significantly in the last decade, resulting in inexpensive energy production during daylight hours. The hybridization of PV and CSP with TES systems has the potential to provide continuous and stable energy production at a lower cost than a PV or CSP system alone. Hybrid systems are gaining popularity in international markets as a means to increase renewable energy portfolios across the world. Typically, CSP-PV hybrid systems have been evaluated using either monthly averages of hourly PV production or scheduling algorithms that neglect the time-of-production value of electricity in the market. To more accurately evaluate a CSP-PV-battery hybrid design, we develop a profit-maximizing mixed-integer linear program ($\mathcal{H}$) that determines a dispatch schedule for the individual sub-systems with a sub-hourly time fidelity. We introduce the mathematical formulation of such a model and show that it is computationally expensive to solve. To improve model tractability and reduce solution times, we offer techniques that: (1) reduce the problem size, (2) tighten the linear programming relaxation of ($\mathcal{H}$) via reformulation and the introduction of cuts, and (3) implement an optimization-based heuristic (that can yield initial feasible solutions for (($\mathcal{H}$) and, at any rate, yields near-optimal solutions). Applying these solution techniques results in a 79% improvement in solve time, on average, for our 48-h instances of (($\mathcal{H}$); corresponding solution times for an annual model run decrease by as much as 93%, where such a run consists of solving 365 instances of (($\mathcal{H}$), retaining only the first 24 h' worth of the solution, and sliding the time window forward 24 h. We present annual system metrics for two locations and two markets that inform design practices for hybrid systems and lay the groundwork for a more exhaustive policy analysis. A comparison of alternative hybrid systems to the CSP-only system reflects that hybrid models can almost double capacity factors while resulting in a 30% improvement related to various economic metrics.

14 SOLAR ENERGY↗

Security-Constrained Unit Commitment with Linearized AC Optimal Power Flow.

We propose a mathematical programming-based approach to optimize the security-constrained unit commitment problem with a full AC transmission network representation. Our approach is based on our previously introduced successive linear programming (SLP) approach to solving the non-linear, nonconvex AC optimal power flow (ACOPF) problem. By linearizing the ACOPF, we are able to leverage powerful commercial mixed-integer solvers to iteratively optimize the combined unit commitment plus ACOPF model. We demonstrate our approach on six-bus, IEEE RTS-96, and IEEE 118-bus test systems. We perform a comparative analysis of the relative impacts of singlebus, DC, and AC transmission network models on the unit commitment and dispatch solutions and their associated costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SLFP: A stochastic linear fractional programming approach for sustainable waste management

Highlights: > A new fractional programming (SLFP) method is developed for waste management. > SLFP can solve ratio optimization problems associated with random inputs. > A case study of waste flow allocation demonstrates its applicability. > SLFP helps compare objectives of two aspects and reflect system efficiency. > This study supports in-depth analysis of tradeoffs among multiple system criteria. - Abstract: A stochastic linear fractional programming (SLFP) approach is developed for supporting sustainable municipal solid waste management under uncertainty. The SLFP method can solve ratio optimization problems associated with random information, where chance-constrained programming is integrated into a linear fractional programming framework. It has advantages in: (1) comparing objectives of two aspects, (2) reflecting system efficiency, (3) dealing with uncertainty expressed as probability distributions, and (4) providing optimal-ratio solutions under different system-reliability conditions. The method is applied to a case study of waste flow allocation within a municipal solid waste (MSW) management system. The obtained solutions are useful for identifying sustainable MSW management schemes with maximized system efficiency under various constraint-violation risks. The results indicate that SLFP can support in-depth analysis of the interrelationships among system efficiency, system cost and system-failure risk.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Greenberger-Horne-Zeilinger and W entanglement witnesses for the noninteracting Fermi gas

The existence and nature of tripartite entanglement of a noninteracting Fermi gas (NIFG) is investigated. Three classes of parametrized entanglement witnesses (EWs) are introduced with the aim of detecting genuine tripartite entanglement in the three-body reduced density matrix and discriminating between the presence of the two types of genuine tripartite entanglement, W/B and GHZ/W (the convex set of B states is comprised of mixed states of product and biseparable states; that of W states is comprised of mixed states of B states and W-type pure entangled states; and the GHZ (Greenberger-Horne-Zeilinger) set contains generic mixtures of any kind for a tripartite system). By choosing appropriate EW operators, the problem of finding GHZ and W EWs is reduced to linear programming. Specifically, we devise W EWs based on a spin-chain model with periodic boundary conditions, and we construct a class of parametrized GHZ EWs by linearly combining projection operators corresponding to all the different state-vector types arising for a three-fermion system. A third class of EWs is provided by a GHZ stabilizer operator capable of distinguishing W/B from GHZ/B entanglement, which is not possible with W EWs. Implementing these classes of EWs, it is found that all states containing genuine tripartite entanglement are of W type, and hence states containing GHZ/W genuine tripartite entanglement do not arise. Some genuine tripartite entangled states that have a positive partial transpose (PPT) with respect to some bipartition are detected. Finally, it is demonstrated that a NIFG does not exhibit 'pure'W/B genuine tripartite entanglement: three-party entanglement without any separable or biseparable admixture does not occur.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autonomous Guidance of Agile Small-scale Rotorcraft

This report describes a guidance system for agile vehicles based on a hybrid closed-loop model of the vehicle dynamics. The hybrid model represents the vehicle dynamics through a combination of linear-time-invariant control modes and pre-programmed, finite-duration maneuvers. This particular hybrid structure can be realized through a control system that combines trim controllers and a maneuvering control logic. The former enable precise trajectory tracking, and the latter enables trajectories at the edge of the vehicle capabilities. The closed-loop model is much simpler than the full vehicle equations of motion, yet it can capture a broad range of dynamic behaviors. It also supports a consistent link between the physical layer and the decision-making layer. The trajectory generation was formulated as an optimization problem using mixed-integer-linear-programming. The optimization is solved in a receding horizon fashion. Several techniques to improve the computational tractability were investigate. Simulation experiments using NASA Ames 'R-50 model show that this approach fully exploits the vehicle's agility.

Mettler, Bernard↗

Optimizing a Linear Array of Radiating Elements

EOPS empirically optimizes linear array of radiating elements. Program directly addresses problem of minimizing maximum side-lobe level of fixed length, linear arrays of radiating elements under realistic "on-the-vehicle" conditions. Used for both electromagnetic and acoustic arrays.

Blank, S. J.↗

A Linear Programming Approach to the Development of Contrail Reduction Strategies Satisfying Operationally Feasible Constraints

A class of strategies has been proposed to reduce contrail formation in the United States airspace. A 3D grid based on weather data and the cruising altitude level of aircraft is adjusted to avoid the persistent contrail potential area with the consideration to fuel-efficiency. In this paper, the authors introduce a contrail avoidance strategy on 3D grid by considering additional operationally feasible constraints from an air traffic controller's aspect. First, shifting too many aircraft to the same cruising level will make the miles-in-trail at this level smaller than the safety separation threshold. Furthermore, the high density of aircraft at one cruising level may exceed the workload for the traffic controller. Therefore, in our new model we restrict the number of total aircraft at each level. Second, the aircraft count variation for successive intervals cannot be too drastic since the workload to manage climbing/descending aircraft is much larger than managing cruising aircraft. The contrail reduction is formulated as an integer-programming problem and the problem is shown to have the property of total unimodularity. Solving the corresponding relaxed linear programming with the simplex method provides an optimal and integral solution to the problem. Simulation results are provided to illustrate the methodology.

Wei, Peng↗

Peak Power Minimization for Commercial Thermostatically Controlled Loads in Multi-Unit Grid-Interactive Efficient Buildings

The load profiles of most commercial and industrial consumers are characterized by brief periods of very high power consumption followed by intervals of lower demand. To encourage such consumers to flatten their load profiles, power utilities in and around the world often levy a monthly demand charge (DC) on the peak demand measured over brief intervals. In this work, we consider the joint optimization of energy costs (EC) and the instantaneous peak power of a multi-unit building which uses a hydronic heating, ventilation and cooling (HVAC) system and responds to a demand response (DR) program. Despite the non-linear structure of the problem, we show how optimal solutions can be obtained efficiently using linear programming. Next, we study the power demand patterns resulting from our proposed strategy for thermostatically controlled loads (TCLs), and evaluate the strategy’s performance for various climate zones in the US, under both typical and atypical weather conditions. Finally, the results show that depending on the ambient conditions and the tariff structure, our strategy can result in utility bill savings of up to nearly 19% compared to the baseline. The results also indicate that our power control strategy can significantly reduce the instantaneous peak power consumption in commercial TCLs.

HVAC↗

SatNet: A Benchmark for Satellite Scheduling Optimization

Satellites provide essential services such as networking and weather tracking, and the number of near-earth and deep space satellites are expected to grow rapidly in the coming years. Communications with terrestrial ground stations is one of the critical functionalities of any space mission. Satellite scheduling is a problem that has been scientifically investigated since the 1970s. A central aspect of this problem is the need to consider resource contention and satellite visibility constraints as they require line of sight. Due to the combinatorial nature of the problem, prior solutions such as linear programs and evolutionary algorithms require extensive compute capabilities to output a feasible schedule for each scenario. Machine learning based scheduling can provide an alternative solution by training a model with historical data and generating a schedule quickly with model inference. We present SatNet, a benchmark for satellite scheduling optimization based on historical data from the NASA Deep Space Network. We propose formulation of the satellite scheduling problem as a Markov Decision Process and use reinforcement learning (RL) policies to generate schedules. The nature of constraints imposed by SatNet differ from other combinatorial optimization problems such as vehicle routing studied in prior literature. Our initial results indicate that RL is an alternative optimization approach that can generate candidate solutions of comparable quality to existing state-of-the-practice results. However, we also find that RL policies overfit to the training dataset and do not generalize well to new data, thereby necessitating continued research on reusable and generalizable agents.

Wilson, Brian↗

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Impulsive Control for Continuous-Time Markov Decision Processes: A Linear Programming Approach

In this paper, we investigate an optimization problem for continuous-time Markov decision processes with both impulsive and continuous controls. We consider the so-called constrained problem where the objective of the controller is to minimize a total expected discounted optimality criterion associated with a cost rate function while keeping other performance criteria of the same form, but associated with different cost rate functions, below some given bounds. Our model allows multiple impulses at the same time moment. The main objective of this work is to study the associated linear program defined on a space of measures including the occupation measures of the controlled process and to provide sufficient conditions to ensure the existence of an optimal control.

97 MATHEMATICS AND COMPUTING↗

Cooperative Routing for an Air–Ground Vehicle Team—Exact Algorithm, Transformation Method, and Heuristics

This paper considers a cooperative vehicle routing problem for an intelligence, surveillance, and reconnaissance mission in the presence of communication constraints between the vehicles. The proposed framework uses a ground vehicle and an unmanned aerial vehicle (UAV) that travel cooperatively and visit a set of targets while satisfying the communication constraints. The problem is formulated as a mixed-integer linear program, and a branch-and-cut algorithm is developed to solve the problem to optimality. Furthermore, a transformation method and a heuristic are also developed for the problem. The effectiveness of all the algorithms is corroborated through extensive computational experiments on several randomly generated instances. Furthermore, this paper is motivated by an intelligence, surveillance, and reconnaissance mission involving a single unmanned aerial vehicle (UAV) and a ground vehicle, where the vehicles must coordinate their activity in the presence of communication constraints. The combination of a small UAV and a ground vehicle is an ideal platform for such missions, since small UAVs can fly at low altitudes and can avoid obstacles or threats that would be problematic for the ground vehicle alone. This paper addresses the coordinated routing problem involving these two vehicles and presents an algorithm to obtain an optimal solution for this problem, fast heuristics to obtain good feasible solutions, and also a transformation method to transform any instance of this cooperative vehicle routing problem to an instance of the one-in-a-set traveling salesman problem.

33 ADVANCED PROPULSION SYSTEMS↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗

ACOPF Transmission Switching Using Open-Source MINLP Solvers

The optimal transmission switching (OTS) problem with AC physics represents a mixed integer non-linear non-convex optimization problem which can provide benefits to transmission level power system operations. In this paper we benchmark a set of open-source mixed integer non-linear programming (MINLP) solvers on the OTS problem with AC physics using the pglib set of power system test cases. Results characterizing the performance of the different solvers are reported and discussed.

ACOPF↗

On orbital allotments for geostationary satellites

The following satellite synthesis problem is addressed: communication satellites are to be allotted positions on the geostationary arc so that interference does not exceed a given acceptable level by enforcing conservative pairwise satellite separation. A desired location is specified for each satellite, and the objective is to minimize the sum of the deviations between the satellites' prescribed and desired locations. Two mixed integer programming models for the satellite synthesis problem are presented. Four solution strategies, branch-and-bound, Benders' decomposition, linear programming with restricted basis entry, and a switching heuristic, are used to find solutions to example synthesis problems. Computational results indicate the switching algorithm yields solutions of good quality in reasonable execution times when compared to the other solution methods. It is demonstrated that the switching algorithm can be applied to synthesis problems with the objective of minimizing the largest deviation between a prescribed location and the corresponding desired location. Furthermore, it is shown that the switching heuristic can use no conservative, location-dependent satellite separations in order to satisfy interference criteria.

Gonsalvez, David J. A.↗

An efficient MILP framework for integrating nonlinear process dynamics and control in optimal production scheduling calculations

The emphasis currently placed on enterprise-wide decision making and optimization has led to an increased need for methods of integrating nonlinear process dynamics and control information in scheduling calculations. The inevitable high dimensionality and nonlinearity of first-principles dynamic process models makes incorporating them in scheduling calculations challenging. In this work, we describe a general framework for deriving data-driven surrogate models of the closed-loop process dynamics. Focusing on Hammerstein–Wiener and finite step response (FSR) model forms, we show that these models can be (exactly) linearized and embedded in production scheduling calculations. The resulting scheduling problems are mixed-integer linear programs with a special structure, which we exploit in a novel and efficient solution strategy. A polymerization reactor case study is utilized to demonstrate the merits of this method. Finally, our framework compares favorably to existing approaches that embed dynamics in scheduling calculations, showing considerable reductions in computational effort.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Tsunami evacuation mathematical model for the city of Padang

Tsunami is a series of wave trains which travels with high speed on the sea surface. This traveling wave is caused by the displacement of a large volume of water after the occurrence of an underwater earthquake or volcano eruptions. The speed of tsunami decreases when it reaches the sea shore along with the increase of its amplitudes. Two large tsunamis had occurred in the last decades in Indonesia with huge casualties and large damages. Indonesian Tsunami Early Warning System has been installed along the west coast of Sumatra. This early warning system will give about 10-15 minutes to evacuate people from high risk regions to the safe areas. Here in this paper, a mathematical model for Tsunami evacuation is presented with the city of Padang as a study case. In the model, the safe areas are chosen from the existing and selected high rise buildings, low risk region with relatively high altitude and (proposed to be built) a flyover ring road. Each gathering points are located in the radius of approximately 1 km from the ring road. The model is formulated as an optimization problem with the total normalized evacuation time as the objective function. The constraints consist of maximum allowable evacuation time in each route, maximum capacity of each safe area, and the number of people to be evacuated. The optimization problem is solved numerically using linear programming method with Matlab. Numerical results are shown for various evacuation scenarios for the city of Padang.

54 ENVIRONMENTAL SCIENCES↗