Multi-objective random search algorithm for simultaneously optimizing wind farm layout and number of turbines

Ju Feng, Wen Zhong Shen, Chang Xu

    Research output: Contribution to journalConference articleResearchpeer-review

    465 Downloads (Pure)


    A new algorithm for multi-objective wind farm layout optimization is presented. It formulates the wind turbine locations as continuous variables and is capable of optimizing the number of turbines and their locations in the wind farm simultaneously. Two objectives are considered. One is to maximize the total power production, which is calculated by considering the wake effects using the Jensen wake model combined with the local wind distribution. The other is to minimize the total electrical cable length. This length is assumed to be the total length of the minimal spanning tree that connects all turbines and is calculated by using Prim's algorithm. Constraints on wind farm boundary and wind turbine proximity are also considered. An ideal test case shows the proposed algorithm largely outperforms a famous multi-objective genetic algorithm (NSGA-II). In the real test case based on the Horn Rev 1 wind farm, the algorithm also obtains useful Pareto frontiers and provides a wide range of Pareto optimal layouts with different numbers of turbines for a real-life wind farm developer.
    Original languageEnglish
    Article number032011
    Book seriesJournal of Physics: Conference Series (Online)
    Issue number3
    Number of pages11
    Publication statusPublished - 2016
    EventThe Science of Making Torque from Wind 2016 - Technische Universität München (TUM), Munich, Germany
    Duration: 5 Oct 20167 Oct 2016
    Conference number: 6


    ConferenceThe Science of Making Torque from Wind 2016
    LocationTechnische Universität München (TUM)
    Internet address


    Dive into the research topics of 'Multi-objective random search algorithm for simultaneously optimizing wind farm layout and number of turbines'. Together they form a unique fingerprint.

    Cite this