Abstract
The aim of generator maintenance scheduling (GMS) in an electric power system is to allocate a proper maintenance timetable for generators while maintaining a high system reliability, reducing total production cost, extending generator life time etc. In order to solve this complex problem a genetic algorithm technique is proposed here. The paper discusses the implementation of GAs to GMS problems with two approaches: generational and steady state. The results of applying these GAs to a test GMS problem based on a practical power system scenario are presented and analysed. The effect of different GA parameters is also studied.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.F. Dopazo and H.M. Merrill. Optimal generator maintenance scheduling using integer programming. IEEE Transactions on Power Apparatus and Systems, PAS-94(5):1537–1545, September/October 1975.
J.J. Grefenstette. A user’s guide to GENESIS version 5.0. available at ftp site: ftp.aic.nrl.navy.mil/pub/galist/src/ga/genesis.tar.z, 1990.
X. Wang and J.R. McDonald. Modern Power System Planning. McGraw-Hill, London, 1994.
D.L. Whitley. GENITOR. Colorado State University, 1990. available at ftp site: ftp.cs.colostate.edu/pub/GENITOR.tar.
Z. Yamayee and S. Kathleen. A computationally efficient optimal maintenance scheduling method. IEEE Transactions on Power Apparatus and Systems, PAS-102(2):330–338, February 1983.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Dahal, K.P., McDonald, J.R. (1998). Generational and Steady-State Genetic Algorithms for Generator Maintenance Scheduling Problems. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_57
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_57
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive