Integer programming

About: Integer programming is a research topic. Over the lifetime, 25381 publications have been published within this topic receiving 618828 citations.

An optimal PMU placement method for power system observability

Abstract: Phasor Measurement Unit (PMU) is considered to be the most significant device in future power system measurements. It provides phasor information (both magnitude and phase angle) which can be used in the real time control of power systems. In this paper, optimal PMU placement problem (OPP) is articulated as a binary integer linear programming (BILP) using Balas additive algorithm (BAA). PMU installations will be decided by binary decision variables (0, 1) for full network observability while minimizing the number of PMU installations. Existence of zero injection buses was also considered to reduce the number of PMUs used for observability. Power system connectivity matrix represented in binary form and simple heuristics are used to solve the problem. Optimal PMU placement problem has multiple solutions with equal costs. For further ranking of these multiple solutions measurement redundancy is used. The proposed algorithm has been tested on IEEE 9-bus, 14-bus, 24-bus, 30-bus systems.

Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing

Abstract: In last decade, researchers have focused on improving existing methodologies through hybrid algorithms; these are a combination of algorithms between a metaheuristic with other metaheuristic and an exact method, to solve combinatorial optimization problems in the best possible way. This work presents a benchmark of different methodologies to solve the binary cutting stock problem using a column generation framework, this framework is divided into master and subproblem, master problem is solved using a classical integer linear programming, and the subproblem is solved using metaheuristic algorithms (genetic algorithm, simulated annealing and particle swarm optimization). This benchmark analysis is aimed to compare hybrid metaheuristics results with an exact methodology.

Efficient reasoning about data trees via integer linear programming

Abstract: Data trees provide a standard abstraction of XML documents with data values: they are trees whose nodes, in addition to the usual labels, can carry labels from an infinite alphabet (data). Therefore, one is interested in decidable formalisms for reasoning about data trees. While some are known -- such as the two-variable logic -- they tend to be of very high complexity, and most decidability proofs are highly nontrivial. We are therefore interested in reasonable complexity formalisms as well as better techniques for proving decidability.Here we show that many decidable formalisms for data trees are subsumed -- fully or partially -- by the power of tree automata together with set constraints and linear constraints on cardinalities of various sets of data values. All these constraints can be translated into instances of integer linear programming, giving us an NP bound on the complexity of the reasoning tasks. We prove that this bound, as well as the key encoding technique, remain very robust, and allow the addition of features such as counting of paths and patterns, and even a concise encoding of constraints, without increasing the complexity. We also relate our results to several reasoning tasks over XML documents, such as satisfiability of schemas and data dependencies and satisfiability of the two-variable logic.

Multi-feature fusion-based power load identification method and system

Abstract: The invention provides a multi-feature fusion-based power load identification method and system The method comprises the steps of monitoring an active power at a power utilization inlet of a user; solving the active power by integer programming to determine a probably-existing load at the moment; acquiring a power sequence by a sliding window algorithm on the active power; extracting statistical characteristic and singular value characteristic according to the power sequence; solving similarity with each characteristic of the probably-existing load by Euclidean distance according to the statistical characteristic and the singular value characteristic; converting multi-similarity of the similarities of the statistical characteristic and the singular value characteristic to comprehensive similarity by a linear weighting sum method; and comparing the maximum value of the comprehensive similarity with a set threshold value to determine the load running at the moment With the adoption of integer programming, the calculation dimensionality is reduced; and by multi-feature fusion, the load at the power utilization inlet of the user can be accurately identified, and the method has robustness on fluctuation of the load power