International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 37 - Number 7 |
Year of Publication: 2012 |
Authors: Zakariya hejrati, Ebrahim hejrati, Atefeh taheri.moghadam |
![]() |
Zakariya hejrati, Ebrahim hejrati, Atefeh taheri.moghadam . Optimization Generation Expansion Planning by HBMO. International Journal of Computer Applications. 37, 7 ( January 2012), 25-31. DOI=10.5120/4620-6629
The generation expansion planning (GEP) problem is a large-scale mixed integer nonlinear programming (MINLP) problem cited as one of the most complex optimization problems. In this paper, an application of honey bee mating optimization for solving the generation expansion planning problem is presented. In the formulation, the objective is to minimize investment cost. The GEP problem considered is a test system for a six-year planning horizon having five types of candidate units. The results are compared and validated.