Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 7410293, 7 pages
Research Article

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

1School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
2Department of Computer Science and Electrical Engineering, Georgia Institute of Technology, Atlanta, GA 30314, USA

Received 15 January 2016; Accepted 19 July 2016

Academic Editor: Mauro Pontani

Copyright © 2016 Sidun Fang and Xiaochen Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.