Optimization Generation Expansion Planning by HBMO

  • hejrati Z
  • Hejrati E
  • Taheri.moghadam A
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

hejrati, Z., Hejrati, E., & Taheri.moghadam, A. (2012). Optimization Generation Expansion Planning by HBMO. International Journal of Computer Applications, 37(7), 25–31. https://doi.org/10.5120/4620-6629

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free