2018
DOI: 10.1016/j.conengprac.2018.08.009
|View full text |Cite
|
Sign up to set email alerts
|

Cost-optimal model predictive scheduling of freezers

Abstract: A cost-optimal model predictive scheduling algorithm is presented that operates in a day-ahead market. The underlying optimizer is a heuristic branch and bound algorithm that finds the constrained optimal scheduling of a freezer with respect to hourly changing energy price. The method is also able to iteratively re-estimate the heat capacity of the freezer. Simulation experiments were performed on a freezer model identified from measurement data. Results show that the proposed algorithm successfully decreased … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 21 publications
(24 reference statements)
0
8
0
1
Order By: Relevance
“…The physical meaning and the estimated values of the parameters as reported in our previous paper [12] can be found in Table I. It is important to note that the heat capacity of the containment C a varies with the varying load of the refrigerator, while all the other parameters can be assumed to be constant.…”
Section: B Piecewise Affine Modelmentioning
confidence: 99%
See 4 more Smart Citations
“…The physical meaning and the estimated values of the parameters as reported in our previous paper [12] can be found in Table I. It is important to note that the heat capacity of the containment C a varies with the varying load of the refrigerator, while all the other parameters can be assumed to be constant.…”
Section: B Piecewise Affine Modelmentioning
confidence: 99%
“…The model predictive scheduler described in [12] serves as a starting point of the present work and its operation is summarized in what follows. The optimization algorithm behind the MPC problem to be solved in each iteration is a heuristic branch and bound binary search algorithm based on the following three rules:…”
Section: B Model Predictive Schedulingmentioning
confidence: 99%
See 3 more Smart Citations