Implementing a projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs.
Abstract not provided.
Punla-Green, She'ifa↗
SEARCH · Engineering Papers
Results for “Mixed 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.
Coordinated Control Method of Voltage and Reactive Power for Active Distribution Networks Based on Soft Open Point
The increasing penetration of distributed generators (DGs) exacerbates the risk of voltage violations in active distribution networks (ADNs). The conventional voltage regulation devices limited by the physical constraints are difficult to meet the requirement of real-time voltage and VAR control (VVC) with high precision when DGs fluctuate frequently. But, soft open point (SOP), a flexible power electronic device, can be used as the continuous reactive power source to realize the fast voltage regulation. Considering the cooperation of SOP and multiple regulation devices, this paper proposes a coordinated VVC method based on SOP for ADNs. Firstly, a time-series model of coordi-nated VVC is developed to minimize operation costs and eliminate voltage violations of ADNs. Then, by applying the linearization and conic relaxation, the original nonconvex mixed-integer non-linear optimization model is converted into a mixed-integer second-order cone programming (MISOCP) model which can be efficiently solved to meet the requirement of voltage regulation rapidity. Here, we carried out some case studies on the IEEE 33-node system and IEEE 123-node system to illustrate the effectiveness of the proposed method.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimal Electrification Using Renewable Energies: Microgrid Installation Model with Combined Mixture k-Means Clustering Algorithm, Mixed Integer Linear Programming, and Onsset Method
Optimal planning and design of microgrids are priorities in the electrification of off-grid areas. Indeed, in one of the Sustainable Development Goals (SDG 7), the UN recommends universal access to electricity for all at the lowest cost. Several optimization methods with different strategies have been proposed in the literature as ways to achieve this goal. This paper proposes a microgrid installation and planning model based on a combination of several techniques. The programming language Python 3.10 was used in conjunction with machine learning techniques such as unsupervised learning based on K-means clustering and deterministic optimization methods based on mixed linear programming. These methods were complemented by the open-source spatial method for optimal electrification planning: onsset. Four levels of study were carried out. The first level consisted of simulating the model obtained with a cluster, which is considered based on the elbow and k-means clustering method as a case study. The second level involved sizing the microgrid with a capacity of 40 kW and optimizing all the resources available on site. The example of the different resources in the Togo case was considered. At the third level, the work consisted of proposing an optimal connection model for the microgrid based on voltage stability constraints and considering, above all, the capacity limit of the source substation. Finally, the fourth level involved a planning study of electrification strategies based mainly on microgrids according to the study scenario. The results of the first level of study enabled us to obtain an optimal location for the centroid of the cluster under consideration, according to the different load positions of this cluster. Then, the results of the second level of study were used to highlight the optimal resources obtained and proposed by the optimization model formulated based on the various technology costs, such as investment, maintenance, and operating costs, which were based on the technical limits of the various technologies. In these results, solar systems account for 80% of the maximum load considered, compared to 7.5% for wind systems and 12.5% for battery systems. Next, an optimal microgrid connection model was proposed based on the constraints of a voltage stability limit estimated to be 10% of the maximum voltage drop. The results obtained for the third level of study enabled us to present selective results for load nodes in relation to the source station node. Finally, the last results made it possible to plan electrification using different network technologies and systems in the short and long term. The case study of Togo was taken into account. The various results obtained from the different techniques provide the necessary leads for a feasibility study for optimal electrification of off-grid areas using microgrid systems.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Data-Driven Energy Resilience Assessment and Enhancement in Urban Communities: A Case Study in Detroit
This paper presents a data-driven framework for assessing and enhancing energy resilience in urban communities. The resilience assessment is based on two datasets: 1) annual aggregated power outage data and 2) 15-minute interval outage data. High-impact, low-probability (HILP) events are identified within these datasets to evaluate community resilience under extreme conditions. To enhance resilience, an optimization framework utilizing mixed integer linear programming is developed to determine the optimal sizing and placement of solar photovoltaic (PV) systems and battery energy storage systems (BESS). This method offers a cost-effective and practical solution for improving energy resilience in vulnerable communities. Furthermore, a case study of the City of Detroit in Michigan demonstrates the effectiveness of the framework through simulation and validation.
Energy resilience assessment↗
Optimal Voltage Reference for Droop-Based DERs in Distribution Systems
Due to the newly issued standards on distributed energy resources (DERs), the droop-based operation modes (Q-V and P-V droops) become a requirement for all the interconnected DER units at the distribution level. Voltage references of the DER units can be assigned to improve the operational behavior of the distribution system in the smart grid context. This paper presents a novel formulation for optimally setting voltage reference of the droop-based DER units in distribution systems with the objective of minimizing the system ohmic loss. This problem is formulated as a mixed-integer quadratic convex optimization problem in MATLAB and solved by the MATLAB and CPLEX solvers. The IEEE 123-bus system and the EPRI test system Ckt5 are used to validate the proposed formulation. The result obtained from the proposed formulation is compared with the result of the original problem solved by the heuristic method. Based on the numerical study results, system loss can be reduced after the proposed voltage reference assignment. The computational expense of the new formulation is also much lower than that of the heuristic approach.
distributed energy resource integration↗
Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks
We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.
Mixed Integer Programming↗
Optimal, centralized dynamic curbside parking space zoning
In this paper we formulate a dynamic mixed integer program for optimally zoning curbside parking spaces subject to transportation policy-inspired constraints and regularization terms. First, we illustrate how given some objective of curb zoning valuation as a function of zone type (paid parking, bus stop, etc.), dynamically rezoning involves unrolling this optimization program over a fixed time horizon. Second, we implement two different solution methods given an example curb zoning valuation. In the first method, we solve long horizon dynamic zoning problems via approximate dynamic programming. In the second method, we employ Dantzig-Wolfe decomposition to break-up the mixed-integer program into a master problem and several sub-problems that can be solved in parallel. This speeds up the computational solve-time of the MIP considerably. We present simulation results and comparisons of the different employed techniques on vehicle arrival-rate data obtained for a neighborhood in downtown Seattle, Washington, USA.
Nazir, Mohammad Nawaf↗
DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems
Not provided.
Mathematics↗
A satellite system synthesis model for orbital arc allotment optimization
A mixed-integer programming formulation is presented of a satellite system synthesis problem, or geostationary-orbital-planning synthesis problem, which is refered to as the arc allotment problem (AAP). Each satellite administration is to be allotted a weighted-length segment of the geostationary orbital arc within which its satellites may be positioned at any longitude. The objective function maximizes the length of the unweighted arc segment allotted to every administration, subject to single-entry cochannel interference restrictions and constraints imposed by the visible arc for each administration. Useful relationships between special cases of AAP and another satellite synthesis problem are established. Solutions to two example problems are presented.
Reilly, Charles H.↗
An Optimization Approach to Support Science Decision Making for Lunar Surface Exploration
Introduction: Scientific exploration is one of the three pillars of NASA’s Moon2Mars architecture, with crew surface extra vehicular activities (EVA) serving a critical enabling function. Development of surface EVA operational planning and execution, specifically integrating science and flight control teams (FCT), is currently being explored through analog scenarios. This integration, exercised, for example, through the Joint EVA and Hu-man Surface Mobility Test Team (JETT), allows for science input on EVA activities in near real-time through a Science Evaluation Room (SER), or Arte-mis science backroom, which integrates with the broader FCT through the Science Officer. The SER works within the FCT to support dynamic EVA planning in response to changes in operational constraints as well as science opportunities and re-prioritization, increasing the mission science return and accelerating the accomplishment of the Moon2Mars science objectives. The SER works within the FCT to provide recommendations to traverse execution in near real-time. One challenge is the requirement to deliver SER inputs to the FCT on operationally relevant timelines. Failure to do so may result in suboptimal execution of science exploration EVAs or even loss of key science objectives. To close this gap, we present a network optimization tool to allow the SER to provide rapid input to the FCT in response to changes in operational constraints or science opportunities. Inputs are predicated on approved science objectives, and clear rationale must be provided to the FCT for any requested change. Accordingly, this tool incorporates the Science Traceability Matrix (STM), SER prioritization scheme, and station characterization and action planning with operational constraints such as duration, traverse speed, and distance to maximize science objectives based on SER priorities, consistent with FCT operational requirements. Method: As a proof of concept, we used an existing linear programing software package used to simulate optimal routes through cellular metabolism. We built a Demonstrative Model with three STM objectives and four stations on a region of the Moon. The objectives were given an arbitrary prioritization and mapped to the stations through four possible crew actions. (Figs. 1 and 2). This station to STM mapping is consistent with the method used by the JETT5 Science Team to develop analog surface EVA science planning. We used a grid system with the landing site at the origin and the four stations placed across the positive x,y quadrant. Actions were assigned to each station and the accomplishment of those actions resulted in a numerical “reward” based on the ability of that action to achieve science objectives. The aggregate reward from each individual STM objective contributes to a global score (Science Yield), weighted by its priority. Operational constraints included a requirement to start and end at the landing site, 5 minutes each for initial station characterization and “clean up,” and variable total EVA time, traverse rate (fixed to 0.5 meters per second in our example), and time to perform each action (10, 5, 7, and 15 min for actions 1, 2, 3, and 4, respectively). Additional constraints and variables will be added in the future (e.g., sample mass, number of stations, traverse route constraints, illumination). Optimization. We converted the connections (arcs) between these stations (nodes) into a mixed integer linear programming optimization problem (arcs = constraints, nodes = variables) with the objective to maximize Science Yield. For any action, the Science Yield is equal to the relevance of that action to an STM objective [3, 2, and 1 point(s) for High, Med., and Low relevance, respectively], multiplied by the STM Objective Priority [3, 2, and 1 point(s) for High, Med., and Low priority, respectively]. This resulted in a model that computes the optimal station and action combination to maximize the Science Yield. These weightings can be adjusted by the SER as desired. Results: We explored three test cases for the Demonstrative Model. First, we set the maximum EVA duration to 120 minutes and computed the optimal route (Fig. 3A). The model suggested per-forming Actions 1 and 2 at Station P01, followed by Actions 1 and 2 at Station P02, and finally Actions 1 and 3 at Station P04 before returning to the Landing Site. Second, we adjusted the STM Objective Priori-ty order and computed the new optimal route (Fig. 3B). Under this situation, the model suggested per-forming all Actions at Station P02 followed by all Actions at Station P03. The previous test cases were relevant to SER planning activities. Next, we explored providing mid-EVA replanning input to the FCT. Scenario: While executing the Route in Fig. 3A the crew finishes at Station P01 and FCT decides that the EVA needs to finish in 45 minutes back at the Landing Site. FCT asks SER to recommend changes to the plan to accommodate this operation-al change. Using the model and incorporating these new constraints (start at Station P01, max. time of 45 min), the model suggested performing Actions 2 and 4 at Station P03 (Fig. 4), requiring 41 minutes to complete and return to the Landing Site. Interestingly, Station 3 was not part of the original route. Using the model, we determined the EVA would need 66 minutes, instead of 45, in order for the original Station P04 to yield a larger Science Yield than Station P03. The parametrization and simulation was per-formed in less than a minute, demonstrating the operational relevance of the approach. Future Efforts: The results from the Demonstrative Model suggest this tool can accelerate SER decision making on operationally relevant timelines. Use in analog activities, such as JETT5 or follow-ons, which have over a dozen stations for a crew to explore and over a dozen actions per station, will provide needed validation of the utility of this tool for planning EVAs, replanning mid-EVA, or planning follow-on EVAs based on previous results. Further integration with FCT execution monitoring tools may provide additional efficiency gains, al-lowing rapid and iterative exploration of operation-al and science decision space by the FCT and SER.
Science Operations↗
Cascade energy optimization for waste heat recovery in distributed energy systems
The efficiency of distributed energy systems can be significantly increased through waste heat recovery from industry or power generation. The technologies used for this process are typically dependent on the quality and temperature grades of waste heat. To maximize the efficiency of cascade heat utilization, it is important to optimize the choice of waste heat recovery technologies and their operation. Here, a detailed mixed integer linear programming optimization model is proposed for waste heat recovery in a district-scale microgrid. The model can distinguish waste heat quality for planning and operation optimization of distributed energy systems. Heat utilization technologies are formulated in this developed model and categorized in different temperature grades. The developed model is validated using four typical cases under different settings of system operation and business models. It is found that the optimization model, by distinguishing waste heat temperature, can increase energy cost savings by around 5%, compared to models that do not consider waste heat temperature grades. Additionally, the results indicate that the developed model can provide more realistic configuration and technologies dispatch.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Mixed Integer Programming and Heuristic Scheduling for Space Communication
Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.
Lee, Charles H.↗
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↗
MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys: A DIRECT-inspired optimization algorithm for experimentally accessible computational material design
Computational materials design has suffered from a lack of algorithms formulated in terms of experimentally accessible variables. Here we formulate the problem of (ternary) alloy optimization at the level of choice of atoms and their composition that is normal for synthesists. Mathematically, this is a mixed integer problem where a candidate solution consists of a choice of three elements, and how much of each of them to use. This space has the natural structure of a set of equilateral triangles. We solve this problem by introducing a novel version of the DIRECT algorithm that (1) operates on equilateral triangles instead of rectangles and (2) works across multiple triangles. We demonstrate on a test case that the algorithm is both robust and efficient. Lastly, we offer an explanation of the efficacy of DIRECT -- specifically, its balance of global and local search -- by showing that 'potentially optimal rectangles' of the original algorithm are akin to the Pareto front of the 'multi-component optimization' of global and local search.
97 MATHEMATICS AND COMPUTING↗
A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints
This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.
97 MATHEMATICS AND COMPUTING↗
Dynamic Optimal Dispatch of Energy Systems with Intermittent Renewables and Damage Model
With the increasing penetration of intermittent renewable energy sources into the grid, there is a growing need for process systems-based strategies that integrate dispatchable and variable energy systems for supplying the demand while maintaining grid reliability. The proposed framework corresponds to a dynamic mixed-integer linear programming optimization approach that integrates coal-fired and natural gas-fired power plants, NaS batteries for energy storage, and solar/wind energy to supply the demand. This optimization approach considers an economic goal and constraints to provide power balance while maintaining the overall damage of the natural gas combined cycle (NGCC) power plant drum under a maximum stress as well as avoiding the overheating of the NGCC superheater and reheater. Renewable curtailment levels are also retained at minimum levels. Case studies are analyzed considering different loads and renewable penetration levels. The results show that the demand was met for all cases. Grid flexibility was mostly provided by the NGCC, while the batteries were used sparingly. In addition, considering a CO 2 equivalent analysis, the environmental performance was intrinsically connected to grid flexibility and the level of renewable penetration. Stress analysis results reinforced the necessity for an equipment health-related constraint.
97 MATHEMATICS AND COMPUTING↗
Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Here, this paper presents a set of new convex quadratic relaxations for nonlinear and mixed-integer nonlinear programs arising in power systems. The considered models are motivated by hybrid discrete/continuous applications where existing approximations do not provide optimality guarantees. The new relaxations offer computational efficiency along with minimal optimality gaps, providing an interesting alternative to state-of-the-art semidefinite programming relaxations. Finally, three case studies in optimal power flow, optimal transmission switching and capacitor placement demonstrate the benefits of the new relaxations.
42 ENGINEERING↗
A General Framework for Process Synthesis, Integration, and Intensification
Process synthesis, integration, and intensification are the three pillars of process design. Current synthesis and integration methods are able to find optimal design targets and process configurations when all the alternatives are known beforehand. Process intensification, on the other hand, combines multiple physicochemical phenomena and exploits their interactions to create innovative designs. Often times, these designs are not known beforehand, and a phenomena-level representation of chemical processes are required to identify them. This disconnection between the three paradigms limits the ability to systematically discover optimal design pathways. We demonstrate that the building block representation, originally proposed in our earlier work on process intensification, has the potential to bridge this gap. Depending on the attributes assigned to the interior and the boundaries of these two-dimensional abstract building blocks, they can represent various intensified or isolated phenomena at the lowest level, various tasks at the equipment level, and various unit operations at the flowsheet level. Here, this common multiscale representation enables an mixed-integer nonlinear optimization-based single framework for the sequential or simultaneous synthesis, integration, and intensification of chemical processes. Such a general framework is critical to reduce the risk of eliminating potential intensification pathways and candidate flowsheets at the conceptual design stage. The framework is demonstrated using a case study on an ethylene glycol process.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗