An efficient multi-objective HBMO algorithm for distribution feeder reconfiguration

Taher Niknam

doi:10.1016/j.eswa.2010.08.081

Return

An efficient multi-objective HBMO algorithm for distribution feeder reconfiguration

2011-03-01

PRE

Taher Niknam *

DOI：10.1016/j.eswa.2010.08.081

Original

Original request for help

Save

Abstract

En 中文

This paper presents an efficient multi-objective honey bee mating optimization (MHBMO) evolutionary algorithm to solve the multi-objective distribution feeder reconfiguration (DFR). The purposes of the DFR problem are to decrease the real power loss, the number of the switching operations and the deviation of the voltage at each node. Conventional algorithms for solving the multi-objective optimization problems convert the multiple objectives into a single objective using a vector of the user-predefined weights. This transformation has several drawbacks. For instance, the final solution of the algorithms extensively depends on the values of the weights. This paper presents a new MHBMO algorithm for the DFR problem. The proposed algorithm utilizes several queens and considers the queens as an external repository to save non-dominated solutions found during the search process. Since the objective functions are not the same, a fuzzy clustering technique is used to control the size of the repository within the limits. The proposed algorithm is tested on two distribution test feeders. (C) 2010 Elsevier Ltd. All rights reserved.

Keywords:

Honey bee mating optimization (HBMO)

Distribution feeder reconfiguration

Multi-objective optimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.