arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.12595cs.LGcs.NE
收藏

基于消费预测的大学活动进化调度以最小化电费成本

Evolutionary scheduling of university activities based on consumption forecasts to minimise electricity costs

Vrije Universiteit Brussel(布鲁塞尔自由大学);EVERGi;MOBI

Julian Ruddick, Evgenii Genov, Luis Ramirez Camargo, Thierry Coosemans, Maarten Messagie

AI总结:

本文提出一种结合多维时间序列预测与进化优化的方法,用于调度大学活动和电池使用,以最小化校园电费成本,并在IEEE竞赛中取得第二低成本。

摘要:

本文针对一个“先预测后优化”的问题提出了解决方案,其目标是降低大学校园的用电成本。所提出的方法结合了多维时间序列预测和一种新颖的大规模优化方法。采用梯度提升方法对莫纳什大学校园2020年11月的发电和用电时间序列进行预测。对于用电预测,我们采用对数变换来建模趋势并稳定方差。在适用的情况下,向模型输入添加额外的季节性和趋势特征。所获得的预测被用作大学活动和电池使用调度优化的基础负荷。优化的目标是最小化电费成本,该成本由电价和峰值电费构成,两者均受课堂活动和电池使用负荷的影响,同时还包括未安排某些可选活动的惩罚。课堂活动的调度通过使用协方差矩阵自适应进化策略和遗传算法的进化优化获得。然后通过局部搜索对每个活动逐一测试可能的时间来改进该调度。电池调度被表述为一个混合整数规划问题,并由Gurobi求解器求解。在与IEEE竞赛中提出的其他6种方法(这些方法均使用混合整数规划和Gurobi求解器来调度活动和电池使用)进行评估时,该方法获得了第二低的成本。论文中使用的代码和数据公开可用。

英文摘要:

This paper presents a solution to a predict then optimise problem which goal is to reduce the electricity cost of a university campus. The proposed methodology combines a multi-dimensional time series forecast and a novel approach to large-scale optimization. Gradient-boosting method is applied to forecast both generation and consumption time-series of the Monash university campus for the month of November 2020. For the consumption forecasts we employ log transformation to model trend and stabilize variance. Additional seasonality and trend features are added to the model inputs when applicable. The forecasts obtained are used as the base load for the schedule optimisation of university activities and battery usage. The goal of the optimisation is to minimize the electricity cost consisting of the price of electricity and the peak electricity tariff both altered by the load from class activities and battery use as well as the penalty of not scheduling some optional activities. The schedule of the class activities is obtained through evolutionary optimisation using the covariance matrix adaptation evolution strategy and the genetic algorithm. This schedule is then improved through local search by testing possible times for each activity one-by-one. The battery schedule is formulated as a mixed-integer programming problem and solved by the Gurobi solver. This method obtains the second lowest cost when evaluated against 6 other methods presented at an IEEE competition that all used mixed-integer programming and the Gurobi solver to schedule both the activities and the battery use. The code and data used for the paper are publicly available.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑