BRADFORD SCHOLARS

    • Sign in
    View Item 
    •   Bradford Scholars
    • Engineering and Informatics
    • Engineering and Informatics Publications
    • View Item
    •   Bradford Scholars
    • Engineering and Informatics
    • Engineering and Informatics Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Bradford ScholarsCommunitiesAuthorsTitlesSubjectsPublication DateThis CollectionAuthorsTitlesSubjectsPublication Date

    My Account

    Sign in

    HELP

    Bradford Scholars FAQsCopyright Fact SheetPolicies Fact SheetDeposit Terms and ConditionsDigital Preservation Policy

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    GA/SA-based hybrid techniques for the scheduling of generator maintenance in power systems

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    View/Open
    dahal8.pdf (6.269Mb)
    Download
    Publication date
    2000
    Author
    Dahal, Keshav P.
    Burt, G.M.
    McDonald, J.R.
    Galloway, S.J.
    Keyword
    Genetic Algorithms
    Simulated Annealing
    Generator Maintenance
    Scheduling
    Rights
    © 2000 IEEE. Reprinted from Proceedings of the Congress on Evolutionary Computation - CEC. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bradford's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
    Peer-Reviewed
    Yes
    
    Metadata
    Show full item record
    Abstract
    Proposes the application of a genetic algorithm (GA) and simulated annealing (SA) based hybrid approach for the scheduling of generator maintenance in power systems using an integer representation. The adapted approach uses the probabilistic acceptance criterion of simulated annealing within the genetic algorithm framework. A case study is formulated in this paper as an integer programming problem using a reliability-based objective function and typical problem constraints. The implementation and performance of the solution technique are discussed. The results in this paper demonstrate that the technique is more effective than approaches based solely on genetic algorithms or solely on simulated annealing. It therefore proves to be a valid approach for the solution of generator maintenance scheduling problems
    URI
    http://hdl.handle.net/10454/952
    Citation
    Dahal, K.P., Burt, G.M., McDonald, J.R. and Galloway, S.J. (2000). GA/SA-based hybrid techniques for the scheduling of generator maintenance in power systems. Congress on Evolutionary Computation (CEC). La Jolla, CA, USA. 16-19 July 2000. Proceedings of the Congress on Evolutionary Computation. Vol. 1., pp. 567-574.
    Link to publisher’s version
    http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=870347&isnumber=18852
    Type
    Conference paper
    Collections
    Engineering and Informatics Publications

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.