• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.612-620
• /
• 2017

Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.7
• /
• pp.966-973
• /
• 2012

In microgrid demonstration site, distributed generations can make bidirectional power flows on the system. If an accident occurs, the fault current from the inverter based distributed generation is small. However, the conventional protection scheme in distribution network is designed to operate at high fault current. This means that the traditional protection of distribution network is no longer applicable and new protection methods must be developed. In this paper, for two cases, algorithms for protection coordination of demonstration site is proposed and verified through PSCAD/EMTDC simulation. In first case, protection devices are assumed to have the abilities of directional relaying and communication. In second case, protection devices do not have those abilities. Proposed protection coordination algorithms detect the fault locations and protect the microgrid fairly well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.216-239
• /
• 2021

The present work addresses the challenging problem of coordinating power allocation with interference management in multi-robot networks by applying the promising expansion capabilities of multiple-input multiple-output (MIMO) and full duplex systems, which achieves it for maximizing the throughput of networks under the impacts of Doppler frequency shifts and external jamming. The proposed power allocation with interference coordination formulation accounts for three types of the interference, including cross-tier, co-tier, and mixed-tier interference signals with cluster head nodes operating in different full-duplex modes, and their signal-to-noise-ratios are respectively derived under the impacts of Doppler frequency shifts and external jamming. In addition, various optimization algorithms, including two centralized iterative optimization algorithms and three decentralized optimization algorithms, are applied for solving the complex and non-convex combinatorial optimization problem associated with the power allocation and interference coordination. Simulation results demonstrate that the overall network throughput increases gradually to some degree with increasing numbers of MIMO antennas. In addition, increasing the number of clusters to a certain extent increases the overall network throughput, although internal interference becomes a severe problem for further increases in the number of clusters. Accordingly, applications of multi-robot networks require that a balance should be preserved between robot deployment density and communication capacity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.12
• /
• pp.1791-1800
• /
• 2012

This paper presents effective design schemes for a photovoltaic (PV) and battery hybrid system that includes state-of-the-art technologies such as maximum power point tracking scheme for PV arrays, an effective charging/discharging circuit for batteries, and grid-interfacing power inverters. Compared to commonly-used PV systems, the proposed configuration has more flexibility and autonomy in controlling individual components of the PV-battery hybrid system. This paper also proposes an intelligent coordination scheme for the components of the PV-battery hybrid system to improve the efficiency of renewable energy resources and peak-load management. The proposed algorithm is based on a rule-based expert system that has excellent capability to optimize multi-objective functions. The proposed configuration and algorithms are investigated via switching-level simulation studies of the PV-battery hybrid system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1088-1095
• /
• 1999

This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.

• Journal of Korean Society of Transportation
• /
• v.11 no.1
• /
• pp.87-103
• /
• 1993

The subject this paper is the signal control strategy under oversaturated conditions. The nature of traffic control for oversaturation is essentially different from the standard control modes. While under non-saturated situation traffic control is needed for the sake of safety and efficiency, the throughput is essential under oversaturated conditions. Therefore berth objective and strategies differ. For an oversaturated stream the cycle time and the signal offset are thought to be of rather secondary importance. For this case the green split may well be the most important control variable to serve the excessive demand. Up to now, however, most efforts have concentrated on the strategy with the concept which lies just on the extension of Webster's. "Green-split Coordination Strategy for Over-Saturated Networks", presents newly contrived three types of strategies named Forward-coordination, Backward-coordination and Network-coordination respectively and describes the algorithms with the evaluations. The forward coordination strategy treats the forward wave of flow between two signals. The aim is to prevent the outbreak of queue due to the accumulation of temporary excess of demand in near-saturation or saturation flow. The backward coordination strategy treats the backward rave of flow between two signals. The goal is to prevent the waste of green time caused by the exit block at the upstream signal. for this purpose a feedback regulation is provided of the upstream green-split so that the inflow-outflow balance is kept zero. The resultant surplus of green time is alloted to other signal stages. Also here the examination is made of the appropriate value of the feedback control parameter. The network coordination strategy is operated to maximize the network throughput in a specific direction applying a bang-bang control at the bottleneck intersection. This is a type of intervenient control for policy reasons. For this strategy the green-split coordinations, particuarly the backward coordination, are essential as the tactical elements. In order to evaluate the preposed strategies those are compared with the latest existing strategy called saturation-degree-ratio control by the simulation experiments in an assumed 4$\times$4 grid network. The results are satisfactory showing a 10-15% reduction in delays and a 15% increase in network capacity.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.49-52
• /
• 2003

IEEE 802.11 MAC uses a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance (CSMA/CA) for medium access. Random back-off algorithm helps to avoid the collision. This paper proposes virtual back-off and modified back-off algorithm for reduce a waiting time by back-off and reduce the collision. The modified DCF is consisted of these two algorithms. We expect to reduce the average waiting time of each transmission by using the modified DCF algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.20-29
• /
• 1990

In this paper, we propose the \ulcorner/G algorithm that is an efficient distributed process coordination algorithm. It controls mutually exclusive access to a shared resource in a distributed system. We show that the \ulcorner/G algorithm satisfies the properties of distributed systems. In performnace, the algorithm is more efficient than existing algorithms because it sends only 3(K-1)/G meassages.

• Transactions on Electrical and Electronic Materials
• /
• v.18 no.3
• /
• pp.169-175
• /
• 2017

A safe and reliable protection system in distribution networks, specifically, those hosting distribution generation units, needs a robust over-current protection scheme. To avoid unintentional DG disconnection during fault conditions, a protection system should operate quickly and selectively. Therefore, to achieve this aim, satisfying coordination constraints are important for any protection scheme in distribution networks; these pose a challenging task in interconnected and large-scale networks. In this paper, a new coordination strategy, based on the same non-standard time-current curve for all relays, in order to find optimal coordination of directional over-current relays, is proposed. The main aim is to reduce violations, especially miscoordination between pair relays. Besides this, the overall time of operation of relays during primary and backup operations should be minimized concurrently. This work is being tackled based on genetic algorithms and motivated by the heuristic algorithm. For the numerical analysis, to show the superiority of this coordination strategy, the IEEE 30-bus test system, with a mesh structure and supplemented with distributed generation, is put under extensive simulations, and the obtained results are discussed in depth.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.151-156
• /
• 2012

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.