Content area

Abstract

The economic dispatch (ED) problem focuses on the optimal scheduling of thermal generating units in a power system to minimize fuel costs while satisfying operational constraints. This article proposes a modified version of the social group optimization (SGO) algorithm to address the ED problem with various practical characteristics (such as valve-point effects, transmission losses, prohibited operating zones, and multi-fuel sources). SGO is a population-based metaheuristic algorithm with strong exploration capabilities, but for certain types of problems, it may stagnate in a local optimum due to a potential imbalance between exploration and exploitation. The new version, named SGO-L, retains the structure of the SGO but incorporates a Laplace operator derived from the Laplace distribution into all the iterative solution update equations. This adjustment generates more effective search steps in the solution space, improving the exploration–exploitation balance and overall performance in terms of solution stability and quality. SGO-L is validated on four power systems of small (six-unit), medium (10-unit), and large (40-unit and 110-unit) sizes with diverse characteristics. The efficiency of SGO-L is compared with SGO and other metaheuristic algorithms. The experimental results demonstrate that the proposed SGO-L algorithm is more robust than well-known algorithms (such as particle swarm optimization, genetic algorithms, differential evolution, and cuckoo search algorithms) and other competitor algorithms mentioned in the study. Moreover, the non-parametric Wilcoxon statistical test indicates that the new SGO-L version is more promising than the original SGO in terms of solution stability and quality. For example, the standard deviation obtained by SGO-L shows significantly lower values (6.02 × 10−9 USD/h for the six-unit system, 7.56 × 10−5 USD/h for the 10-unit system, 75.89 USD/h for the 40-unit system, and 4.80 × 10−3 USD/h for the 110-unit system) compared to SGO (0.44 USD/h for the six-unit system, 50.80 USD/h for the 10-unit system, 274.91 USD/h for the 40-unit system, and 1.04 USD/h for the 110-unit system).

Details

1009240
Business indexing term
Title
A Social Group Optimization Algorithm Using the Laplace Operator for the Economic Dispatch Problem
Author
Dinu, Calin Secui 1 ; Hora, Cristina 1   VIAFID ORCID Logo  ; Florin Ciprian Dan 1   VIAFID ORCID Logo  ; Secui, Monica Liana 2 ; Horea Nicolae Hora 3 ; Gligor, Emil 4 

 Department of Energy Engineering, Faculty of Energy Engineering and Industrial Management, University of Oradea, 410058 Oradea, Romania; [email protected] (D.C.S.); [email protected] (F.C.D.) 
 Department of Psychology, Faculty of Social-Humanistic Sciences, University of Oradea, 410058 Oradea, Romania; [email protected] 
 Department of Mechanical Engineering and Vehicles, Faculty of Management and Technological Engineering, University of Oradea, 410058 Oradea, Romania; [email protected] 
 Department of Civil Engineering, Faculty of Construction, Cadastre and Architecture, University of Oradea, 410058 Oradea, Romania; [email protected] 
Publication title
Processes; Basel
Volume
13
Issue
2
First page
405
Publication year
2025
Publication date
2025
Publisher
MDPI AG
Place of publication
Basel
Country of publication
Switzerland
Publication subject
e-ISSN
22279717
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
Publication history
 
 
Online publication date
2025-02-04
Milestone dates
2024-12-10 (Received); 2025-01-16 (Accepted)
Publication history
 
 
   First posting date
04 Feb 2025
ProQuest document ID
3171219442
Document URL
https://www.proquest.com/scholarly-journals/social-group-optimization-algorithm-using-laplace/docview/3171219442/se-2?accountid=208611
Copyright
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-07-23
Database
ProQuest One Academic