{'fraction_non_alphanumeric': 0.020664869721473494, 'fraction_numerical': 0.008086253369272238, 'mean_word_length': 5.293785310734464, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Integer Linear Programming Approach for Phasor Measurement Unit Placement

Phasor Measurement Units (PMUs) are essential devices in the monitoring and protection of modern power systems. However, its prohibitive cost may limit the wide installation of this device in the networks. For this reason, in this paper, the problem of optimal PMU placement was solved using Integer Linear Programming and some metaheuristic techniques, such as, the Genetic Algorithms, Particle Swarm Optimization and Cuckoo Search. In addition, the test feeders were modeled as graphs, in order to introduce the domination concepts of graph theory in this problem formulation and, using the upper and lower bounds of the domination number, evaluate the optimization algorithms results. The proposed methodology was performed using the IEEE 13, 34, 37 and 123 node test feeders, and it can be generalized for feeders with higher dimensions. Based on the results, it is possible to conclude that the Integer Linear Programming is the most suitable for this application, presenting the lowest number of PMUs and the fastest convergence.