A genetic algorithm solution to the unit commitment problem

  • Kazarlis S
  • Bakirtzis A
  • Petridis V
  • 96

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

This paper presents a genetic algorithm (GA) solution to the unit commitment problem. GAs are general purpose optimization techniques based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. A simple GA algorithm implementation using the standard crossover and mutation operators could locate near optimal solutions but in most cases failed to converge to the optimal solution. However, using the varying quality function technique and adding problem specific operators, satisfactory solutions to the unit commitment problem were obtained. Test results for power systems of up to 100 units and comparisons with results obtained using Lagrangian relaxation and dynamic programming are also reported

Author-supplied keywords

  • costs
  • genetic algorithms
  • may save the electric
  • optimal commitment schedules continues
  • per year in production
  • search for closer to
  • since improved uc schedules
  • the
  • unit commitment
  • utilities millions of dollars

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • S.a. Kazarlis

  • a.G. Bakirtzis

  • V. Petridis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free