.png){kind=icon}
.png){kind=icon}
Return
Ant colony system-based algorithm for constrained load flow problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2005.851969.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents the ant colony system (ACS) method for network-constrained optimization problems. The developed ACS algorithm formulates the constrained load flow (CLF) problem as a combinatorial optimization problem. It is a distributed algorithm composed of a set of cooperating artificial agents, called ants, that cooperate among them to find an optimum solution of the CLF problem. A pheromone matrix that plays the role of global memory provides the cooperation between ants. The study consists of mapping the solution space, expressed by an objective function of the CLF on the space of control variables [ant system (AS)-graph], that ants walk. The ACS algorithm is applied to the IEEE 14-bus system and the IEEE 136-bus system. The results are compared with those given by the probabilistic CLF and the reinforcement learning (RL) methods, demonstrating the superiority and flexibility of the ACS algorithm. Moreover, the ACS algorithm is applied to the reactive power control problem for the IEEE 14-bus system in order to minimize real power losses subject to operating constraints over the whole planning period.
Keywords:
ant colony system (ACS)
combinatorial optimization
constrained load flow (CLF)
reinforcement learning (RL)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available