Economic Dispatch Problems Using Backtracking Search Optimization

2018 ◽  
Vol 7 (2) ◽  
pp. 39-60
Author(s):  
Kuntal Bhattacharjee
Keyword(s):  
Large Scale ◽  
Transmission Loss ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Inequality Constraints ◽  
Optimization Techniques ◽  
Backtracking Search ◽  
Search Optimization ◽  
Set Up ◽  
Optimum Solution

The purpose of this article is to present a backtracking search optimization technique (BSA) to determine the feasible optimum solution of the economic load dispatch (ELD) problems involving different realistic equality and inequality constraints, such as power balance, ramp rate limits, and prohibited operating zone constraints. Effects of valve-point loading, multi-fuel option of large-scale thermal plants, system transmission loss are also taken into consideration for more realistic application. Two effective operations, mutation and crossover, help BSA algorithms to find the global solution for different optimization problems. BSA has the capability to deal with multimodal problems due to its powerful exploration and exploitation capability. BSA is free from sensitive parameter control operations. Simulation results set up the proposed approach in a better stage compared to several other existing optimization techniques in terms quality of solution and computational efficiency. Results also reveal the robustness of the proposed methodology.

A Modern Approach to Solve of Economic Load Dispatch using Group Leader Optimization Technique

2017 ◽  
Vol 6 (1) ◽  
pp. 66-85 ◽  
Author(s):  
Subhajit Roy ◽  
Kuntal Bhattacharjee ◽  
Aniruddha Bhattacharya
Keyword(s):  
Optimization Algorithm ◽  
Large Scale ◽  
Power Transmission ◽  
Transmission Loss ◽  
Optimization Technique ◽  
Group Leader ◽  
Optimization Techniques ◽  
Economic Load Dispatch ◽  
Modern Approach

Economic load dispatch plays an important role of power system operation & control by using different soft techniques that have been used to solve convex and non-convex economic load dispatch (ELD) problems. This paper presents a new global optimization algorithm to the economic load dispatch problems for minimization of fuel cost of generations with different constraints such as ramp rate limits, valve-point loading and prohibited operating zones of large-scale thermal plants. Power transmission loss has also been considered in few cases. Group leader optimization algorithm (GLOA) is a relatively new optimization technique. Mathematical models of this algorithm demonstrate the efficiency, quality of solution and convergence speed of the method and successful application of the algorithm on ELD problems. Simulation results found that the proposed approach outperforms several other existing optimization techniques in terms quality of solution obtained and computational efficiency. Results also be confirmed the robustness of the proposed methodology.

scholarly journals Solving the Real Power Limitations in the Dynamic Economic Dispatch of Large-Scale Thermal Power Units under the Effects of Valve-Point Loading and Ramp-Rate Limitations

2021 ◽  
Vol 13 (3) ◽  
pp. 1274
Author(s):  
Loau Al-Bahrani ◽  
Mehdi Seyedmahmoudian ◽  
Ben Horan ◽  
Alex Stojcevski
Keyword(s):  
Large Scale ◽  
Thermal Power ◽  
Optimization Technique ◽  
Economic Dispatch ◽  
Pso Algorithm ◽  
Search Space ◽  
Economic Benefits ◽  
Optimization Techniques ◽  
Ramp Rate ◽  
Dynamic Economic Dispatch

Few non-traditional optimization techniques are applied to the dynamic economic dispatch (DED) of large-scale thermal power units (TPUs), e.g., 1000 TPUs, that consider the effects of valve-point loading with ramp-rate limitations. This is a complicated multiple mode problem. In this investigation, a novel optimization technique, namely, a multi-gradient particle swarm optimization (MG-PSO) algorithm with two stages for exploring and exploiting the search space area, is employed as an optimization tool. The M particles (explorers) in the first stage are used to explore new neighborhoods, whereas the M particles (exploiters) in the second stage are used to exploit the best neighborhood. The M particles’ negative gradient variation in both stages causes the equilibrium between the global and local search space capabilities. This algorithm’s authentication is demonstrated on five medium-scale to very large-scale power systems. The MG-PSO algorithm effectively reduces the difficulty of handling the large-scale DED problem, and simulation results confirm this algorithm’s suitability for such a complicated multi-objective problem at varying fitness performance measures and consistency. This algorithm is also applied to estimate the required generation in 24 h to meet load demand changes. This investigation provides useful technical references for economic dispatch operators to update their power system programs in order to achieve economic benefits.

scholarly journals A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems

2010 ◽  
Vol 2010 ◽  
pp. 1-16 ◽  
Author(s):  
Paulraj S. ◽  
Sumathi P.
Keyword(s):  
Linear Programming ◽  
Large Scale ◽  
Optimization Problems ◽  
Inequality Constraints ◽  
Computational Effort ◽  
Linear Functions ◽  
Redundant Constraints ◽  
Computer Scientists ◽  
Constraints Solving ◽  
Linear Programming Problems

The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP) is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s). Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper.

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.

Linear Programming Approach for Power System State Estimation Using Upper Bound Optimization Techniques

2010 ◽  
Vol 11 (3) ◽  
Author(s):  
Thukaram Dhadbanjan ◽  
Seshadri Sravan Kumar Vanjari
Keyword(s):  
Linear Programming ◽  
State Estimation ◽  
Upper Bound ◽  
Measurement Errors ◽  
Large Scale ◽  
Optimization Technique ◽  
Optimization Techniques ◽  
Programming Approach ◽  
Linear Programming Approach ◽  
Bound Optimization

State estimation plays an important role in real time security monitoring and control of power systems. There are many problems in the implementation of state estimator for large scale networks due to measurement errors, weights given and the numerical ill-conditioning associated with the solution techniques. In this paper a new formulation using linear programming approach is presented. The formulation is devoid of weights and errors associated with the measurements are taken care of in constraints. The non linear problem is linearized at previous operating state and constraints are set up using flow mismatches. The implementation of the formulation exploits sparse features of the network matrices and avoids matrix inversions. Upper bound optimization technique is employed to solve the linear programming problem. Illustration of the proposed approach on sample 3-bus and 6-bus systems and a practical Indian Southern grid 72 bus equivalent system are presented.

scholarly journals Optimization-based approach to path planning for closed chain robot systems

2011 ◽  
Vol 21 (4) ◽  
pp. 659-670 ◽  
Author(s):  
Wojciech Szynkiewicz ◽  
Jacek Błaszczyk
Keyword(s):  
Path Planning ◽  
Large Scale ◽  
Inequality Constraints ◽  
Optimization Techniques ◽  
Planning Problem ◽  
Closed Chain ◽  
Robot Systems ◽  
Equality And Inequality Constraints ◽  
Primal Dual ◽  
The Given

Optimization-based approach to path planning for closed chain robot systems An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a "quasi-dynamic" NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint variables. The essence of the method is to find joint paths which satisfy the given constraints and minimize the proposed performance index. For numerical solution of the NLP problem, the IPOPT solver is used, which implements a nonlinear primal-dual interior-point method, one of the leading techniques for large-scale nonlinear optimization.

scholarly journals Optimization of Complex System Reliability using Hybrid Grey Wolf Optimizer

2021 ◽  
Vol 4 (2) ◽  
pp. 241-256
Author(s):  
Ganga Negi ◽  
◽  
Anuj Kumar ◽  
Sangeeta Pant ◽  
Mangey Ram ◽  
...  
Keyword(s):  
Optimization Problems ◽  
Optimization Technique ◽  
Cuckoo Search ◽  
Optimization Methods ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Reliability Allocation ◽  
Search Optimization ◽  
Cuckoo Search Optimization ◽  
Comparison Of The Results

Reliability allocation to increase the total reliability has become a successful way to increase the efficiency of the complex industrial system designs. A lot of research in the past have tackled this problem to a great extent. This is evident from the different techniques developed so far to achieve the target. Stochastic metaheuristics like simulated annealing, Tabu search (TS), Particle Swarm Optimization (PSO), Cuckoo Search Optimization (CS), Genetic Algorithm (GA), Grey wolf optimization technique (GWO) etc. have been used in recent years. This paper proposes a framework for implementing a hybrid PSO-GWO algorithm for solving some reliability allocation and optimization problems. A comparison of the results obtained is done with the results of other well-known methods like PSO, GWO, etc. The supremacy/competitiveness of the proposed framework is demonstrated from the numerical experiments. These results with regard to the time taken for the computation and quality of solution outperform the previously obtained results by the other well-known optimization methods.

scholarly journals Investigation of the iCC Framework Performance for Solving Constrained LSGO Problems

Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 108
Author(s):  
Alexey Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Optimization Techniques ◽  
Objective Functions ◽  
Parameter Adaptation ◽  
New Approach ◽  
Scientific Papers ◽  
Evolution Algorithms ◽  
Low Dimensional ◽  
Modern Optimization

Many modern real-valued optimization tasks use “black-box” (BB) models for evaluating objective functions and they are high-dimensional and constrained. Using common classifications, we can identify them as constrained large-scale global optimization (cLSGO) tasks. Today, the IEEE Congress of Evolutionary Computation provides a special session and several benchmarks for LSGO. At the same time, cLSGO problems are not well studied yet. The majority of modern optimization techniques demonstrate insufficient performance when confronted with cLSGO tasks. The effectiveness of evolution algorithms (EAs) in solving constrained low-dimensional optimization problems has been proven in many scientific papers and studies. Moreover, the cooperative coevolution (CC) framework has been successfully applied for EA used to solve LSGO problems. In this paper, a new approach for solving cLSGO has been proposed. This approach is based on CC and a method that increases the size of groups of variables at the decomposition stage (iCC) when solving cLSGO tasks. A new algorithm has been proposed, which combined the success-history based parameter adaptation for differential evolution (SHADE) optimizer, iCC, and the ε-constrained method (namely ε-iCC-SHADE). We investigated the performance of the ε-iCC-SHADE and compared it with the previously proposed ε-CC-SHADE algorithm on scalable problems from the IEEE CEC 2017 Competition on constrained real-parameter optimization.

Improved Embedded Micro-PSO for High-Dimensional Optimization Problems

2012 ◽  
Vol 236-237 ◽  
pp. 1184-1189
Author(s):  
Wen Hua Han ◽  
Chang Dong Zhu
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Small Population ◽  
High Dimensional ◽  
Adaptive Mutation ◽  
Large Scale Optimization ◽  
Continuous Variables ◽  
Scale Optimization ◽  
Dimensional Optimization

This paper presents a novel optimization technique called embedded micro-particle swarm optimization (EMPSO) to solve high-dimensional problems with continuous variables. The proposed EMPSO adopts a population memory which is divided into two portions as the source of diversity, and an external memory to collect particles performing well in an embedded PSO with a very small population size. However, the fact that the new method doesn’t excel in all of the benchmark functions highlights the necessity of developing improvement. Thus an adaptive mutation operator is introduced into EMPSO to remedy the issue. The experimental results show that the improved EMPSO has good performance for solving large-scale optimization problems.

New Efficient Evolutionary Algorithm Applied to Optimal Reactive Power Dispatch

2014 ◽  
pp. 321-339
Author(s):  
Provas Kumar Roy
Keyword(s):  
Large Scale ◽  
Reactive Power ◽  
Transmission Loss ◽  
Optimization Problems ◽  
Evolutionary Process ◽  
Opposition Based Learning ◽  
Optimal Reactive Power Dispatch ◽  
Power Dispatch ◽  
Equality And Inequality Constraints ◽  
Reactive Power Dispatch

Evolutionary Algorithms (EAs) are well-known optimization techniques to deal with nonlinear and complex optimization problems. However, most of these population-based algorithms are computationally expensive due to the slow nature of the evolutionary process. To overcome this drawback and to improve the convergence rate, this chapter employs Quasi-Opposition-Based Learning (QOBL) in conventional Biogeography-Based Optimization (BBO) technique. The proposed Quasi-Oppositional BBO (QOBBO) is comprehensively developed and successfully applied for solving the Optimal Reactive Power Dispatch (ORPD) problem by minimizing the transmission loss when both equality and inequality constraints are satisfied. The proposed QOBBO algorithm's performance is studied with comparisons of Canonical Genetic Algorithm (CGA), five versions of Particle Swarm Optimization (PSO), Local Search-Based Self-Adaptive Differential Evolution (L-SADE), Seeker Optimization Algorithm (SOA), and BBO on the IEEE 30-bus, IEEE 57-bus, and IEEE 118-bus power systems. The simulation results show that the proposed QOBBO approach performed better than the other listed algorithms and can be efficiently used to solve small-, medium-, and large-scale ORPD problems.

Sign in / Sign up

Export Citation Format

Share Document