A Social Spider Algorithm for Solving the Non-convex Economic Load Dispatch Problem

07/27/2015
by   James J. Q. Yu, et al.
0

Economic Load Dispatch (ELD) is one of the essential components in power system control and operation. Although conventional ELD formulation can be solved using mathematical programming techniques, modern power system introduces new models of the power units which are non-convex, non-differentiable, and sometimes non-continuous. In order to solve such non-convex ELD problems, in this paper we propose a new approach based on the Social Spider Algorithm (SSA). The classical SSA is modified and enhanced to adapt to the unique characteristics of ELD problems, e.g., valve-point effects, multi-fuel operations, prohibited operating zones, and line losses. To demonstrate the superiority of our proposed approach, five widely-adopted test systems are employed and the simulation results are compared with the state-of-the-art algorithms. In addition, the parameter sensitivity is illustrated by a series of simulations. The simulation results show that SSA can solve ELD problems effectively and efficiently.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2018

State-of-the-Art Economic Load Dispatch of Power Systems Using Particle Swarm Optimization

Metaheuristic particle swarm optimization (PSO) algorithm has emerged as...
research
08/04/2017

Adaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem

Optimization problems in design engineering are complex by nature, often...
research
05/25/2018

Distributed Optimization Strategy for Multi Area Economic Dispatch Based on Electro Search Optimization Algorithm

A new adopted evolutionary algorithm is presented in this paper to solve...
research
10/11/2022

Stochastic Constrained DRO with a Complexity Independent of Sample Size

Distributionally Robust Optimization (DRO), as a popular method to train...
research
10/19/2016

Hit-and-Run for Sampling and Planning in Non-Convex Spaces

We propose the Hit-and-Run algorithm for planning and sampling problems ...
research
05/05/2020

Approximation Algorithms for Distributed Multi-Robot Coverage in Non-Convex Environments

In this paper, we revisit the distributed coverage control problem with ...
research
04/16/2022

Beyond L1: Faster and Better Sparse Models with skglm

We propose a new fast algorithm to estimate any sparse generalized linea...

Please sign up or login with your details

Forgot password? Click here to reset