The identification and localization of a fault are a basic requirement for optimal operation of a modern power system. An effective fault identification method significantly reduces outage time, improves the electrical supply reliability, and enhances the speed of protection control. This paper proposes a novel method based on the theory of the two-terminal traveling wave range to identify the fault location in a voltage source converter based high voltage direct current (VSC-HVDC) system containing mixed cable and overhead line segments. It uses variational mode decomposition (VMD) and the Teager energy operator (TEO) as a new method to detect the traveling wave fault through a fault signal. The effectiveness of the proposed method is verified via time domain simulation of the hybrid VSC-HVDC transmission system using PSCAD/EMTDC and MATLAB software. Simulation results show that the proposed method demonstrates high fault location accuracy and excellent robustness with a slight effect on transient resistance and fault types, and that it performs better than the existing transient detection techniques, such as wavelet transform and ensemble empirical mode decomposition.
This paper presents a novel improved firefly algorithm (IFA) to deal the problem of the optimal operation of thermal generating units (OOTGU) with the purpose of reducing the total electricity generation fuel cost. The proposed IFA is developed based on combining three improvements. The first is to be based on the radius between two solutions, the second is updated step size for each considered solution based on different new equations, and the third is to slightly modify a formula producing new solutions by using normally distributed random numbers and canceling uniform random numbers of conventional firefly algorithm (FA). The effect of each proposed improvement on IFA is investigated by executing five benchmark functions and two different systems. The performance of IFA is investigated on six other study cases consisting of different types of objective function and complex level of constraints. The objective function considers single fuel with quadratic form and nonconvex form, and multifuels with the sum of several quadratic and nonconvex functions while a set of constraints taken into account are power loss, prohibited zone, ramp rate limit, spinning reserve, and all constraints in transmission power networks. The obtained results indicate the proposed improvements in terms of high optimal solution quality, stabilization of search ability, and fast convergence compared with FA. In addition, the comparisons with other methods also lead to a conclusion that the proposed method is a very promising optimization tool for systems with quadratic fuel cost function and with complicated constraints.
This paper proposes an efficient and new modified differential evolution algorithm (ENMDE) for solving two short-term hydrothermal scheduling (STHTS) problems. The first is to take the available water constraint into account, and the second is to consider the reservoir volume constraints. The proposed method in this paper is a new, improved version of the conventional differential evolution (CDE) method to enhance solution quality and shorten the maximum number of iterations based on two new modifications. The first focuses on a self-tuned mutation operation to open the local search zone based on the evaluation of the quality of the solution, while the second focuses on a leading group selection technique to keep a set of dominant solutions. The contribution of each modification to the superiority of the proposed method over CDE is also investigated by implementing CDE with the self-tuned mutation (STMDE), CDE with the leading group selection technique (LGSDE), and CDE with the two modifications. In addition, particle swarm optimization (PSO), the bat algorithm (BA), and the flower pollination algorithm (FPA) methods are also implemented through four study cases for the first problem, and two study cases for the second problem. Through extensive numerical study cases, the effectiveness of the proposed approach is confirmed.
In this paper, a novel improved Antlion optimization algorithm (IALO) has been proposed for solving three different IEEE power systems of optimal reactive power dispatch (ORPD) problem. Such three power systems with a set of constraints in transmission power networks such as voltage limitation of all buses, limitations of tap of all transformers, maximum power transmission limitation of all conductors and limitations of all capacitor banks have given a big challenge for global optimal solution search ability of the proposed method. The proposed IALO method has been developed by modifying new solution generation technique of standard antlion optimization algorithm (ALO). By optimizing three single objective functions of systems with 30, 57 and 118 buses, the proposed method has been demonstrated to be more effective than ALO in terms of the most optimal solution search ability, solution search speed and search stabilization. In addition, the proposed method has also been compared to other existing methods and it has obtained better results than approximately all compared ones. Consequently, the proposed IALO method is deserving of a potential optimization tool for solving ORPD problem and other optimization problems in power system optimization fields.
This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization. The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS). The first modification is to keep only one formula and abandon one formula in the diffusion process while the second modification and the third modification are used in the first update and the second update. In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated. This manner results in the fact that some promising solutions around the high quality solutions can be missed. In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update. In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates. Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability. Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system. The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed. Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods. Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters. As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem.
This paper proposes an improved coyote optimization algorithm (ICOA) for optimizing the location and sizing of solar photovoltaic distribution generation units (PVDGUs) in radial distribution systems. In the considered problem, four single objectives consisting of total power losses, capacity of all PVDGUs, voltage profile index, and harmonic distortions are minimized independently while satisfying branch current limits, voltage limits, and harmonic distortion limits exactly and simultaneously. The performance of the proposed ICOA method has been improved significantly since two improvements were carried out on the two new solution generations of the conventional coyote optimization algorithm (COA). By finding four single objectives from two IEEE distribution power systems with 33 buses and 69 buses, the impact of each proposed improvement and two proposed improvements on the real performance of ICOA has been investigated. ICOA was superior to COA in terms of capability of finding higher quality solutions, more stable search ability, and faster convergence speed. Furthermore, we have also applied five other metaheuristic algorithms consisting of biogeography-based optimization (BBO), genetic algorithm (GA), particle swarm optimization algorithm (PSO), sunflower optimization (SFO), and salp swarm algorithm (SSA) for dealing with the same problem and evaluating further performance of ICOA. The result comparisons have also indicated the outstanding performance of ICOA because it could find much better results than these methods, especially SFO, SSA, and GA. Consequently, the proposed ICOA is a very effective method for finding the optimal location and capacity of PVDGUs in radial distribution power systems.
Abstract:A feasible control strategy is proposed to control a doubly fed induction generator based on the wind energy converter system (DFIG-WECS). The main aim is to enhance the steady state and dynamic performance under the condition of the parameter perturbations and external disturbances and to satisfy the stator power response of the system. Within the proposed control method, the control scheme for the rotor side converter (RSC) is developed on the model predictive control. Firstly, the self-adaptive reference trajectory is established from the deduced discrete state-space equation of the generator. Then, the rotor voltage is calculated by minimizing the global performance index under the current prediction steps at the sampling instant. Through the control scheme for the grid side converter (GSC) and wind turbine, we have re-applied the conventional control. The effectiveness of the proposed control strategy is verified via time domain simulation of a 150 kW-575 V DFIG-WECS using Matlab/Simulink. The simulation result shows that the control of the DFIG with the proposed control method can enhance the steady and dynamic response capability better than the conventional ones when the system faces errors due to the parameter perturbations, external disturbances and the rotor speed.
Economic load dispatch (ELD) is an important optimization problem for operating and controlling modern power systems, and if ELD is effectively executed, power systems work stably and economically. The main objective of this paper is to develop a novel method to solve the ELD with the purpose of minimizing the total fuel cost of all available generating units while requirements are to satisfy all constraints regarding thermal units, generators, and transmission power networks. The proposed high performance cuckoo search algorithm (HPCSA) is developed from the efficient technique for the second new solution generation of conventional cuckoo search algorithm (CCSA), called adaptive mutation technique. This proposed technique diversifies the local search ability based on a new comparison criterion. The HPCSA is verified on difference systems under special conditions, namely the 10-unit system with multi fuels, 15-unit system considering prohibited operating zones, and three IEEE systems with 30, 57, and 118 buses considering transmission power network constraints. The specific evaluation of the HPCSA is compared to that of Lagrange optimization-based methods (LMS), neural network-based methods (NNMS), CCSA, and other popular methods such as Particle swarm optimization (PSO) variants, Differential evolution (DE) variants, Genetic Algorithm (GA) variants, and state-of-the-art methods. In comparison with CCSA, the proposed method is always more effective and more robust since the proposed method can find most solutions with better quality and faster convergence speed. In comparison with LMS and NNMS, the proposed method can also find solutions with approximate or equal quality. In comparison with popular methods and state-of-the-art methods, the proposed method has more potential since it can reach faster convergence to valid solutions with approximate or better quality. Consequently, it can be concluded that the proposed HPCSA is an effective optimization tool for dealing with ELD problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.