1. Introduction
The conventional power grid is often considered as a complex machine ever built. The entire electrical network is composed of four main units: generation, transmission, distribution, and consumption. The conventional grid is capable of delivering the electrical power from generation unit to end consumer via transmission and distribution networks. The one-way communication infrastructure in the traditional grid is incapable to efficiently handle several parameters of the entire electrical network. The main deficiencies in the conventional grid are: incapable to optimally handle economic dispatch, unit commitment, state estimation, monitoring of transmission lines, faults detection, self-healing and managing the demand in real time environment [
1].
In this regard, valuable research work has been carried out to address the aforementioned problems. As a result, the smart grid (SG) has emerged as a solution to overcome these limitations. SG integrates advanced metering infrastructure (AMI), a smart meter (SM), intelligent control system and advanced communication technologies. Integration of renewable energy sources (RESs), cost reduction and load management issues have attained the focus of many researchers regarding power management; which is considered to be the most crucial factor in order to fulfill the increasing power demand [
2]. The management of power is classified into two categories. One is supply side management (SSM) and the other is demand side management (DSM). The former ensures efficient generation, transmission, and distribution of electricity. This is also responsible for providing reliable energy at minimum economic cost [
3]. However, our work is focused on latter that aims at planning and monitoring activities [
4,
5]. Demand response (DR) is a component of DSM, which encourages consumers to modify their energy consumption pattern and shift their load from on-peak hours to off-peak hours. Cost sensitive consumers participate in DR by adjusting their power demand in response to time-varying prices.
A decentralized algorithm is proposed in [
6] to optimally manage charging an discarding of electric vehicle (EV). In this framework, aggregator and consumers are considered as two entities in which aggregator maximizes the profit of utility while consumers minimize their electricity bill. Consumers manage their charging and discarding schedule in response to time-varying prices, which benefits not only consumers in minimizing their electricity bill but also keeps distribution of network within its operational limits. Vehicle-to-vehicle (V2V), vehicle-to-grid (V2G) and grid-to-vehicle (G2V) exchange of power is also considered by providing monetary incentives. In [
7,
8,
9,
10,
11], mixed integer linear programming (MILP) is used to solve the problem of residential DR. A distributed network of RES along electric storage system (ESS) is also efficiently tackled, whereas penetration of EV for energy trading is also taken into consideration [
7]. Authors in [
8] analyzed two different scenarios, one of which is based on ripple control while the other is based on optimal load scheduling, showing that scheduling performs better in terms of cost reduction. D. Zhang et al. [
9] dedicated their work to consumers’ bill and CO
emission minimization, ignoring user comfort. In [
10], authors mainly focused their work on task scheduling with thermal comfort constraints. RES and ESS have been efficiently integrated to fulfill consumers’ thermal comfort requirements. Shiftable, thermal and interruptible loads are considered in [
11]. Shiftable loads have predefined working cycles while thermal loads have variable working cycles during different time slots. However, adopting day-ahead pricing (DAP) [
7,
8,
9,
10,
11] scheme shows a large gap with hourly real-time price (RTP) due to estimation error [
12].
Authors in [
13] developed a home energy management system (HEMS) to determine an optimal load schedule. DR is applied for load-shaping under DAP for minimizing consumer’s electricity bill. Peak power limit restricts the load below the upper limit. Utilization of ESS is handled efficiently to meet the energy requirement of a consumer in on-peak hours. In [
14], a multi-layer ant colony optimization (MACO) is used to solve the energy management problem in stand-alone microgrid. The microgrid consists of wind turbine (WT), photovoltaic (PV), microturbine (MT) and ESS. Results obtained from MACO are also compared with conventional EMS and particle swarm optimization (PSO). MACO shows better performance as compared to conventional EMS and PSO, due to fast convergence and less computational complexity. Similarly, authors in [
15,
16] used game theory approach to minimize consumers electricity consumption cost. Noncooperative multi-agent game theoretic approach is developed for managing demand of a group [
15], while maximizing profit of both, utility and consumer. 0–1 mixed integer programming is utilized to compute non-dominated solutions. Algorithm developed in [
16] is also based on noncooperative approach which uses dominance game strategy. However, user comfort is not addressed in all the aforementioned papers.
Customized evolutionary algorithm [
17] is utilized for multi-objective optimization of residential loads. Thermostatically controlled loads and shiftable loads are considered for scheduling. The multi-objective model considers cost and user dissatisfaction minimization as objective functions. Optimal stopping rule (OSR) [
18] is applied to schedule home appliances based on RTP. The problem is formulated to minimize energy consumption cost, considering technical operational constraints of appliances. Different duty cycles of the appliances are scheduled e.g., ice making and defrost cycles. OSR works on threshold based policy, which is the major limitation of this work. If price does not fall below the threshold then appliances will remain in waiting state.
Several aspects must be considered in order to achieve a coordination between utility and consumer, such as, cost minimization, operational issues, load balance and user satisfaction. User satisfaction is one of the important aspects which must be considered along with electricity bill reduction. Nature-inspired optimization techniques are able to efficiently address these complex tasks in load scheduling problems.
The aim of this work is to design an intelligent HEMS for a single home which can effectively schedule consumers’ power demand. We have applied three existing optimization techniques: genetic algorithm (GA), teacher learning-based optimization (TLBO) and linear programming (LP). We also proposed a teacher learning genetic optimization (TLGO) by combining GA with TLBO to achieve our objectives i.e., to minimize cost with minimum user discomfort. We compared the performance of heuristic techniques with LP in terms of cost, peak power consumption, peak to average ratio (PAR) and user discomfort. Our major contribution is to minimize consumers’ electricity bill at minimum user discomfort.
Rest of the paper is organized as follows:
Section 2 reviews state-of-the-art work. Problem description is given in
Section 3 and problem is formulated in
Section 4. System model is described in
Section 5 and proposed solution is given in
Section 6. Simulations and discussions are presented in
Section 7 and finally,
Section 8 contains the concluding remarks of our work.
2. Related Work
In literature, many optimization techniques are presented for load scheduling to reduce consumer electricity bill and peak power demand reduction. HEMS has an important role in residential load scheduling. Rastegar et al. [
19] proposed DR-based HEMS for residential sector to minimize consumer electricity bill while maximizing user comfort. Appliances are categorized into two categories: controllable and uncontrollable appliances. For optimal scheduling of household electrical appliances, time of use (ToU) and inclined block rate (IBR) pricing schemes are applied. Operational priority of controllable appliances is also taken into consideration to maximize user comfort. The value of load loss (VOLL) is calculated to determine the priority of running an appliance at any specific time slot. Proposed solution reduces the cost and maximizes user comfort, however, PAR is ignored.
In [
20], authors utilized interval number optimization for scheduling of household appliances. Appliances are categorized into interruptible, non-interruptible and thermostatically controlled load. Interval number analysis is introduced for handling uncertain hot water demand and ambient temperature. Binary PSO (BPSO) combined with integer linear programming (ILP) is used for load scheduling to minimize consumers’ electricity bill; while thermal comfort is also taken into consideration.
Shirazi and Jadid [
21] proposed a residential power scheduling technique to coordinate appliances and distributed energy resources (DERs). Scheduling is performed under DAP for shifting the load from on-peak hours to off-peak hours. Mixed integer nonlinear programming (MINLP) is used to formulate the multi-objective function. The optimization problem is solved for two conflicting objectives, i.e., to minimize energy consumption cost and maximize user comfort. Authors considered both electrical and thermal appliances for scheduling. Proposed technique is analyzed for summer and winter under different scenarios. Results show the reduction of 1.5% to 1.8% in cost by reducing hot water temperature by 1
C; however, MINLP has high computational complexity.
Automated DR is applied in [
22] for solving cost minimization problem via MINLP, while minimizing daily power consumption. Home appliances are classified into five categories including electrical and thermal appliances. High prices are applied when consumers’ demand exceeds the threshold, which helps to avoid peak creation in off-peak hours.
In [
23], the grid and RES are considered as two main energy sources. Energy trading is also handled where a consumer can sell surplus energy to the others. Authors addressed load scheduling problem along with the exchange of power among different consumers and utility. Approximate dynamic programming technique is used for load scheduling purpose whereas game theory is applied to tackle the power exchange among different consumers. In this way, the proposed scheme has successfully managed to reduce the electricity consumption cost. Moreover, due to the distribution of energy among consumers, the reverse flow of energy is also reduced, which increase the stability of the entire grid. Zhao et al. [
24] integrated RES and plug-in electric vehicle (PHEV) where surplus electricity can be sold back to the grid. Authors presented distributed optimization algorithm to minimize consumers’ electricity bill and achieved a flattened load curve.
Chakraborty et al. [
25] presented a model for energy optimization by integrating PV and a wind turbine as RES. Fuzzy logic is used to address uncertainties caused by integration of RES. An intelligent quantum evolutionary algorithm (EA) is implemented for scheduling and dispatching of electricity, considering economic and environmental aspects. Resource scheduling is handled in an excellent way to reduce carbon emissions and production cost. Rajalingam and Malathi [
26] developed the smart controller for HEMS to minimize electricity bill and peak power demand. Solar power is a primary source of energy while in the case of unavailability of solar power, controller shifts to the grid. Selective harmonic elimination method is presented to handle power quality disturbance resulted from DC to AC conversion. Results show the saving of 90 units/month from the grid and this requirement is fulfilled from PV generated energy.
In [
27], a multi-objective EA is proposed with the objectives to minimize cost and waiting time. Appliances are temporarily stopped when total running load exceeds the predefined limit, which restrict the load within a limit. Integration of wind energy with ESS is proposed in [
28] to minimize carbon emissions. DR is implemented to reduce cost, carbon emissions and to increase utilization of wind energy. The multi-objective function is converted into a single objective by linear combination through weighted sum method. Different case studies are taken to validate the proposed solution. Results show that incorporating DR and ESS decrease both consumers bill and carbon emissions while maximizing the utilization of wind energy.
An energy scheduling mechanism is proposed in [
29] to minimize energy consumption cost by considering energy prices and comfort constraints. For comfort management, energy scheduler adjust the temperature of a room from the given range of temperature according to user preferences. Wireless sensors are utilized to measure the temperature and pass this information to the control system. Based upon temperature and pricing information, scheduler controls the Heating, ventilation, and air conditioning (HVAC) operation by the use of actuators. Objective function is formulated as a convex combination of energy consumption cost and penalty factor, reflecting consumers’ comfort constraints. In [
30], multi-objective MILP is applied for managing energy in a smart home by considering both energy saving and consumers’ termal comfort. Integration of RES and task scheduling is efficiently handled in order to maximize the usage from RES. Authors of [
29,
30] have not considered time-shiftable appliances in their work. Quality of experience (QoE) aware smart HEMS proposed in [
31], relies on annoyance suffered by users due to the change with respect to user preferences. Smart HEMS relies on two algorithm: QoE aware cost saving appliance scheduling (Q-CSAS) and QoE aware renewable source power allocation (Q-RSPA). The Former handles the scheduling of controllable load, based on users’ profile and electricity prices, whereas the latter changes the schedules according to availability of the renewable sources. Major contribution of [
30,
31] is to jointly optimize DER and main grid power usage by considering uncertainties caused by DER and cost variations of the power grid. However, the model in [
31] is based on greedy approach which considers immediate solution, ignoring the long-term benefits. Therefore, the greedy algorithm does not always provide optimal solution.
A framework for DSM is presented in [
32] with a concept of load clustering. Appliances’ power consumption pattern is predicted based on historical data. The aggregator is used to coordinate the power request of appliances. DAP is applied to synchronize charging and discharging pattern and to get the cost effective power consumption pattern. A model for optimal power flow is presented in [
33], with an objective function of cost minimization and power balance under ToU pricing scheme. Integration of RES and ESS is also handled efficiently where the consumers have flexibility to sell surplus electricity back to the grid. Three main components of the cost function are: first, electricity purchasing cost from the grid, second, revenue generated from selling electricity to the grid and the third is installation cost of the hybrid system.
Vardakas et al. [
34] analyzed different power demand scheduling scenarios for reducing peak demand. Fixed, power compressible and time-shiftable appliances are taken into consideration. Authors analyzed four different scenarios to minimize peak load demand during on-peak hours. The major achievement of this work is the proposed recursive formula which is used to determine the distribution of power units in use. However, the assumption of infinite number of appliances result in overestimation. To overcome the aforementioned limitation, authors extended their work for finite number of appliances [
35]. A residential area with 50 homes is assumed where each home has same appliances. Four scenarios are analyzed to minimize peak demand load. Each scenario is associated with RTP, which provides incentives to the users for compressing their power demands.
GA is used by Bharathi et al. [
36] to minimize power consumption in residential, commercial and industrial area. Authors also compared the performance of GA with other EAs. Result shows an overall reduction of 21.9% in power consumption during on-peak hours. Gupta et al. [
37] applied GA for solving cost minimization problem. Authors formulated the problem via MILP, while GA is applied to determine the schedule. Integration of RES along with ESS is handled efficiently to modify consumers’ load profile. There is also a mechanism where excessive energy can be sold back to the grid. Authors in [
38] presented their model for HEMS with an objective to minimize cost while maximizing user comfort in terms of minimizing appliances waiting time. The proposed model is based upon evolutionary techniques (GA, BPSO and cukko search). Authors also evaluated their model with and without integration of RES. Results shows a significant cost saving, however power-flexible appliances are not considered.
Authors in [
39] presented their model for managing residential load within user-defined budget. GA is applied to solve the optimization problem where the objective is to maximize user comfort while reducing electricity consumption cost. Proposed technique is analyzed under three budget scenarios. Results validate that cost is reduced while achieving maximum user comfort, however, PAR is ignored. Ziming et al. [
40] proposed a load balancing mechanism by minimizing peak hourly load. ILP is applied in order to achieve an optimal daily load schedule. Results show that a balanced load curve is achieved by increasing the number of appliances. However, consumers have little incentive to participate in load shifting.
In [
41], residential load scheduling model is presented under RTP. Authors presented a novel concept of cost efficiency and used fractional programming to achieve an optimal load schedule. The proposed algorithm is analyzed with and without DERs. Results show significant reduction in consumers’ electricity bill. Chaojie et al. [
42] developed a distributed algorithm for load shifting. Residential load scheduling problem is modeled using game theory approach. Authors also applied Newton method to accelerate the convergence rate of Nash equilibrium. Results show that proposed algorithm has fast convergence to a better solution that minimizes PAR and user discomfort.
In [
43], authors presented integrated DR (IDR) and developed a model for smart energy hub. Smart energy hub takes electricity and natural gas as an input and participates in IDR by switching the energy resources. Smart energy hub converts natural gas into electricity during on-peak hours. IDR reduces peak demand on utility side while minimizing users’ electricity bill. Seokjae and Jang [
44] focused on a residential sector for energy optimization having multiple homes. The main objective of this work is to optimize the consumer satisfaction in term of overall electricity consumption cost. The generalized bender algorithm is proposed to solve the residential load scheduling problem. For practical implementation, maximum budget constraints and the total capacity of a grid is taken into consideration. Results validate that the proposed model successfully achieves a near-optimal solution for the residential load. Moreover, the privacy of the residents has efficiently been addressed which increase the reliability of a grid.
In [
45], a smart building with 30 homes is considered, where each home has 12 appliances. The problem is formulated as a multi-objective optimization problem and MILP is applied to solve the problem. Consumers’ electricity bill and carbon emissions reduction are two major achievements. However, power-flexible appliances are not taken into consideration which has a major role in cost reduction. In [
46], ILP is used to solve the energy optimization problem. Prices vary between summer, winter, weekdays and weekend. Results show that limited profit is achieved from appliance shifting and renewable energy usage is not much affected due to limited flexibility of different home appliances.
In [
47], the entire DSM infrastructure is divided into two modules: distributed and centralized. In distributed module, the proposed model focuses on cost minimization. The objective function is formulated via MILP and solved using general algebraic modeling system (GAMS). In the centralized module, the objective is to modify the load curve as per the choice of utility. The minimization problem is formulated using mixed integer quadratic programming. While modifying the load profile curve, consumer’s energy consumption cost and comfort are taken into consideration. The proposed model is implemented for 50 households. Asare et al. [
48] discussed multi-agent based HEMS to optimize residential energy. AMI is integrated to receive time-varying pricing signals. Users’ preferred setting for electrical and thermal appliances and external weather conditions are considered for energy management.
Table 1 shows strength and limitations of the state-of-the-art work.
Motivated form literature, we have proposed a smart HEMS based upon heuristic techniques. The main contributions of this work are:
We have proposed a smart HEMS with an objective to minimize both, cost and user discomfort.
Hybrid heuristic optimization technique to schedule the time-flexible and power-flexible appliances.
Analyze the effect of different pricing scheme on power consumption pattern.
Analyze the impact of using smaller and larger time slots on cost, comfort and complexity of the model.
Minimize PAR and peak power consumption in order to avoid peak power plants.
3. Problem Description
Energy optimization is one of the difficult tasks in SG due to random nature of consumers’ power consumption pattern and electricity prices. In literature, a substantial work has been carried out to modify consumers’ power consumption pattern in order to reduce consumers’ electricity bill, PAR and peak power demand. MILP is implemented in [
49] for home appliance scheduling while taking technical operational constraints into consideration. Cost reduction is a primary objective; whereas authors also discussed different energy phases of appliances. The proposed framework is deterministic and is based on pricing tariff in which prices are known to consumers 24 h in advance. Authors evaluated the performance of their model for two different pricing schemes, providing an insight for tariff design. Major limitations of this work are that user comfort is not addressed and the other limitation is scalability issue that arises due to complexity of the problem.
In [
50], a load scheduling problem is modeled as a convex optimization problem to minimize electricity bill while maximizing user comfort. Both, power-flexible and time-shiftable appliances are handled efficiently. Authors formulated comfort maximizing user comfort as equivalent to minimization of discomfort user discomfort. Taguchi loss function is used to handel user discomfort for power flexible appliances. However, computational complexity increases with the increase in the size of the problem.
In this paper, a single home is considered with six different appliances. Similar to [
50], total daily electric demand depends upon operations of inflexible, time-flexible and power-flexible appliances. It is assumed that electricity price is forecasted one day in advance. Our objective is to minimize both, consumption cost and user discomfort. We proposed a hybrid technique TLGO by combining GA with TLBO to achieve our objective. The overall problem can be stated as:
Given are (a) total time horizon (total time over which scheduling is performed); (b) DAP signal; (c) appliances starting and finishing time; (d) length of operation; (e) power demand of each appliance; and (f) upper and lower limits of power-flexible appliances.
Determine (a) power consumption pattern; and (b) task starting time.
So, as to find optimal power schedule with minimum electricity consumption cost and user discomfort, DAP and critical peak pricing (CPP) tariffs are applied. We evaluate our proposed model under four performance parameters: electricity consumption cost, user discomfort, PAR and peak power demand.
4. Problem Formulation
Optimization is an active and fast growing research area in the field of mathematics, computer science and engineering. Optimization is the process of minimizing or maximizing desired factors according to an objective function under certain constraints. In this section, we mathematically formulate the energy optimization problem. Consumers adjust their energy consumption pattern according to time-varying signal in order to minimize their electricity consumption cost. In this regard, inflexible and flexible appliances are considered. Inflexible appliances must operate when requested with fixed power rating, whereas flexible appliances have the flexibility to delay their operation or modify their power consumption profile. Inflexible appliances include toaster, kettle and refrigerator, and these appliances have fixed starting and finishing time. They cannot bear any delay and their power consumption profile cannot be modified. Total hourly power consumption for all appliances is given by,
where
represents the total power consumption of inflexible appliances during any time slot.
is a decision variable that represents the status of an appliance
i at time
t, and
is the power consumption of an appliance. Total daily power consumed by all types of appliances is given as,
represents the total power consumed over the total scheduling horizon i.e.,
to
. Total daily cost depends on two factors, first is the power consumed by an appliance and second is electricity price at that time slot. The expression of calculating total daily cost is,
For inflexible appliances, power consumption is given by:
where
and
represent the starting and finishing time of an appliance respectively.
denotes the electricity price at any time slot
t.
= 1 represents that an appliance is in ON status and
= 0 represents the OFF status of an appliance.
shows the power rating of an appliance which is fixed for inflexible appliances.
Flexible appliances are further classified into two categories: time-flexible () and power-flexible () appliances.
Time-flexible appliances—The appliances included in this category have flexible starting time while their finishing time is fixed eg., Cloth Washer. These appliances must complete their operation before finishing time and their operation can be delayed to another time slot within its scheduling horizon. These appliances operate continuously once scheduled while consuming fix power.
where
represents the length of the operation time of appliances.
Power-flexible appliances—These appliances have fixed starting and finishing time while their power profile is flexible. These appliances operate with power within the minimum and maximum power range. This category includes lights and air conditioner.
Constraint (6b) shows that power consumption of power-flexible appliances varies in an interval between minimum and maximum power rating.
Time-flexible appliance may delay its operation to another time slot where electricity price is low, however delaying the operation of an appliance results in user discomfort. Similarly, power-flexible appliances compress their demand and operate at the lower power level in order to minimize consumers’ bill, which also induces discomfort. The expression for calculating user discomfort caused by time-flexible appliances is given as follows:
where
is the request time of an appliance whereas
is the actual start time of an appliance after delaying the operation.
k denotes the operation characteristics and
is the discomfort coefficient. Discomfort induced by power-flexible appliances is formulated using Tougchi loss function [
51],
The expressions for calculating user discomfort provided in Equations (7) and (8) are taken from [
50].
is the parameter that varies with appliances.
denotes the normal power consumption, whereas
denotes the deviated power from normal power consumption at
t. Tougchi loss function is minimum at
, and increases as power deviates from normal power consumption. Tougchi loss function defines the relationship between deviated power from normal power consumption and economic loss. The deviation from normal power consumption denoted by
represents the power deviation at which functional failure occurs for an appliance. When the power deviation is at its extremes, and an appliance is consuming the power
or
, there must be some countermeasures to be taken by consumers. Lets assume the cost of countermeasure is
A at
or
, the parameter
is defined as
Total discomfort caused by both the types of appliances is computed by:
Now, we formulate the scheduling problem into optimization problem. Our overall objective is to minimize electricity consumption cost while also minimizing user discomfort. Both the objectives are simultaneously solved by using the linear weighted sum method. Equal weights are assigned to both the objectives.
Objective function formulated in Equation (10) shows that both cost and user discomfort are to be minimized. The expressions for user discomfort and appliances parameters enlisted in
Table 2 are taken from [
50].
and
are the weights of cost and user discomfort, respectively. We have assigned equal weights to both parts of our objective function, i.e.,
=
= 0.5. By changing the weights, the part of objective function having more weight will contribute more in the overall objective function. Equation (10a) shows the total daily electricity consumption cost of all the appliances. Constraint (10b) shows that total scheduled cost must be less than the unscheduled cost. Constraints (10c) and (10d) are the power consumption of time-flexible and power-flexible appliances, respectively. Constraint (10c) denotes that the power profile of time-flexible appliances is fixed, whereas constraint (10d) shows that the power-flexible appliances can modify their power profile within its minimum and maximum power range.
Objective function formulated in Equation (10) is separable for the two types of appliances: time-flexible appliances and power-flexible appliances. So, optimization problem formulated by Equation (10) is decomposed into two subproblems (P1) and (P2).
and
The optimization subproblems for time-flexible and power-flexible appliances are represented by (P1) and (P2) respectively. The subproblem (P1) includes only integer variables () for time-flexible appliances such that . The subproblem (P2) contains both integer and non-integer variables () for power-flexible appliances. The subproblem (P2) can be solved independently for each appliances for each time slot.
The power constraint
in subproblem (P2) is not active for all the time, and is dependant on the value of parameter
. The constraint will be inactive when
satisfy following expression
otherwise constraint will be inactive.
5. System Model
In this paper, a smart home is considered where consumers are equipped with SM, AMI, HEMS, and advanced communication network. The overall architecture of our proposed model is demonstrated in
Figure 1, which includes SM, home area network (HAN), a master controller (MC), and in-home display (IHD). Basic communication infrastructure between utility and consumer is assumed to be present. The flow of power is denoted by solid lines while data flow is represented by dashed lines. Solid lines indicate wired routes whereas dashed lines illustrate wireless routes. SM receives the time varying pricing signals and sends power demand to the utility. AMI installed between utility and SM to provide two-way data communication. Wide area network (WAN) is responsible for providing robust and high bandwidth communication between utility and consumer. In WAN, long-term evolution (LTE), power line carrier (PLC), broadband power line, fiber and cellular networks are adopted to provide high bandwidth and long distance data transmission [
52]. These technologies provide the best coverage at the lowest cost. Whereas, HAN is responsible for communication between SM and home appliances. In HAN, Zig-Bee, Wi-Fi, Z-wave, and Bluetooth devices are widely adopted to provide cost effective communication [
53]. Consumers interact with IHD to provide energy consumption pattern of appliances. MC is the main component of HEMS which receives appliance power demand and provides a schedule for home appliances. This schedule is transferred to appliances via HAN. As discussed in
Section 4, the appliances include inflexible and flexible appliance. Inflexible appliances must run when requested with fix power rating, while flexible appliances can modify their power consumption pattern.
Appliances parameters are listed in
Table 2. The total time horizon is 24 h and each time slot represents 1 h. To determine an optimal schedule, MC requires a number of parameters like price signal, appliance power profile, starting and finishing time and length of operation time. The goal of this model is to minimize electricity consumption cost and user discomfort under DAP and CPP scheme.
6. Proposed Solution
The problem formulated in
Section 4 is solved using GA, TLBO, and TLGO technique. TLGO technique is proposed by combining the features of both GA and TLBO. Different mathematical techniques have been presented in literature to address the power scheduling problems, including LP, ILP, MILP and convex optimization. However, their computational complexity is very high. So, we have applied population-based techniques to handle the power scheduling problem. Description of these techniques is given as follows.
6.1. GA
GA is an evolutionary algorithm, inspired by the genetic process of living organisms. GA has high convergence rate and is able to search for a good solution within minimum time. GA performs parallel search in the given solution space which minimizes the probability of being trapped into local optimal solution. It has the ability to handle the complex and huge problems with less computational efforts.
GA starts with randomly generated population called chromosomes, and the population is updated in each iteration. The bits or genes of chromosomes corresponds to the status of the appliances, and the length of chromosome shows the number of hours over the scheduling horizon. Initially, the population is generated randomly, then fitness of each chromosome is evaluated on the basis of a fitness function of the optimization problem. The elitist selection is performed to save the elite candidates, which guarantees that the good quality chromosomes are not lost in the next iteration when the population is updated. After elitism step is completed, tournament based selection process selects two parent chromosomes from the population for reproduction process. Crossover operation is applied to the selected chromosomes, and the population is updated by adding new offsprings into existing population. The new generated offsprings inherits the properties of both the parents, the offspring contains some bits from parent 1 while the others from parent 2. Then mutation operator randomly inverts a bit of selected chromosome which minimizes the probability of repetition of same chromosomes in the population. Then the fitness of population is evaluated based on Equation (10).
The crossover rate is usually kept higher while mutation rate is kept lower. The higher rate for crossover avoids the chances of premature convergence at local optimum solution. The lower rate of mutation maintains randomness in the population to avoid the repetition of chromosomes. Parameters for GA are provided in
Table 3.
Once, the crossover and mutation are done, the fitness of the population is evaluated again and compared with the fitness of previous population. The whole process continues until termination criteria is met. Upon termination, the chromosome with the highest fitness is selected, which satisfies the objective function given by Equation (10). Algorithm 1 shows the step-by-step working of GA.
Algorithm 1: GA |
|
6.2. TLBO
TLBO was proposed by R. V. Rao et al. [
54] in 2011, which is a population-based algorithm inspired by the process of teacher and learners. Unlike other heuristics algorithm, TLBO requires less algorithm specific parameters, which is the major reason to choose TLBO algorithm for our optimization problem. Other heuristic algorithms are heavily dependant upon parameter selection which is a major limitation, as their performance heavily depends on parameters tuning. A minor change in any parameter may disturb the overall effectiveness of an algorithm.
TLBO starts working by generating the random initial population and then updates the population in every iteration. Rows corresponds to learners, where column corresponds to subjects. Each subject of the learner represents the status of an appliance, whereas the total number of subjects of a learner correspond to the hours over which scheduling is to be performed. The goal of each learner is maximize its knowledge in each subject. The process of TLBO is divided into two phases: teacher phase and learner phase.
In teacher phase, the mean of learners in every subject is calculated. The fitness of each learner is evaluated and the best learner is selected as a teacher (
). The algorithm works by shifting the mean of learners to the teacher, and a new vector is added to the existing population which is formed from the current mean and best mean vector,
where
r is randomly generated number between 0 and 1.
is teacher factor and its value is either 1 or 2. Value of
is randomly selected as,
where
is random number and its value is between 0 and 1.
is not an input parameter and is randomly decided by algorithm using Equation (12). The value of
is selected to be either 1 or 2 depending on rounding up criteria. If
has higher fitness than
, then
is replaced by its superior learner
.
In the learner phase, learners interact with each other and increase their knowledge by mutual interaction. Each learner interacts with other learners for the sake of knowledge sharing. For each learner
, another learner
is randomly selected
and the population is updated as,
The algorithm continues until termination criteria met. Complete working of TLBO is given by Algorithm 2.
Algorithm 2: TLBO Algorithm |
|
6.3. TLGO
We proposed TLGO by combining the features of GA with TLBO. In designing an algorithm, exploration and exploitation are two important aspects that must be taken into consideration. In order to achieve better results, there must be a balance between local and global search. TLBO performs well in exploitation mode, i.e., finding the best solution in local search space, however perform poor in exploration mode. To overcome the imbalance in exploration and exploitation mode, we have proposed TLGO technique by adding the crossover and mutation operator of GA into TLBO algorithm. GA performs better in exploration mode and has good convergence rate. So, we proposed a TLGO technique by combining GA with TLBO.
Initially, TLGO has same steps as the step of TLBO. First two phases of TLBO i.e., teacher phase and learner phase are added to TLGO technique without any modification. In teacher phase, the mean of every learner is calculated and the candidate having best mean value is selected a teacher. Then the algorithm shifts the mean of learners to the teacher using Equation (11) and new learners are added to the population to get a new population of improved learners. In learner phase, every learner interacts with each other to improve its knowledge. For each learner , another learner is randomly selected and the population is updated using Equation (13). One the population is updated in teacher and learner phase, tournament based selection method is applied to selects two parents for reproduction. The selected parents reproduces new offspring by performing the crossover operation. The reproduced offspring are added to the existing population and the fitness of population is evaluated. Mutation step is applied to randomly invert a bit of selected candidate and population is updated once mutation is performed. Then the fitness of population is calculated based on Equation (10). The process continues, until termination criteria is met.
The TLGO technique takes an advantage of both exploration and exploitation mode and maintains a balance between local and global search by applying crossover and mutation operator of GA to TLBO. Proposed technique has better convergence rate with less computational efforts, in terms of finding an optimal solution. Algorithm 3 shows the working of our proposed TLGO technique.
Algorithm 3: TLGO Algorithm |
|