• DocumentCode
    1721472
  • Title

    Efficient hybrid optimization solution for the economic dispatch with nonsmooth cost function

  • Author

    Ciornei, Irina ; Kyriakides, Elias

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Cyprus, Nicosia, Cyprus
  • fYear
    2009
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    This paper proposes a novel global optimization technique to solve the nonconvex economic load dispatch (NCELD) problem. The foraging strategy of the pachycondyla apicalis ant (API) is hybridized with a genetic algorithm (GA) strategy to incorporate key features of both API and GA and form a relatively simple but robust algorithm, entitled GAAPI. The novel algorithm proposed in this paper combines the downhill behavior of API (a key characteristic of optimization algorithms) and a good spreading in the solution space of the GA search strategy (a guarantee to avoid being trapped in local optima). The feasibility of the proposed method is tested for three different test systems having different size and complexity. The results are calculated in terms of solution quality and computational efficiency; it is shown that the proposed GAAPI is capable of obtaining highly robust, quality solutions in a reasonable computational time.
  • Keywords
    genetic algorithms; power generation dispatch; power generation economics; GA; ant foraging strategy; genetic algorithm; hybrid optimization solution; nonconvex economic load dispatch problem; nonsmooth cost function; pachycondyla apicalis ant; Ant colony optimization; Computational efficiency; Cost function; Genetic algorithms; Power generation economics; Power industry; Power system economics; Processor scheduling; Robustness; System testing; API; Economic dispatch; ant colony; genetic algorithm; nonconvex optimization; robust search;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    PowerTech, 2009 IEEE Bucharest
  • Conference_Location
    Bucharest
  • Print_ISBN
    978-1-4244-2234-0
  • Electronic_ISBN
    978-1-4244-2235-7
  • Type

    conf

  • DOI
    10.1109/PTC.2009.5282062
  • Filename
    5282062