.png){kind=icon}
.png){kind=icon}
Return
A hybrid capuchin search algorithm with gradient search algorithm for economic dispatch problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-023-09019-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an effective approach for solving economic load dispatch problems contemplating the scheduling a set of thermal generating units to produce a specific power at low consumption costs. These problems can be thought of as nonlinear, non-convex, and highly constrained optimization problems with a large number of local minima. To cope with the above issues in solving such problems, a new meta-heuristic named capuchin search algorithm was adopted. To boost the search performance of this algorithm as well as to mitigate its early convergence and regression to the local optimum, it was hybridized with another algorithm and improved using several positive amendments. First, a memory element was added to this algorithm to ameliorate its position and velocity update mechanisms in order to exploit the most encouraging candidate solutions. Second, two adaptive parametric functions were used to manage the exploration and exploitation features of this algorithm and balance them appropriately. Finally, the hybridization was made using the gradient-based optimizer to strengthen the intensification ability of this algorithm and balance its searching ability to fulfill sensible search performance. The proficiency of the proposed algorithm was divulged by assessing it on computationally difficult economic load dispatch problems under 6 different tests with a generator of 3, 13, 40, 80, and 140 units, each with different constraints and load conditions. The proposed algorithm provided the best performance among many other competitors. Its superiority and practicality were revealed by obtaining optimal solutions for large-scale test cases such as 40-unit and 140-unit test systems.
Keywords:
Economic load dispatch
Capuchin search algorithm
Gradient-based optimizer
Memory concept
Optimization
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
View more organizations