3,524 research outputs found

    Parameter estimation of electric power transformers using Coyote Optimization Algorithm with experimental verification

    Get PDF
    In this work, the Coyote Optimization Algorithm (COA) is implemented for estimating the parameters of single and three-phase power transformers. The estimation process is employed on the basis of the manufacturer's operation reports. The COA is assessed with the aid of the deviation between the actual and the estimated parameters as the main objective function. Further, the COA is compared with well-known optimization algorithms i.e. particle swarm and Jaya optimization algorithms. Moreover, experimental verifications are carried out on 4 kVA, 380/380 V, three-phase transformer and 1 kVA, 230/230 V, single-phase transformer. The obtained results prove the effectiveness and capability of the proposed COA. According to the obtained results, COA has the ability and stability to identify the accurate optimal parameters in case of both single phase and three phase transformers; thus accurate performance of the transformers is achieved. The estimated parameters using COA lead to the highest closeness to the experimental measured parameters that realizes the best agreements between the estimated parameters and the actual parameters compared with other optimization algorithms

    Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues

    Full text link
    Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm inspired by the convergence mechanism to the center of potential generated within a single well of a spatially co-located double-delta well setup. It mimics the wave nature of candidate positions in solution spaces and draws upon quantum mechanical interpretations much like other quantum-inspired computational intelligence paradigms. In this work, we introduce a Chebyshev map driven chaotic perturbation in the optimization phase of the algorithm to diversify weights placed on contemporary and historical, socially-optimal agents' solutions. We follow this up with a characterization of solution quality on a suite of 23 single-objective functions and carry out a comparative analysis with eight other related nature-inspired approaches. By comparing solution quality and successful runs over dynamic solution ranges, insights about the nature of convergence are obtained. A two-tailed t-test establishes the statistical significance of the solution data whereas Cohen's d and Hedge's g values provide a measure of effect sizes. We trace the trajectory of the fittest pseudo-agent over all function evaluations to comment on the dynamics of the system and prove that the proposed algorithm is theoretically globally convergent under the assumptions adopted for proofs of other closely-related random search algorithms.Comment: 27 pages, 4 figures, 19 table

    A hybrid GA–PS–SQP method to solve power system valve-point economic dispatch problems

    No full text
    This study presents a new approach based on a hybrid algorithm consisting of Genetic Algorithm (GA), Pattern Search (PS) and Sequential Quadratic Programming (SQP) techniques to solve the well-known power system Economic dispatch problem (ED). GA is the main optimizer of the algorithm, whereas PS and SQP are used to fine tune the results of GA to increase confidence in the solution. For illustrative purposes, the algorithm has been applied to various test systems to assess its effectiveness. Furthermore, convergence characteristics and robustness of the proposed method have been explored through comparison with results reported in literature. The outcome is very encouraging and suggests that the hybrid GA–PS–SQP algorithm is very efficient in solving power system economic dispatch problem
    • …
    corecore