Crisscross Optimization Algorithm and Monte Carlo Simulation for Solving Optimal Distributed Generation Allocation Problem

• Published in: Energies (Basel) Vol. 8; no. 12; pp. 13641 - 13659
• Main Authors: Peng, Xiangang, Lin, Lixiang, Zheng, Weiqin, Liu, Yi
• Format: Journal Article
• Language: English
• Published: MDPI AG 01.12.2015
• Subjects: crisscross optimization algorithm; distributed generation; Monte Carlo simulation; optimal allocation; uncertainties
• ISSN: 1996-1073; 1996-1073
• DOI: 10.3390/en81212389

Distributed generation (DG) systems are integral parts in future distribution networks. In this paper, a novel approach integrating crisscross optimization algorithm and Monte Carlo simulation (CSO-MCS) is implemented to solve the optimal DG allocation (ODGA) problem. The feature of applying CSO to address the ODGA problem lies in three interacting operators, namely horizontal crossover, vertical crossover and competitive operator. The horizontal crossover can search new solutions in a hypercube space with a larger probability while in the periphery of each hypercube with a decreasing probability. The vertical crossover can effectively facilitate those stagnant dimensions of a population to escape from premature convergence. The competitive operator allows the crisscross search to always maintain in a historical best position to quicken the converge rate. It is the combination of the double search strategies and competitive mechanism that enables CSO significant advantage in convergence speed and accuracy. Moreover, to deal with system uncertainties such as the output power of wind turbine and photovoltaic generators, an MCS-based method is adopted to solve the probabilistic power flow. The effectiveness of the CSO-MCS method is validated on the typical 33-bus and 69-bus test system, and results substantiate the suitability of CSO-MCS for multi-objective ODGA problem.