methods are gaining popularity because of their robustness,
speed and geographic adaptability.
Intuitively, this method gives reliable solar forecasts because
of solar generation’s seasonal and diurnal nature. However, the
main drawback is the lack of data specifically related to “clear
sky” days; Consequently, we use the most commonly occur-
ring day’s generation as baseline, which can be discovered by
our previous work [5].
For the baseload forecasting, the theme used is the appli-
cation of ensemble methods, as the current state of the art
identifies these methods to be most accurate when compared
to stand-alone methods [6]. We use mainly a combination of
random forest (RF), gradient boost (GB), autoregressive inte-
grated moving average (ARIMA) and support vector machine
(SVM), which are all well-studied and standard methods for
time series forecasting [7]. Specifically, we apply different
forecasting methods to different sub-series after disaggregating
the load profiles using Seasonal and Trend decomposition
using Loess (STL) due to their cyclic patterns [8].
The optimal scheduling of distributed energy resources
(DER) and controllable/uncontrollable loads for micro-grids
comes under the class of problems commonly referred to
as energy management problems. However, these classes of
problems tend to be non-convex and non-linear in nature be-
cause of the constraints associated with the scheduled devices,
e.g., scheduling uninterruptible loads such as lectures that
cannot be stopped once started. As reviewed by the authors
in [9], the majority of these problems are modeled via classical
optimization approaches such as MILP [10] and mixed-integer
non-linear programs (MINLPs) [11]. Other approaches include
dynamic programming [12], rule-based optimization and meta-
heuristic algorithms [13].
Since these problems tend to be non-convex and non-linear,
the major challenge associated with solving these problems
is tractability and (in the case of meta-heuristic methods)
convergence to a global optimum. The mathematical literature
surrounding MILPs offers a variety of techniques to simplify
these problems before solving them, and the availability of
solvers such as Gurobi®for MILPs make them a very attractive
option for solving these problems. Also, unlike other models
where the algorithms (may) converge to a local optimal
solution, modern MILP solvers can obtain globally optimal
solutions for this class of problems.
C. Contributions
Based on the related work studied, this paper offers the
following contributions to the body of knowledge:
•A solar forecasting algorithm using training data from
refined motif (RM) discovery technique and use of an
over-parameterized 1D-convoluted neural network (1D-
CNN) implemented via residual networks (ResNet). To
overcome the lack of “clear sky” data, we incorporated
the work done previously by Rui Yuan et al. [5] to identify
RMs in the given solar generation dataset. An RM is the
most repetitive pattern within a given time series, which
can be extracted along with the exogenous variables
(e.g., weather information) associated with this pattern.
Using this as a baseline, we estimated solar generation
by training an over-parameterized 1D-CNN. Some studies
have shown that over-parameterization of CNNs can lead
to better performance at the expense of longer training
time [14]–[16]. Therefore, a ResNet was implemented to
develop a deeper NN but with faster computation time.
•An optimal micro-grid scheduling algorithm is solved
based on real-world data for a university-based appli-
cation. To the best of our knowledge, there has not
yet been a study to co-optimize lectures schedule (and
associated resources) and battery operation (with PV
panels). Therefore, in this paper, we have developed and
tested our algorithm using real-world data and practical
case instances provided by Monash University. Given the
large problem size (one-month schedule) and the presence
of a quadratic term in the objective function for the cost of
peak demand, we proposed a two sub-problem approach
to formulate a tractable problem. The first sub-problem
was used to limit the peak demand throughout the month,
eliminating the quadratic term from the objective. Then,
the peak demand was used to solve the second sub-
problem to minimize the total electricity costs.
The rest of the paper is structured as follows. Section II
introduces the data, information and problem requirements.
Section III proposes the forecasting and optimization method-
ologies. Section IV presents the numerical results of the
scheduling algorithm based on time series forecasting. Finally,
we conclude the paper section V.
II. BACKGROUND INFORMATION
This section describes the competition requirements and
data provided by the organizers.
A. Problem statement
This section describes the scheduling constraints and ob-
jective function provided by the competition organizers and
has been adapted from [2]. We were required to develop
prediction algorithms for the baseload of six buildings in
Monash University and the solar generation of PV panels
connected to them. After this, we had to use these predictions
to optimally schedule lecture activities and battery operation
while minimizing the electricity costs (i.e., electrical energy
consumption cost plus peak demand charge). We were allowed
to consider the electricity prices as known parameters to
simplify the problem and focus on predicting solar generation
and baseload.
For each lecture activity, we are provided with several small
or large rooms needed, the electrical power consumed per
room and the duration of the activities (in steps of 15 minutes).
We are also provided with a list of precedence activities, i.e.,
activities that must be performed at least one day before the
activity in question. For the batteries, we are provided with
the maximum energy rating, i.e., state of charge (SOC), the
peak charge/discharge power and charge/discharge efficiency.