Generation scheduling using genetic algorithm based hybrid techniques

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

11 Citations (Scopus)

Abstract

The solution of generation scheduling (GS) problems involves the determination of the unit commitment (UC) and economic dispatch (ED) for each generator in a power system at each time interval in the scheduling period. The solution procedure requires the simultaneous consideration of these two decisions. In recent years researchers have focused much attention on new solution techniques to GS. This paper proposes the application of a variety of genetic algorithm (GA) based approaches and investigates how these techniques may be improved in order to more quickly obtain the optimum or near optimum solution for the GS problem. The results obtained show that the GA-based hybrid approach offers an effective alternative for solving realistic GS problems within a realistic timeframe.
Original languageEnglish
Title of host publicationLESCOPE 01
Subtitle of host publication2001 Large engineering systems conference on power engineering, conference proceedings
Place of PublicationNew York
PublisherIEEE
Pages74-78
Number of pages4
ISBN (Print)0780371070
DOIs
Publication statusPublished - 2001
EventLarge Engineering Systems Conference on Power Engineering - Halifax, Canada
Duration: 11 Jul 200113 Jul 2001

Conference

ConferenceLarge Engineering Systems Conference on Power Engineering
CountryCanada
CityHalifax
Period11/07/0113/07/01

    Fingerprint

Keywords

  • generation scheduling
  • genetic algorithm
  • hybrid techniques

Cite this

Dahal, K., Galloway, S. J., Burt, G. M., & McDonald, J. R. (2001). Generation scheduling using genetic algorithm based hybrid techniques. In LESCOPE 01: 2001 Large engineering systems conference on power engineering, conference proceedings (pp. 74-78 ). New York: IEEE. https://doi.org/10.1109/LESCPE.2001.941630