A Quasioppositional-Chaotic Symbiotic Organisms Search Algorithm for Distribution Network Reconfiguration with Distributed Generations

This study suggests an enhanced metaheuristic method based on the Symbiotic Organisms Search (SOS) algorithm, namely, Quasioppositional Chaotic Symbiotic Organisms Search (QOCSOS). It aims to optimize the network configuration simultaneously and allocate distributed generation (DG) subject to the mi...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2021-12, Vol.2021, p.1-13
Main Authors: Nguyen Hoang, Minh-Tuan, Truong, Bao-Huy, Hoang, Khoa Truong, Dang Tuan, Khanh, Vo Ngoc, Dieu
Format: Article
Language:English
Subjects:
Algorithms
Distributed generation
Electric power distribution
Heuristic
Heuristic methods
Methods
Optimization
Organisms
Power
Radial distribution
Reconfiguration
Search algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study suggests an enhanced metaheuristic method based on the Symbiotic Organisms Search (SOS) algorithm, namely, Quasioppositional Chaotic Symbiotic Organisms Search (QOCSOS). It aims to optimize the network configuration simultaneously and allocate distributed generation (DG) subject to the minimum real power loss in radial distribution networks (RDNs). The suggested method is developed by integrating the Quasiopposition-Based Learning (QOBL) as well as Chaotic Local Search (CLS) approaches into the original SOS algorithm to obtain better global search capacity. The proposed QOCSOS algorithm is tested on 33-, 69-, and 119-bus RDNs to verify its effectiveness. The findings demonstrate that the suggested QOCSOS technique outperformed the original SOS and provided higher-quality alternatives than many other methods studied. Accordingly, the proposed QOCSOS algorithm is favourable in adapting to the DG placement problems and optimal distribution network reconfiguration.
ISSN:1024-123X
1563-5147
DOI:10.1155/2021/2065043