Dynamic Time- and Load-Based Preference toward Optimal Appliance Scheduling in a Smart Home
Algorithm 1
Optimal mapping model.
(1)
Start procedure
(2)
Input data: load energy consumption table, time-based preference table, load-based preference table, budget, and TEAPV.
(3)
Compute absolute comfort using equation (3), TEAPV using equation (7), and TEAGrid using equation (8).
(4)
For i = 1 to n do
(5)
For t = 1 to 24 do
(6)
Evaluate the following optimization expression: where AC is the absolute comfort matrix, P is the appliance power matrix, represents the length of the boxes where the user’s absolute comfort is different from 0, and x is the decision variable output, and it takes 0/1 if the load is OFF/ON.
(7)
End for
(8)
End for
(9)
Return x (i, t) the decision variable output
(10)
Calculate the level of comfort using equation (10)
