A distributed consensus based algorithm for economic dispatch over time‐varying digraphs

The Economic Dispatch (ED) is one of the most important optimization problems in power systems the ultimate goal of the ED is to minimize the cost of operations in a power generation. In this paper, the Woodpecker Mating Algorithm (WMA) is used to solve the ED problem considering the nonlinear properties of generators such as valve point effects (VPE), prohibited operating zones (POZ), ramp rate limits, multiple fuel options, and transmission loss. The WMA algorithm is a novel metaheuristic algorithm inspired by the mating behavior of woodpeckers and sound intensity (a physical quantity). The WMA is implemented on six test systems of different operational dimensions and characteristics to show its capacity for solving the ED problem. The results are compared with the latest and most efficient methods introduced in the literature. Proving the efficiency of the WMA to solve the ED problem, simulation results are promising and offer the optimal fuel cost of production.

Solving non-convex economic load dispatch problem via artificial cooperative search algorithm

Economical dispatch of power is a significant real time optimization problem in the operation of power system, which allocates the loads on the committed generating units to reduce the generation cost, while meeting all the inequality and equality constraints. Traditionally, economic load dispatch problems have been formulated as convex optimization problem and various classical methods such as gradient methods, base-point participation factor method, etc. have been used for solving them. The traditional formulation is a quadratic input-output curve or piece wise linear cost curve, which are continuous and convex, however, real generating units have valve loading effects, which make the cost curve discontinuous and non-convex and hence the economic dispatch problem is no longer simple to handle. Thus, the classical methods cannot be employed for non-convex problems. The non-convex, non-linear and discontinuous economic dispatch (ED) problem can be better solved by metaheuristic approaches. Such approaches often require tuning of their respective evolutionary parameters. Although, solution to such type of problem have already been solved by different metaheuristic optimization techniques in previous studies as well, however, the algorithm employed in this paper to solve Power Economic Load Dispatch (PELD) problem is adaptive real coded quantum-inspired evolutionary algorithm, which does not require tuning of evolutionary parameters and performs better than some of the existing techniques on standard 6-bus 3 machine system and IEEE 14 bus 5 unit system.

A new honey bee mating optimization algorithm for non-smooth economic dispatch

This paper focuses on the design of an initialization-free distributed finite-time algorithm for the economic dispatch problem in smart grid, where the generation units only communicate with its neighbors to minimize the total cost cooperatively. Firstly, the optimal solution of the economic dispatch problem is analyzed in accordance with the saddle-point dynamics. Then, an initialization-free finite-time algorithm is presented to guarantee the active power generation and the incremental cost converge to the optimal solution in a distributed manner. At last, some numerical simulations are preformed to validate the proposed method.

The increased complexity of modern energy network raises the necessity of flexible and reliable methods for smart grid operation. To this end, this article is centered on the economic dispatch problem (EDP) in smart grids, which aims at scheduling generators to meet the total demand at the minimized cost. This article proposes a fully distributed algorithm to address the EDP over directed networks and takes into account communication delays and noisy gradient observations. In particular, the rescaling gradient technique is introduced in the algorithm design and the implementation of the distributed algorithm only resorts to row-stochastic weight matrices, which allows each generator to locally allocate the weights on the messages received from its in-neighbors. It is proved that the optimal dispatch can be achieved under the assumptions that the nonidentical constant communication delays inflicting on each link are uniformly bounded and the noises embroiled in gradient observation of every generator are bounded variance zero mean. Simulations are provided to validate and testify the effectiveness of the presented algorithm.

The capability of economic dispatch (ED) algorithms to address the power dispatch problem with unknown cost functions and switching network topology is an important feature for practical applications of power dispatch algorithms in smart grid. Inspired by distributed fast consensus technique and reinforcement learning (RL) approach, this research presents a kind of ED strategy consisting of a fixed-time consensus tracking (FCT) algorithm and a distributed RL-based power dispatch algorithm to address the economic dispatch problem (EDP) with unknown cost functions and switching network topology. Different with existing results on EDP of smart grid where the feasible power outputs are calculated from centralized algorithm, a distributed FCT algorithm is utilised to balance the power demand and output for each dispatch duration, where the achievement of such a consensus leads to feasible power outputs and secures the system performance against switching interaction topology. Then, a distributed RL-based power dispatch algorithm is developed to train a policy for solving EDP with unknown cost functions through the technique of distributed training with distributed execution (DTDE). Finally, case studies are presented to demonstrate the effectiveness of the proposed ED algorithms.

Solving non-convex economic dispatch problem with valve point effects using modified group search optimizer method

Economic load dispatch is one of the vital purposes in electrical power system operation, management and planning. Economic dispatch problem is one of the most important problems in electric power system operation. In large scale system, the problem is more complex and difficult to find out optimal solution because it is nonlinear function and it contains number of local optimal. Combined economic emission dispatch (CEED) problem is to schedule the committed generating units outputs to meet the required load demand at minimum operating cost with minimum emission simultaneously. The main aim of economic load dispatch is to reduce the total production cost of the generating system and at the same time the necessary equality and inequality constraints should also be fulfilled. This leads to the development of CEED techniques. There are various techniques proposed by several researchers to solve CEED problem based on optimization techniques. But still some problems such as slower convergence and higher computational complexity exist in using the optimization techniques such as GA for solving CEED problem. This paper proposes an efficient and reliable technique for combined fuel cost economic optimization and emission dispatch using the Modified Ant Colony Optimization algorithm (MACO) to produce better optimal solution. The simulation results reveal the significant performance of the proposed MACO approach.

A hybrid optimization framework for the non-convex economic dispatch problem via meta-heuristic algorithms

The major issue in power system is economic dispatch (ED) problem. The Economic dispatch problem is aim to distribute electrical power generators in some active electrical system to minimize the total of cost of generators. Here, the purpose of this paper is to achieve the combination of power output, maximum total of demand with the transmission losses, minimum the total cost of generating unit and design web based application to simplify the calculation of economic dispatch problem for user at PT. Indonesia Power. This paper introduces a solution to ED problem using Dr. Xin She Yang developed firefly algorithm. The result obtained by the proposed algorithm have been compared with the result from the data source and that results is more optimal using firefly algorithm than the results of the data source. Based on the result, it can be concluded that this web based application is very useful to user in calculating the economic dispatch problem with transmission losses at PT. Indonesia Power.

Firefly Algorithm for solving non-convex economic dispatch problems with valve loading effect

Decentralized algorithms to solve the economic dispatch problem (EDP) in smart grids have been a significant focus within engineering research due to their advantages in scalability, robustness, and flexibility. Its purpose is to optimize the generation power of each generator to jointly achieve the minimal total generation cost on the premise of satisfying the total demand and generation capacity. Recently, the emergence of data security and the requirement for complex computing have led to a resurgence of activity in this area. To address EDP while considering the issues of private security and computation efficiency, we propose a novel privacy-protected decentralized random sleep algorithm over an unbalanced directed network. On the one hand, the proposed algorithm can effectively protect sensitive information by adding conditional noises in the state exchange. On the other hand, it can also promote computation efficiency over an unbalanced directed network by incorporating the random sleep strategy into the decentralized inexact gradient method with the gradient rescaling technique. It is proved that the proposed algorithm is able to achieve the optimal solution of the EDP. Furthermore, we also provide theoretical proof to guarantee the convergence and privacy properties of the proposed algorithm. Finally, two simulation examples of EDP in smart grids are provided to demonstrate the effectiveness of the proposed algorithm.

In the current scenario Economic Dispatch problem has taken a suitable twist as the public has become increasingly concerned with environmental matters. The dispatch of systems to minimise pollutants, as well as to achieve minimum cost are the two main constraints to be dealt with. In this paper, Global optimization techniques such as Honey Bee’s and Simulated Annealing techniques are employed together (HB-SA) to solve the Combined static Economic and Emission dispatch (CEED) problems in power system. This paper clearly is justified with the results, separately obtained for the above two techniques and is also provided with the results on applying both the algorithms separately. With practical consideration, Economic Dispatch will have non-smooth cost functions with equality and inequality constraints that make the problem, a large-scale highly constrained non linear optimization problem. As to demonstrate the effectiveness of the proposed method, it is subjected to the CEED problems considering (or) handling valve point loading effects. Comparison with other optimization techniques showed the superiority of the proposed HB-SA approach and confirmed its potential for solving nonlinear CEED problems.

This chapter discusses the application of linear programming (LP) techniques to find the optimal solution of the economic dispatch (ED) problem without considering transmission losses. The ED problem is concerned with optimizing the power generated by several generating units. The objective is to find the optimal power produced by each unit to supply the required load at minimum total cost. The generation cost associated with each unit is usually in the form of a quadratic or cubic function of the power produced. To apply LP, these nonlinear cost functions have to be linearized. The optimal solution is then determined by LP based on the approximate linear model. Piece-wise linearization methodology is adopted in this chapter. To evaluate the performance of the linearization method, a comprehensive set of benchmark test problems is used. LP solutions of linearized ED problems are compared with several other techniques from the literature. The LP technique with piece-wise linearization shows an overall competitive advantage in terms of total cost, solution time, and load satisfaction.