استفاده از بهینه سازی جست وجو گروه باینری برای تنظیم مجدد شبکه توزیع

This paper presents the binary group search optimization algorithm (BGSO) for solving the optimal distribution network reconfiguration problem. The objective of the optimization is loss reduction in distribution system. The proposed GSO algorithm is introduced with fundamental modifications, such as introducing binary form of the GSO in order to be fit for reconfiguration and all binary form problems. All formulation of conventional GSO has been modified for accessing a novel powerful binary searching algorithm. Additionally, the forward–backward sweep, load flow is used in this paper, due to its accuracy. The Comparative studies are conducted on standard networks to verify the validity of the proposed algorithm. The simulations on different test cases confirm validity of the BGSO in solving optimal distribution network reconfiguration problem.