A backtracking search algorithm for distribution network reconfiguration problem

10Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a distribution network reconfiguration (DNR) methodology based on a backtracking search algorithm (BSA) for minimizing active power loss and minimizing voltage deviation. The BSA is a new evolutionary algorithm for solving of numerical optimization problems. It uses a single control parameter and two crossovers and mutation strategies for powerful exploration of the problem’s search space. The effectiveness of the proposed BSA has been tested on 69-node distribution network system and the obtained test results have been compared to those from other methods in the literature. In addition to BSA, two other algorithms—particle swarm optimization (PSO) and cuckoo search algorithm (CSA)—are implemented for comparisons. The simulation results show that the proposed BSA can be an efficient and promising method for distribution network reconfiguration problems.

Cite

CITATION STYLE

APA

Nguyen, T. T., Pham, H. N., Truong, A. V., Phung, T. A., & Nguyen, T. T. (2016). A backtracking search algorithm for distribution network reconfiguration problem. In Lecture Notes in Electrical Engineering (Vol. 371, pp. 223–234). Springer Verlag. https://doi.org/10.1007/978-3-319-27247-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free