Zero-one Integer Programming Approach to Determine the Minimum Break Point Set in Multi-loop and Parallel Networks

Abstract

-The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

A Mathematical Program for Scheduling Preventive Maintenance of Cogeneration Plants with Production

“…For cogeneration systems, a panoply of optimization approaches varying from approximate to exact methods are available. Approximate approaches vary from simple heuristics, tabu search to genetic algorithms [12][13][14][16][17][18][19] whereas exact approaches are mostly integer programming based [20][21][22][23][24][25][26].…”

Optimal Overcurrent Relays Coordination in the Presence Multi TCSC on Power Systems Using BBO Algorithm

“…The measured impedance by distance relay for inter phase faults, as well as variation of the measured impedance in inter phase faults, when using TCSC on an adjacent transmission line, are reported in [8], comparing TCSC placements on mid-point and ends of second circuit of double circuit line from distance relay has been reported in [9]. In recent years, many research efforts have been made to achieve optimum protection coordination (optimum solution for relay settings) without TCSC using different optimization techniques, including Random Search (RS) technique is reported in [10], Evolutionary Algorithms (EA) is presented in [11] while Differential Evolution Algorithm (DEA) in [12], Modified Differential Evolution Algorithm (MDEA) in [13], and Self-Adaptive Differential Evolutionary (SADE) algorithm in [14], application Particle Swarm Optimization (PSO) in [15], and Modified Particle Swarm Optimizer in [16,17], and Evolutionary Particle Swarm Optimization (EPSO) Algorithm in [18], Box-Muller Harmony Search (BMHS) in [19], Zero-one Integer Programming (ZOIP) Approach in [20], Seeker Algorithm (SA) is presented in [21], and Teaching Learning-Based Optimization (TLBO) in [22].…”

A zero-one integer programming for preventive maintenance scheduling for electricity and distiller plants with production

“…0-1-IP was used widely in many other problems and found to produce competitive results (see e.g. Wang and Wang, 2014;Ferdowsi et al, 2018;Moirangthem et al, 2012). The model designed in this paper is reliable and capable of generating a good schedule for industrial sectors.…”