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

• URL: http://arxiv.org/abs/2202.12595v1
• Date: Fri, 25 Feb 2022 10:18:56 GMT
• Title: Evolutionary scheduling of university activities based on consumption forecasts to minimise electricity costs
• Authors: Julian Ruddick, Evgenii Genov, Luis Ramirez Camargo, Thierry Coosemans, Maarten Messagie
• Abstract summary: 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.
• Score: 0.9449650062296824
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Online Distributional Regression [0.0]
  Large-scale streaming data are common in modern machine learning applications. Many fields, such as supply chain management, weather and meteorology, have pivoted towards using probabilistic forecasts. We present a methodology for online estimation of regularized, linear distributional models.
  arXiv  Detail & Related papers  (2024-06-26T16:04:49Z)
• Energy-Efficient Scheduling with Predictions [4.662349748983561]
  In energy-efficient scheduling, the operating system controls the speed at which a machine is processing jobs. Recent work on learning-augmented algorithms aims to achieve improved performance guarantees by leveraging predictions. We provide a flexible learning-augmented algorithmic framework that takes as input an offline and an online algorithm for the desired energy-efficient scheduling problem.
  arXiv  Detail & Related papers  (2024-02-27T02:13:32Z)
• Learning-assisted Stochastic Capacity Expansion Planning: A Bayesian Optimization Approach [3.124884279860061]
  Large-scale capacity expansion problems (CEPs) are central to costeffective decarbonization of regional energy systems. Here, we propose a learning-assisted approximate solution method to tractably solve two-stage CEPs. We show that our approach yields an estimated cost savings of up to 3.8% in comparison to series aggregation approaches.
  arXiv  Detail & Related papers  (2024-01-19T01:40:58Z)
• Dynamic Scheduling for Federated Edge Learning with Streaming Data [56.91063444859008]
  We consider a Federated Edge Learning (FEEL) system where training data are randomly generated over time at a set of distributed edge devices with long-term energy constraints. Due to limited communication resources and latency requirements, only a subset of devices is scheduled for participating in the local training process in every iteration.
  arXiv  Detail & Related papers  (2023-05-02T07:41:16Z)
• Towards Compute-Optimal Transfer Learning [82.88829463290041]
  We argue that zero-shot structured pruning of pretrained models allows them to increase compute efficiency with minimal reduction in performance. Our results show that pruning convolutional filters of pretrained models can lead to more than 20% performance improvement in low computational regimes.
  arXiv  Detail & Related papers  (2023-04-25T21:49:09Z)
• Comparison and Evaluation of Methods for a Predict+Optimize Problem in Renewable Energy [42.00952788334554]
  This paper presents the findings of the IEEE-CIS Technical Challenge on Predict+ for Renewable Energy Scheduling," held in 2021. We present a comparison and evaluation of the seven highest-ranked solutions in the competition. The winning method predicted different scenarios and optimized over all scenarios using a sample average approximation method.
  arXiv  Detail & Related papers  (2022-12-21T02:34:12Z)
• Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
  We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
  arXiv  Detail & Related papers  (2022-04-16T12:03:52Z)
• Optimizing a domestic battery and solar photovoltaic system with deep reinforcement learning [69.68068088508505]
  A lowering in the cost of batteries and solar PV systems has led to a high uptake of solar battery home systems. In this work, we use the deep deterministic policy algorithm to optimise the charging and discharging behaviour of a battery within such a system.
  arXiv  Detail & Related papers  (2021-09-10T10:59:14Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Automatic Tuning of Stochastic Gradient Descent with Bayesian Optimisation [8.340191147575307]
  We introduce an original probabilistic model for traces of optimisers, based on latent Gaussian processes and an auto-/regressive formulation. It flexibly adjusts to abrupt changes of behaviours induced by new learning rate values. It is well-suited to tackle a set of problems: first, for the on-line adaptation of the learning rate for a cold-started run; then, for tuning the schedule for a set of similar tasks, as well as warm-starting it for a new task.
  arXiv  Detail & Related papers  (2020-06-25T13:18:18Z)
• Global Optimization of Gaussian processes [52.77024349608834]
  We propose a reduced-space formulation with trained Gaussian processes trained on few data points. The approach also leads to significantly smaller and computationally cheaper sub solver for lower bounding. In total, we reduce time convergence by orders of orders of the proposed method.
  arXiv  Detail & Related papers  (2020-05-21T20:59:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.