摘要

In allusion to distribution network reconfiguration, taking minimized network loss as objective function, a binary crisscross optimization algorithm (BCSO) was proposed. The proposed algorithm is based on novel crisscross optimization algorithm (CSO) with advantage in solution accuracy and convergence speed by adopting dual search mechanism including horizontal and vertical crossovers. The former has powerful global search ability while the latter keeps swarm diversity and avoids local optima problem. However, CSO is more appropriate for solving continuous problems. To handle binary optimization problem, a discrete method applied to CSO was put forward. Finally, the proposed algorithm was simulated on standard IEEE and PG&E systems with 33 and 69 nodes respectively. Simulation results demonstrated feasibility of BCSO to solve distribution network reconfiguration problem. Compared with other methods, the proposed algorithm has significant advantage in terms of global search ability, convergence speed and robustness.

  • 出版日期2016

全文