Social small group optimization algorithm for large-scale economic dispatch problem with valve-point effects and multi-fuel sources

Abstract

AbstractEconomic dispatch is an important issue in the management of power systems and is the current focus of specialists. In this paper, a new metaheuristic optimization algorithm is proposed, named Social Small Group Optimization (SSGO), inspired by the psychosocial processes that occur between members of small groups to solve real-life problems. The starting point of the SSGO algorithm is a philosophical conception similar to that of the social group optimization (SGO) algorithm. The novelty lies in the introduction of the small group concept and the modeling of individuals’ evolution based on the social influence between two or more members of the small group. This conceptual framework has been mathematically mapped through a set of heuristics that are used to update the solutions, and the best solutions are retained by employing a greedy selection strategy. SSGO has been applied to solve the economic dispatch problem by considering some practical aspects, such as valve-point loading effects, sources with multiple fuel options, prohibited operating zones, and transmission line losses. The efficiency of the SSGO algorithm was tested on several mathematical functions (unimodal, multimodal, expanded, and composition functions) and on power systems of varying sizes (ranging from 10-units to 1280-units). The SSGO algorithm was compared with SGO and other algorithms belonging to various categories (such as: evolution-based, swarm-based, human behavior-based, hybrid algorithms, etc.), and the results indicated that SSGO outperforms other algorithms applied to solve the economic dispatch problem in terms of quality and stability of the solutions, as well as computation time.