基于GIHCMAC神经网络的建筑电负荷预测方法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(61773246,61374187)


Building Electric Load Prediction Based on Improved GIHCMAC Neural Network
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    随着能源供应与经济快速发展的矛盾日益加剧,建筑节能成为可持续发展战略的一个关键环节,研究一种快速、精准的建筑用电量预测方法是实现建筑节能优化控制的重要前提.本文将遗传算法与蚁群聚类算法相融合,对基于聚类的IHCMAC (Improvement Hyperball CMAC)神经网络的网络节点进行改进,将GIHCMAC (Genetic Algorithm Ant Colony Clustering Algorithm based on IHCMAC)作为建筑电力负荷预测模型,对潍坊某一办公建筑用电负荷进行预测.研究结果表明,该预测模型迭代次数最小、准确度较高,其迭代次数、训练误差、泛化误差分别为9、0.0045、0.0014,较IHCMAC、KHCMAC (K-means Hyperball CMAC)、IKHCMAC (Improvement K-means Hyperball CMAC)模型的收敛速度更快,精度更高,泛化能力更强.

    Abstract:

    With the increasing contradiction between energy supply and rapid economic development, building energy conservation has become a key link in sustainable development strategy. It is an important prerequisites for optimal control of building energy conservation that fast and accurate method research for predicting building electricity consumption. In this study, genetic algorithms and ant colony clustering algorithms are combined to improve the network node of IHCMAC (Improvement Hyperball CMAC) neural network based on clustering. As a building power load forecasting model, GIHCMAC (Genetic Algorithm Ant Colony Clustering Algorithm based on IHCMAC) is used to predict the electrical load of an office building in Weifang. The research results show that the prediction model has the smallest number of iterations and high accuracy. Its iteration number, training error, and generalization error are 9, 0.0045, and 0.0014 respectively. Compared with IHCMAC, KHCMAC (K-means Hyperball CMAC) and IKHCMAC (Improvement K-means Hyperball CMAC) model, GIHCMAC has faster convergence speed, higher accuracy, and better generalization.

    参考文献
    相似文献
    引证文献
引用本文

吴盼红,段培永,丁绪东,尹春杰,姬晓娃,邱钟.基于GIHCMAC神经网络的建筑电负荷预测方法.计算机系统应用,2019,28(8):142-147

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2018-12-18
  • 最后修改日期:2019-01-10
  • 录用日期:
  • 在线发布日期: 2019-08-14
  • 出版日期:
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京海淀区中关村南四街4号 中科院软件园区 7号楼305房间,邮政编码:100190
电话:010-62661041 传真: Email:csa (a) iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号