Economic Load Dispatch Using Oppositional Backtracking Search Algorithm

2017 ◽  
Vol 6 (2) ◽  
pp. 79-97 ◽  
Author(s):  
Moumita Pradhan ◽  
Provas Kumar Roy ◽  
Tandra Pal
Keyword(s):  
Large Scale ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Economic Load Dispatch ◽  
Invasive Weed ◽  
Backtracking Search ◽  
Backtracking Search Algorithm ◽  
Test Systems ◽  
Generation Cost ◽  
Feasible Solutions

In this paper, an oppositional backtracking search algorithm (OBSA) is proposed to solve the large scale economic load dispatch (ELD) problem. The main drawback of the conventional backtracking search algorithm (BSA) is that it produces a local optimal solution rather than the global optimal solution. The proposed OBSA methodology is a highly-constrained optimization problem has to minimize the total generation cost by satisfying several constraints involving load demand, generation limits, prohibited operating zone, ramp rate limits and valve point loading effect. The proposed method is applied for three test systems and provides the unique and fast solutions. The new heuristic OBSA approach is successfully applied in three test systems consisting of 13 and 140 thermal generators. The test results are judged against various methods. The simulation results show the effectiveness and accuracy of the proposed OBSA algorithm over other methods like conventional BSA, oppositional invasive weed optimization (OIWO), Shuffled differential evolution (SDE) and oppositional real coded chemical reaction optimization (ORCCRO). This clearly suggests that the new OBSA method can achieve effective and feasible solutions of nonlinear ELD problems.

Large-scale economic load dispatch using squirrel search algorithm

2020 ◽  
Vol 14 (6) ◽  
pp. 1351-1380
Author(s):  
Sakthivel V.P. ◽  
Suman M. ◽  
Sathya P.D.
Keyword(s):  
Power Plants ◽  
Large Scale ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Technique ◽  
Research Work ◽  
Superior Performance ◽  
Economic Load Dispatch ◽  
Fuel Cost ◽  
Content Type

Purpose Economic load dispatch (ELD) is one of the crucial optimization problems in power system planning and operation. The ELD problem with valve point loading (VPL) and multi-fuel options (MFO) is defined as a non-smooth and non-convex optimization problem with equality and inequality constraints, which obliges an efficient heuristic strategy to be addressed. The purpose of this study is to present a new and powerful heuristic optimization technique (HOT) named as squirrel search algorithm (SSA) to solve non-convex ELD problems of large-scale power plants. Design/methodology/approach The suggested SSA approach is aimed to minimize the total fuel cost consumption of power plant considering their generation values as decision variables while satisfying the problem constraints. It confers a solution to the ELD issue by anchoring with foraging behavior of squirrels based on the dynamic jumping and gliding strategies. Furthermore, a heuristic approach and selection rules are used in SSA to handle the constraints appropriately. Findings Empirical results authenticate the superior performance of SSA technique by validating on four different large-scale systems. Comparing SSA with other HOTs, numerical results depict its proficiencies with high-qualitative solution and by its excellent computational efficiency to solve the ELD problems with non-smooth fuel cost function addressing the VPL and MFO. Moreover, the non-parametric tests prove the robustness and efficacy of the suggested SSA and demonstrate that it can be used as a competent optimizer for solving the real-world large-scale non-convex ELD problems. Practical implications This study has compared various HOTs to determine optimal generation scheduling for large-scale ELD problems. Consequently, its comparative analysis will be beneficial to power engineers for accurate generation planning. Originality/value To the best of the authors’ knowledge, this manuscript is the first research work of using SSA approach for solving ELD problems. Consequently, the solution to this problem configures the key contribution of this paper.

scholarly journals Improved Backtracking Search Algorithm Based on Population Control Factor and Optimal Learning Strategy

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Lei Zhao ◽  
Zhicheng Jia ◽  
Lei Chen ◽  
Yanju Guo
Keyword(s):  
Learning Strategy ◽  
Search Algorithm ◽  
Population Control ◽  
Pso Algorithm ◽  
Convergence Speed ◽  
Evolutionary Equation ◽  
Control Factor ◽  
Local Optimum ◽  
Backtracking Search ◽  
Backtracking Search Algorithm

Backtracking search algorithm (BSA) is a relatively new evolutionary algorithm, which has a good optimization performance just like other population-based algorithms. However, there is also an insufficiency in BSA regarding its convergence speed and convergence precision. For solving the problem shown in BSA, this article proposes an improved BSA named COBSA. Enlightened by particle swarm optimization (PSO) algorithm, population control factor is added to the variation equation aiming to improve the convergence speed of BSA, so as to make algorithm have a better ability of escaping the local optimum. In addition, enlightened by differential evolution (DE) algorithm, this article proposes a novel evolutionary equation based on the fact that the disadvantaged group will search just around the best individual chosen from previous iteration to enhance the ability of local search. Simulation experiments based on a set of 18 benchmark functions show that, in general, COBSA displays obvious superiority in convergence speed and convergence precision when compared with BSA and the comparison algorithms.

Sign in / Sign up

Export Citation Format

Share Document