Frequency stability-based controlled islanding scheme based on clustering algorithm and electrical distance using real-time dynamic criteria from WAMS data

Event-based MILP models for resource-constrained project scheduling problems

Inter-area oscillations and cascading failures are the most serious threats to the security of the electric power system. Uncontrolled islanding will occur in the event of an unstable inter-area oscillation or a progressive cascading failure. The establishment of uncontrolled islands with a deficiency in load-generation balance is the main reason for system blackout. Controlled islanding has been proposed as a preventive strategy for reducing the risk of blackout in this regard. A new algorithm for applying the controlled islanding strategy is proposed in this paper, based on load coherency and nearest electrical distances between coherent groups of generators. Coherent generators as the main core for controlled islands are identified in this method, which is based on the correlation coefficients between generators and the DBSCAN clustering algorithm. The sub-networks are then created by applying mixed-integer linear programming to each coherent group. Once this is accomplished, non-linear programming is used to construct the stable sub-networks associated with islands that meet the requirements of load-generation balance, voltage limitations, and transmission limits. The proposed scheme is implemented on the small-scale IEEE 39-bus system and a large-scale realistic power system which is the Iran power grid. The results demonstrate that the proposed method is capable of being implemented in a real power system.

This paper uses the method developed by Billionnet et al. (1999) to obtain tight upper bounds on the optimal values of mixed integer linear programming (MILP) formulations in grid-based wind farm layout optimization. The MILP formulations in grid-based wind farm layout optimization can be seen as linearized versions of the 0-1 quadratic knapsack problem (QKP) in combinatorial optimization. The QKP is NP-hard, which means the MILP formulations remain difficult problems to solve, especially for large problems with grid sizes of more than 500 points. The upper bound method proposed by Billionnet et al. is particularly well-suited for grid-based wind farm layout optimization problems, and was able to provide tight optimality gaps for a range of numerical experiments with up to 1296 grid points. The results of the numerical experiments also suggest that the greedy algorithm is a promising solution method for large MILP formulations in grid-based layout optimization that cannot be solved using standard branch and bound solvers.

In selecting the best mixed integer linear programming (MILP) formulation the important issue is to figure out how to evaluate the performance of each candidate formulation in terms of selected criteria. The main objective of this study is to propose a systematic approach to guide the selection of the best MILP formulation among the alternatives according to the needs of the decision maker. For this reason we consider the problem of “selecting the most appropriate MILP formulation for a certain type of decision maker” as a multi-criteria decision making problem and present an integrated AHP-TOPSIS decision making methodology to select the most appropriate formula­tion. As an example the proposed decision making methodology is implemented on the selection of the MILP formulations of the Capacitated Vehicle Routing Problem (CVRP). A numerical example is provided for illustrative purposes. As a result, the proposed decision model can be a tool for the decision makers (here they are the scientists, engineers and practitioners) who intend to choose the appropriate mathematical model(s) among the alternatives according to their needs on their studies. The integrated AHP-TOPSIS approach can simply be incorporated into a computer-based decision support system since it has simplicity in both computation and application.

Mixed integer linear programming for quality of service optimization in Clouds

A challenging Earth-observing satellite scheduling problem was recently studied in (Frank, Do and Tran 2016) for which the best resolution approach so far on the proposed benchmark is a time-indexed Mixed Integer Linear Program (MILP) formulation. This MILP formulation produces feasible solutions but is not able to prove optimality or to provide tight optimality gaps, making it difficult to assess the quality of existing solutions. In this paper, we first introduce an alternative disjunctive MILP formulation that manages to close more than half of the instances of the benchmark. This MILP formulation is then relaxed to provide good bounds on optimal values for the unsolved instances. We then propose a CP Optimizer model that consistently outperforms the original time-indexed MILP formulation, reducing the optimality gap by more than 4 times. This Constraint Programming (CP) formulation is very concise: we give its complete OPL implementation in the paper. Some improvements of this CP model are reported resulting in an approach that produces optimal or near-optimal solutions (optimality gap smaller than 1%) for about 80% of the instances. Unlike the MILP formulations, it is able to quickly produce good quality schedules and it is expected to be flexible enough to handle the changing requirements of the application.

An operationally induced approach to reliability-oriented ACOPF-constrained planning of interconnected multicarrier energy hubs: An MILP formulation

This paper presented a reduced-order method for swing mode eigenvalue calculating based on fuzzy coherency recognition. First, we recognize the coherent generator groups using the fuzzy clustering method. Then we aggregated the generators in a coherent group into a single equivalent generator that the dimension of the state equation reduced evidently. Using QR algorithm to the reduced-order state equation we calculated the eigenvalues of the inter-area mode. The eigenvalues of local mode calculated by using QR algorithm to the sub-state matrices corresponding to the coherent groups separately. Thus, all eigenvalues of swing mode can be calculated. We have given detailed results of both the coherent generator groups recognition and the eigenvalues calculating of the 10-machine New England power system. The results shows that the method for eigenvalue calculation is simple and practical.

Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay

This paper gives a mixed integer linear programming (MILP) formulation for a bi-level mathematical program with equilibrium constraints (MPEC) considering chance constraints. The particular MPEC problem relates to a power producer's bidding strategy: maximize its total benefit through determining bidding price and bidding power output while considering an electricity pool's operation and guessing the rival producer's bidding price. The entire decision-making process can be described by a bi-level optimization problem. The contribution of our paper is the MILP formulation of this problem. First, the lower-level pool operation problem is replaced by Karush-Kuhn-Tucker (KKT) optimality condition, which is further converted to an MILP formulation except a bilinear item in the objective function. Secondly, duality theory is implemented to replace the bilinear item by linear items. Finally, two types of chance constraints are examined and modeled in MILP formulation. With the MILP formulation, the entire MPEC problem considering randomness in price guessing can be solved using off-shelf MIP solvers, e.g., Gurobi. An example is given to illustrate the formulation and show the case study results.

In the literature, e.g. [10], one can find the so-called basic UAV mission target assignment in which m UAVs each with a capacity limit q visit n targets in a cooperative manner (and return to their departure points) such that the cost incurred by each UAV’s travel is minimized. In [10], we proposed a mixed integer linear program (MILP) formulation which exactly solves the problem, as well as four alternative MILP formulations which are computationally less intensive (and therefore suited for real-time purposes) yet yield a theoretically guaranteed sub-optimal solution. In this chapter, we further consider timing constraints imposed on some p of the targets, so-called prime targets. This consideration is often required for scenarios in which prime targets must be visited in a pre-defined time interval, and mathematically results in the addition of several integer linear constraints to the previous MILP formulation making the problem computationally intractable. We propose a novel procedure of adding these cumbersome timing constraints to the previous MILP formulation, in order to avoid increasing too much computational cost under practically valid assumptions. We first show that the proposed procedure still guarantees the previously claimed theoretical solution quality associated with the basic mission. We then show through extensive numerical simulations that under certain conditions, our algorithms return solutions which are still computationally manageable.

This paper presents a new coherency identification method for dynamic reduction of a power system. To achieve dynamic reduction, coherency-based equivalence techniques divide generators into groups according to coherency, and then aggregate them. In order to minimize the changes in the dynamic response of the reduced equivalent system, coherency identification of the generators should be clearly defined. The objective of the proposed coherency identification method is to determine the optimal coherent groups of generators with respect to the dynamic response, using the Partitioning Around Medoids (PAM) algorithm. For this purpose, the coherency between generators is first evaluated from the dynamic simulation time response, and in the proposed method this result is then used to define a dissimilarity index. Based on the PAM algorithm, the coherent generator groups are then determined so that the sum of the index in each group is minimized. This approach ensures that the dynamic characteristics of the original system are preserved, by providing the optimized coherency identification. To validate the effectiveness of the technique, simulated cases with an IEEE 39-bus test system are evaluated using PSS/E. The proposed method is compared with an existing coherency identification method, which uses the K-means algorithm, and is found to provide a better estimate of the original system.

This paper presents a novel mixed integer linear programing (MILP) formulation for finding the optimal layout of a fixed number of identical turbines that maximizes wind farm power generation. Previous MILP formulations with power maximizing objectives discretize the feasible space by using a grid of possible turbine locations. The proposed MILP formulation takes a different approach by allowing unrestricted placement of turbines, but treats wake cone overlap as a binary outcome. The rationale behind the proposed formulation is that the expansion of the feasible space for turbine placement in the proposed formulation would offset the disadvantage of using a lower fidelity binary wake cone overlap model. For small wind farms, the proposed formulation was able to produce superior layouts compared to a grid-based MILP formulation.

One of the main obstacles in using mixed integer linear programming (MILP) formulations for large-scale open pit production scheduling is the size of the problem. The objective of this work is to develop, implement, and verify deterministic MILP formulations for long-term large-scale open pit production scheduling problems. The objective of the model is to maximize the net present value, while meeting grade blending, mining and processing capacities, and the precedence of block extraction constraints. We present four MILP formulations; the first two models are modifications of available models; we also propose, test and validate two new MILP formulations. To reduce the number of binary integer variables in the formulation, we aggregate blocks into larger units referred to as mining-cuts. We compare the performances of the proposed models based on net present value generated, practical mining production constraints, size of the mathematical programming formulations, the number of integer variables required in formulation, and the computational time required for convergence. An iron ore mine case study is represented to illustrate the practicality of the models as well.

Optimal operation of water-energy microgrids; a mixed integer linear programming formulation