Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm

摘要: Abstract This paper introduces a modified shuffled frog leaping algorithm (MSFLA) to solve reliability constrained generation expansion planning (GEP) problem. GEP, as crucial issue in power systems, is highly non-linear discrete dynamic optimization To this complicated problem by MSFLA, new rule, associated with strategy for distribution into memeplexes, proposed improve the local exploration and performance of SFLA. Furthermore, integer encoding, mapping procedure penalty factor approach are implemented efficiency methodology. show effectiveness method, it applied test system two horizon 12 24 years. For sake methodology validation, an ordinary SFLA well Genetic Algorithm (GA) both same Simulation results advantages MSFLA over GA.