Reliability constrained dynamic generation expansion planning using honey badger algorithm.

Generation expansion planning (GEP) is a complex, highly constrained, non-linear, discrete and dynamic optimization task aimed at determining the optimum generation technology mix of the best expansion alternative for long-term planning horizon. This paper presents a new framework to study the GEP in a multi-stage horizon with reliability constrained. GEP problem is presented to minimize the capital investment costs, salvage value cost, operation and maintenance, and outage cost under several constraints over planning horizon. Added to that, the spinning reserve, fuel mix ratio and reliability in terms of Loss of Load Probability are maintained. Moreover, to decrease the GEP problem search space and reduce the computational time, some modifications are proposed such as the Virtual mapping procedure, penalty factor approach, and the modified of intelligent initial population generation. For solving the proposed reliability constrained GEP problem, a novel honey badger algorithm (HBA) is developed. It is a meta-heuristic search algorithm inspired from the intelligent foraging behavior of honey badger to reach its prey. In HBA, the dynamic search behavior of honey badger with digging and honey finding approaches is formulated into exploration and exploitation phases. Added to that, several modern meta-heuristic optimization algorithms are employed which are crow search algorithm, aquila optimizer, bald eagle search and particle swarm optimization. These algorithms are applied, in a comparative manner, for three test case studies for 6-year, 12-year, and 24-year of short- and long-term planning horizon having five types of candidate units. The obtained results by all these proposed algorithms are compared and validated the effectiveness and superiority of the HBA over the other applied algorithms.