Home > Research > Publications & Outputs > Late Acceptance Selection Hyper-heuristic for W...

Electronic data

  • ICCCEEE18B

    Rights statement: ©2018 IEEE. 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 to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 234 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Late Acceptance Selection Hyper-heuristic for Wind Farm Layout Optimisation Problem

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Published
  • H. Abdulaziz
  • A. Elnahas
  • A. Daffalla
  • Y. Noureldien
  • A. Kheiri
  • E. Özcan
Close
Publication date1/11/2018
Host publication2018 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE)
PublisherIEEE
Pages1-5
Number of pages5
ISBN (Electronic)9781538641231
Original languageEnglish

Abstract

Wind is a promising source of renewable energy which can be harvested using wind turbines placed on farms. An efficient wind farm layout achieving various engineering and financial objectives is crucial to ensure the sustainability and continuity of energy production. In this study, a high-level search technique, namely late acceptance selection hyper-heuristic is applied to optimise the layout of wind farms. This approach aims to find the best placement of turbines at a given site, maximising the energy output while minimising the cost at the same time. The computational experiments indicate that the late acceptance selection hyper-heuristic improves upon the performance of a previously proposed genetic algorithm across all scenarios and an iterated local search over the majority of scenarios considering the best solutions obtained by each algorithm over the runs.

Bibliographic note

©2018 IEEE. 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 to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.