Collection line optimisation in wind farms using improved ant colony optimisation

Author:

Wu Yi-wen1ORCID,Wang Yong1

Affiliation:

1. Renewable Energy School, North China Electric Power University, Beijing, China

Abstract

Collection line optimisation plays an important role in reducing the wind farm construction cost and improving the reliability of collector system. First, the optimisation model of collection lines in wind farms is given. Based on the four-vertex-three-line inequality and Prim algorithm, an improved ant colony optimisation algorithm is introduced to minimise the total length of collection lines to reduce their cost. In addition, the K-means clustering algorithm is adopted to partition the total wind turbines into several groups for the improved ant colony optimisation algorithm to search the shortest collection lines. The improved ant colony optimisation algorithm is tested with a wind farm example and compared with the classic ant colony optimisation algorithm. Under the same preconditions, the experimental results show that compared to the classic ant colony optimisation algorithm, the improved ant colony optimisation algorithm finds shorter collection lines in radial configuration for the wind farm. In addition, the improved ant colony optimisation algorithm requires less computation cycles to find better collection lines.

Funder

national natural science foundation of china

fundamental research funds for the central universities

Publisher

SAGE Publications

Subject

Energy Engineering and Power Technology,Renewable Energy, Sustainability and the Environment

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3