Ant colony search algorithm for the optimal power flow problem
To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized nat...
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.22/1421 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/1421 |
| Summary: | To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature. |
|---|