基于贪心优化算法的光伏小屋设计  

PHOTOVOLTAIC HUT DESIGN BASED ON THE GREEDY ALGORISM

作　　者：王真富[1] 王梦仑[2] 陈森[2] 冯向南[2] 

机构地区：[1]衢州职业技术学院信息工程学院,浙江324000 [2]北京航空航天大学数学与系统科学学院,北京100191

出　　处：《太阳能学报》2013年第10期1775-1780,共6页Acta Energiae Solaris Sinica

基　　金：中央财政支持光伏应用技术专业建设项目(教职成厅函(2011)71)

摘　　要：针对太阳能光伏小屋发电系统设计中为达到小屋全年光伏发电总量尽可能大,而单位发电量的费用尽可能小的目标,提出光伏组件的优化铺设问题。通过对铺设对象光伏组件进行聚类操作,筛选出属性相近的高效光伏组件,减少优化计算量。在太阳光伏组件铺设过程中,采取最左下角原则、最低水平线原则和效益最大化原则的改良贪心算法搜索,取得光伏组件铺设的最优解。In order to make the photovoltaic hut generate electricity as large as possible and spend cost per unit as little as possible, the optimization of the PV module installation is needed. With the cluster of the PV module, similar PV module are selected out so that calculated amount has been cut down. In the process of the pavement design, the improved greedy algorism consists of the lower left corner principle, the lowest level principle and the maximum profit principle. Finally, an optimum scheme of PV array pavement is found with the method.

关 键 词：二维矩阵排样 贪心算法 网格优化 聚类 

分 类 号：O224[理学—运筹学与控制论]