19 research outputs found

    Optimal Reactive Power Scheduling Using Cuckoo Search Algorithm

    Get PDF
    This paper solves an optimal reactive power scheduling problem in the deregulated power system using the evolutionary based Cuckoo Search Algorithm (CSA). Reactive power scheduling is a very important problem in the power system operation, which is a nonlinear and mixed integer programming problem. It optimizes a specific objective function while satisfying all the equality and inequality constraints. In this paper, CSA is used to determine the optimal settings of control variables such as generator voltages, transformer tap positions and the amount of reactive compensation required to optimize the certain objective functions. The CSA algorithm has been developed from the inspiration that the obligate brood parasitism of some Cuckoo species lay their eggs in nests of other host birds which are of other species. The performance of CSA for solving the proposed optimal reactive power scheduling problem is examined on standard Ward Hale 6 bus, IEEE 30 bus, 57 bus, 118 bus and 300 bus test systems. The simulation results show that the proposed approach is more suitable, effective and efficient compared to other optimization techniques presented in the literature

    GWO-based estimation of input-output parameters of thermal power plants

    Get PDF
    The fuel cost curve of thermal generators was very important in the calculation of economic dispatch and optimal power flow. Temperature and aging could make changes to fuel cost curve so curve estimation need to be done periodically. The accuracy of the curve parameters estimation strongly affected the calculation of the dispatch. This paper aims to estimate the fuel cost curve parameters by using the grey wolf optimizer method. The problem of curve parameter estimation was made as an optimization problem. The objective function to be minimized was the total number of absolute error or the difference between the actual value and the estimated value of the fuel cost function. The estimated values of parameter that produce the smallest total absolute error were the values of final solution. The simulation results showed that parameter estimation using gray wolf optimizer method further minimized the value of objective function. By using three models of fuel cost curve and given test data, parameter estimation using grey wolf optimizer method produced the better estimation results than those estimation results obtained using least square error, particle swarm optimization, genetic algorithm, artificial bee colony and cuckoo search methods

    Optimal power flow solutions for power system operations using moth-flame optimization algorithm

    Get PDF
    Optimal power flow (OPF) has gained a growing attention from electrical power researchers since it is a significant tool that assists utilities of power system to determine the optimal economic and secure operation of the electric grid. The key OPF objective is to optimize a certain objective function such as: minimization of total fuel cost, emission, real power transmission loss, voltage deviation, etc. while fulfilling certain operation constraints like bus voltage, line capacity, generator capability and power flow balance. Optimal reactive power dispatch (ORPD) is a sub-problem of optimal power flow. ORPD has a considerable impact on the economic and the security of the electric power system operation and control. ORPD is considered a mixed nonlinear problem because it contains continuous and discrete control variables. Another sub-problem of OPF is Economic dispatch (ED) which one of the complex problems in the power system which its purposes is to determine the optimal allocation output of generator unit to satisfy the load demand at the minimum economic cost of generation while meeting the equality and inequality constraints. In this thesis, a recent metaheuristic nature-inspired optimization algorithm namely: Moth-Flame Optimizer (MFO) is applied to solve the two subproblems of Optimal power flow (OPF) namely: Economic dispatch (ED) and Optimal reactive power dispatch (ORPD) simultaneously. Three objective functions will be considered: generation cost minimization, transmission power loss minimization, and voltage deviation minimization using a weighted factor. The IEEE 30-bus test system and IEEE 57-bus test system will be employed, to investigate the effectiveness of the proposed MFO in solving the above-mentioned problems. Then the obtained MFO methods results is compared with other reported well-known methods. The comparison proves that MFO offers a better result compared to the other selected methods. In IEEE 30-bus test system, MFO outperform the other optimization methods with 967.589961/hcomparedto971.411400/h compared to 971.411400 /h, 983.738069/h,975.346233/h, 975.346233/h, 985.198050/h,1035.537820/h, 1035.537820/h for Improved Grey Wolf Optimizer (IGWO), Grey Wolf Optimizer (GWO), Ant Loin Optimizer (ALO), Whale Optimization Algorithm (WOA), and Sine Cosine Algorithm (SCA) respectively. In IEEE 57-bus test system, MFO offers a minimization of 19.16% compared to 19.03% and 18.98% for Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA) respectively. Moreover, the MFO have speedy convergence rate and smooth curves more than the other algorithms

    Hybrid intelligent deep kernel incremental extreme learning machine based on differential evolution and multiple population grey wolf optimization methods

    Get PDF
    Focussing on the problem that redundant nodes in the kernel incremental extreme learning machine (KI-ELM) which leads to ineffective iteration increase and reduce the learning efficiency, a novel improved hybrid intelligent deep kernel incremental extreme learning machine (HI-DKIELM) based on a hybrid intelligent algorithms and kernel incremental extreme learning machine is proposed. At first, hybrid intelligent algorithms are proposed based on differential evolution (DE) and multiple population grey wolf optimization (MPGWO) methods which used to optimize the hidden layer neuron parameters and then to determine the effective hidden layer neurons number. The learning efficiency of the algorithm is improved by reducing the network complexity. Then, we bring in the deep network structure to the kernel incremental extreme learning machine to extract the original input data layer by layer gradually. The experiment results show that the HI-DKIELM methods proposed in this paper with more compact network structure have higher prediction accuracy and better ability of generation compared with other ELM methods

    Optimal Overcurrent Relays Coordination using an Improved Grey Wolf Optimizer

    Get PDF
    Recently, nature inspired algorithms (NIA) have been implemented to various fields of optimization problems. In this paper, the implementation of NIA is reported to solve the overcurrent relay coordination problem. The purpose is to find the optimal value of the Time Multiplier Setting (TMS) and Plug Setting (PS) in order to minimize the primary relays’ operating time at the near end fault. The optimization is performed using the Improved Grey Wolf Optimization (IGWO) algorithm. Some modifications to the original GWO have been made to improve the candidate’s exploration ability. Comprehensive simulation studies have been performed to demonstrate the reliability and efficiency of the proposed modification technique compared to the conventional GWO and some well-known algorithms. The generated results have confirmed the proposed IGWO is able to optimize the objective function of the overcurrent relay coordination problem

    Omega grey wolf optimizer (ωGWO) for optimization of overcurrent relays coordination with distributed generation

    Get PDF
    Inverse definite minimum time (IDMT) overcurrent relays (OCRs) are among protective devices installed in electrical power distribution networks. The devices are used to detect and isolate the faulty area from the system in order to maintain the reliability and availability of the electrical supply during contingency condition. The overall protection coordination is thus very complicated and could not be satisfied using the conventional method moreover for the modern distribution system. This thesis apply a meta-heuristic algorithm called Grey Wolf Optimizer (GWO) to minimize the overcurrent relays operating time while fulfilling the inequality constraints. GWO is inspired by the hunting behavior of the grey wolf which have firm social dominant hierarchy. Comparative studies have been performed in between GWO and the other well-known methods such as Differential Evolution (DE), Particle Swarm Optimizer (PSO) and Biogeographybased Optimizer (BBO), to demonstrate the efficiency of the GWO. The study is resumed with an improvement to the original GWO’s exploration formula named as Omega-GWO (ωGWO) to enhance the hunting ability. The ωGWO is then implemented to the realdistribution network with the distributed generation (DG) in order to investigate the drawbacks of the DG insertion towards the original overcurrent relays configuration setting. The GWO algorithm is tested to four different test cases which are IEEE 3 bus (consists of six OCRs), IEEE 8 bus (consists of 14 OCRs), 9 bus (consists of 24 OCRs) and IEEE 15 bus (consists of 42 OCRs) test systems with normal inverse (NI) characteristic curve for all test cases and very inverse (VI) curve for selected cases to test the flexibility of the GWO algorithm. The real-distribution network in Malaysia which originally without DG is chosen, to investigate and recommend the optimal DG placement that have least negative impact towards the original overcurrent coordination setting. The simulation results from this study has established that GWO is able to produce promising solutions by generating the lowest operating time among other reviewed algorithms. The superiority of the GWO algorithm is proven with relays’ operational time are reduced for about 0.09 seconds and 0.46 seconds as compared to DE and PSO respectively. In addition, the computational time of the GWO algorithm is faster than DE and PSO with the respective reduced time is 23 seconds and 37 seconds. In Moreover, the robustness of GWO algorithm is establish with low standard deviation of 1.7142 seconds as compared to BBO. The ωGWO has shown an improvement for about 55% and 19% compared to other improved and hybrid method of GA-NLP and PSO-LP respectively and 0.7% reduction in relays operating time compared to the original GWO. The investigation to the DG integration has disclosed that the scheme is robust and appropriate to be implemented for future system operational and topology revolutions
    corecore