A Hybrid Algorithm of Particle Swarm Optimization and Tabu Search for Distribution Network Reconfiguration

Sidun Fang and Xiaochen Zhang

Mathematical Problems in Engineering, 2016, vol. 2016, 1-7

Abstract:

This paper deals with the distribution network reconfiguration problem. A hybrid algorithm of particle swarm optimization (PSO) and tabu search (TS) is proposed as the searching algorithm. The new algorithm shares the advantages of PSO and TS, which has a fast computation speed and a strong ability to avoid local optimal solution. After a thorough comparison, network random key (NRK) is introduced as the corresponding coding strategy among various tree representation strategies. NRK could completely avoid the generation of infeasible solutions during the searching process and has a good locality property, which allows the new hybrid algorithm to perform to its fullest potential. The proposed algorithm has been validated through an IEEE 33 bus test case. Compared with other algorithms, the proposed method is both accurate and computationally efficient. Furthermore, a test to solve another problem also proves the robustness of the proposed algorithm for a different problem.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/7410293.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/7410293.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7410293

DOI: 10.1155/2016/7410293

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().