A modified shuffled frog leaping algorithm for long-term generation maintenance scheduling

15Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discuss a modified Shuffled frog leaping algorithm to Longterm Generation Maintenance Scheduling to Enhance the Reliability of the units. Maintenance scheduling establishes the outage time scheduling of units in a particular time horizon. In a monopolistic power system, maintenance scheduling is being done upon the technical requirements of power plants and preserving the grid reliability. While in power system, technical viewpoints and system reliability are taken into consideration in maintenance scheduling with respect to the economical viewpoint. In this paper present a modified Shuffled frog leaping algorithm methodology for finding the optimum preventive maintenance scheduling of generating units in power system. The objective function is to maintain the units as earlier as possible. Varies constrains such as spinning reserve, duration of maintenance and maintenance crew are being taken into account. In case study, test system consist of 24 buses with 32 thermal generating units is used.

Cite

CITATION STYLE

APA

Samuel, G. G., & Rajan, C. C. A. (2014). A modified shuffled frog leaping algorithm for long-term generation maintenance scheduling. In Advances in Intelligent Systems and Computing (Vol. 258, pp. 11–24). Springer Verlag. https://doi.org/10.1007/978-81-322-1771-8_2

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