1,498 research outputs found

    A cuckoo search optimization scheme for non-convex economic load dispatch

    Get PDF
    This paper presents a Cuckoo Search (CS) based algorithm to solve constrained economic load dispatch (ELD) problems. The proposed methodology easily deals with non-smoothness of cost function arising due to the use of valve point effects. The performance of the algorithm has been tested on systems possessing 13 and 40 generating units involving varying degrees of complexity. The findings affirm that the method outperforms the existing techniques, and can be a promising alternative approach for solving the ELD problems in practical power system

    A shifted hyperbolic augmented Lagrangian-based artificial fish two swarm algorithm with guaranteed convergence for constrained global optimization

    Get PDF
    This article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based algorithm for non-convex constrained global optimization problems. Convergence to an ε-global minimizer is proved. At each iteration k, the algorithm requires the ε(k)-global minimization of a bound constrained optimization subproblem, where ε(k) → ε. The subproblems are solved by a stochastic population-based metaheuristic that relies on the artificial fish swarm paradigm and a two-swarm strategy. To enhance the speed of convergence, the algorithm invokes the Nelder–Mead local search with a dynamically defined probability. Numerical experiments with benchmark functions and engineering design problems are presented. The results show that the proposed shifted hyperbolic augmented Lagrangian compares favorably with other deterministic and stochastic penalty-based methods.This work was supported by COMPETE [POCI-01-0145-FEDER-007043]; FCT-Fundacao para a Ciencia e Tecnologia within the Project Scope [UID/CEC/00319/2013]; and partially supported by CMAT-Centre of Mathematics of the University of Minho

    Non-convex constrained economic power dispatch with prohibited operating zones and piecewise quadratic cost functions

    Get PDF
    This paper is focused on the solution of the non-convex economic power dispatch problem with piecewise quadratic cost functions and practical operation constraints of generation units. The constraints of the economic dispatch problem are power balance constraint, generation limits constraint, prohibited operating zones and transmission power losses. To solve this problem, a meta-heuristic optimization algorithm named crow search algorithm is proposed. A constraint handling technique is also implemented to satisfy the constraints effectively. For the verification of the effectiveness and the superiority of the proposed algorithm, it is tested on 6-unit, 10-unit and 15-unit test systems. The simulation results and statistical analysis show the efficiency of the proposed algorithm. Also, the results confirm the superiority and the high-quality solutions of the proposed algorithm when compared to the other reported algorithms

    Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism for Solving Large-Scale Economic Dispatch With Valve-Point Effects and Multiple Fuel Options

    Get PDF
    This paper presents a new metaheuristic optimization algorithm, the firefly algorithm (FA), and an enhanced version of it, called chaos mutation FA (CMFA), for solving power economic dispatch problems while considering various power constraints, such as valve-point effects, ramp rate limits, prohibited operating zones, and multiple generator fuel options. The algorithm is enhanced by adding a new mutation strategy using self-adaptation parameter selection while replacing the parameters with fixed values. The proposed algorithm is also enhanced by a self-adaptation mechanism that avoids challenges associated with tuning the algorithm parameters directed against characteristics of the optimization problem to be solved. The effectiveness of the CMFA method to solve economic dispatch problems with high nonlinearities is demonstrated using five classic test power systems. The solutions obtained are compared with the results of the original algorithm and several methods of optimization proposed in the previous literature. The high performance of the CMFA algorithm is demonstrated by its ability to achieve search solution quality and reliability, which reflected in minimum total cost, convergence speed, and consistency

    A binary symmetric based hybrid meta-heuristic method for solving mixed integer unit commitment problem integrating with significant plug-in electric vehicles

    Get PDF
    Conventional unit commitment is a mixed integer optimization problem and has long been a key issue for power system operators. The complexity of this problem has increased in recent years given the emergence of new participants such as large penetration of plug-in electric vehicles. In this paper, a new model is established for simultaneously considering the day-ahead hourly based power system scheduling and a significant number of plug-in electric vehicles charging and discharging behaviours. For solving the problem, a novel hybrid mixed coding meta-heuristic algorithm is proposed, where V-shape symmetric transfer functions based binary particle swarm optimization are employed. The impact of transfer functions utilised in binary optimization on solving unit commitment and plug-in electric vehicle integration are investigated in a 10 unit power system with 50,000 plug-in electric vehicles. In addition, two unidirectional modes including grid to vehicle and vehicle to grid, as well as a bi-directional mode combining plug-in electric vehicle charging and discharging are comparatively examined. The numerical results show that the novel symmetric transfer function based optimization algorithm demonstrates competitive performance in reducing the fossil fuel cost and increasing the scheduling flexibility of plug-in electric vehicles in three intelligent scheduling modes

    Investigating evolutionary computation with smart mutation for three types of Economic Load Dispatch optimisation problem

    Get PDF
    The Economic Load Dispatch (ELD) problem is an optimisation task concerned with how electricity generating stations can meet their customers’ demands while minimising under/over-generation, and minimising the operational costs of running the generating units. In the conventional or Static Economic Load Dispatch (SELD), an optimal solution is sought in terms of how much power to produce from each of the individual generating units at the power station, while meeting (predicted) customers’ load demands. With the inclusion of a more realistic dynamic view of demand over time and associated constraints, the Dynamic Economic Load Dispatch (DELD) problem is an extension of the SELD, and aims at determining the optimal power generation schedule on a regular basis, revising the power system configuration (subject to constraints) at intervals during the day as demand patterns change. Both the SELD and DELD have been investigated in the recent literature with modern heuristic optimisation approaches providing excellent results in comparison with classical techniques. However, these problems are defined under the assumption of a regulated electricity market, where utilities tend to share their generating resources so as to minimise the total cost of supplying the demanded load. Currently, the electricity distribution scene is progressing towards a restructured, liberalised and competitive market. In this market the utility companies are privatised, and naturally compete with each other to increase their profits, while they also engage in bidding transactions with their customers. This formulation is referred to as: Bid-Based Dynamic Economic Load Dispatch (BBDELD). This thesis proposes a Smart Evolutionary Algorithm (SEA), which combines a standard evolutionary algorithm with a “smart mutation” approach. The so-called ‘smart’ mutation operator focuses mutation on genes contributing most to costs and penalty violations, while obeying operational constraints. We develop specialised versions of SEA for each of the SELD, DELD and BBDELD problems, and show that this approach is superior to previously published approaches in each case. The thesis also applies the approach to a new case study relevant to Nigerian electricity deregulation. Results on this case study indicate that our SEA is able to deal with larger scale energy optimisation tasks
    corecore