Next Article in Journal
Economic Development Based on a Mathematical Model: An Optimal Solution Method for the Fuel Supply of International Road Transport Activity
Previous Article in Journal
An IoT-Based Smart Building Solution for Indoor Environment Management and Occupants Prediction
Previous Article in Special Issue
A Finite Mixture GARCH Approach with EM Algorithm for Energy Forecasting Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Power Distribution Optimization Based on Demand Respond with Improved Multi-Objective Algorithm in Power System Planning

Department of Electrical and Computer Engineering, School of Engineering and Digital Sciences, Nazarbayev University, Kabanbay Batyr Ave. 53, Nur-Sultan 010000, Kazakhstan
*
Author to whom correspondence should be addressed.
Energies 2021, 14(10), 2961; https://doi.org/10.3390/en14102961
Submission received: 11 April 2021 / Revised: 16 May 2021 / Accepted: 17 May 2021 / Published: 20 May 2021
(This article belongs to the Special Issue Forecasting and Planning in Power Systems)

Abstract

:
In this article, a novel dynamic economic load dispatch with emission based on a multi-objective model (MODEED) considering demand side management (DSM) is presented. Moreover, the investigation and evaluation of impacts of DSM for the next day are considered. In other words, the aim of economical load dispatch is the suitable and optimized planning for all power units considering different linear and non-linear constrains for power system and generators. In this model, different constrains such as losses of transformation network, impacts of valve-point, ramp-up and ramp-down, the balance of production and demand, the prohibited areas, and the limitations of production are considered as an optimization problem. The proposed model is solved by a novel modified multi-objective artificial bee colony algorithm (MOABC). In order to analyze the effects of DSM on the supply side, the proposed MODEED is evaluated on different scenarios with or without DSM. Indeed, the proposed MOABC algorithm tries to find an optimal solution for the existence function by assistance of crowding distance and Pareto theory. Crowding distance is a suitable criterion to estimate Pareto solutions. The proposed model is carried out on a six-unit test system, and the obtained numerical analyses are compared with the obtained results of other optimization methods. The obtained results of simulations that have been provided in the last section demonstrate the higher efficiency of the proposed optimization algorithm based on Pareto criterion. The main benefits of this algorithm are its fast convergence and searching based on circle movement. In addition, it is obvious from the obtained results that the proposed MODEED with DSM can present benefits for all consumers and generation companies.

1. Introduction

Electrical energy has particular downsides such as high cost, being time consuming, etc., and it is gradually is being replaced by other energies as a result. In recent years, many causes such as increasing electricity generation cost, the uncertainty growth of load consumption, the global increase of fuel cost, restrictions in the environment, determining the place of powerhouses, etc., have drawn important attention toward the logical growth of electricity consumption [1].
Therefore, the demand side management (DSM) of electricity consumption in recent years is considered one of the best and vital methods of maintaining common profits between the electricity industry and electrical energy consumers. DSM as a fundamental subject tries to change load consumption at peak-time to the form of long-term in dedicating resources regarding its numerous profits for both sides of the electricity industry and consumers [2,3]. Hereby, the power markets have paid significant attention to the programs of DSM due to their benefits in financial and load profile [4]. DSM not only helps the electricity industry and consumers, furthermore, it has effective benefits for generation companies. The implementation of DSM in electricity networks requires updated information and technologies. These technologies make a two-way connection between the electricity’s suppliers and consumers. Therefore, the smart controlling and the measuring tools of central energy are used for their dynamic interaction. Dynamic bidding policies include time of use (ToU), division of the critical peak time, on-time bidding, the least off-peak time, and bidding for the next days of smart bidding tools in the process of DSM implementation [5,6,7,8]. According to recent papers, three types of DSM commonly are used: environmental, network, and market. DSM with the environmental option commonly concentrates the standards on environmental and social areas such as decrease of greenhouse gasses’ emissions. DSM by using the network option aims to maintain the certainty of the network, and the aim of DSM is to trigger the financial frugality of public facilities and consumers [9]. The overall view of the suggested demand side management (DSM) is shown in Figure 1.
In [10], a new integrated method of multi-objective dynamic economic and emission dispatch (MODEED) is presented by implementing demand side management (DSM) in order to consider the advantages of presented DSM on the group side. The presented method investigated the upcoming day on the basis of load changing and the DSM method.
In [11], the authors implemented genetic algorithm to solve the problem of DSM and dynamic economic dispatch (DED). The authors had deliberated the issues of DSM and DED in two interrelated levels during the optimization procedure. In fact, it had used load profile for each individual consumer. Thus, they used Genetic Algorithm (GA) in order to find out the enhanced problem to introduce electrical tools for consumers.
Lorenthiran et al. [12] implemented the DSM technique of load profile based on the next day in the environment of smart network with the assistance of a discovering algorithm. The energy control strategy is developed for load demand management at peak times [13]. Another algorithm for energy management is suggested by Ma et al. [14] to access the bidding strategies and consumers’ functional states. Dynamic emission and economical dispatch (DEED) are considered in the operation and control of an electricity network. The DEED in online production presents the predicted load demand period, which is done by minimizing the cost and emission simultaneously. Altinoz et al. [15] investigated a type of financial or emission load model based on the transmitting issue. The suggested model considered non-synchronous and reserved producers to varied demanding zones, which it contradicted with previous transmitting issues. Among them, only a few of the producers are considered for the demanding zones. Consequently, during the process, each producer has an effect over the other producers. In addition, the suggested model is enhanced by generated energy that could be purchased by other close locals. From the point that most of the dimensions, restrictions, and aims are presented within the provided model, it declines the frequency of aims. Alham et al. [16] recommended a novel DEED with wind power regarding the feature of intermittency and ambiguity. They used an energy storage system (ESS) and DSM in order to investigate the effect of charge, discharge, and the use of wind power.
In order to solve the EED, the GAMS software was used. The obtained results demonstrated the significance of applying ESS and DSM in declining the charge and discharge rate and raising the wind power consumption. Dehnavi et al. [17] evaluated TOU on the demand side by combining the problem of DED, which considers the supplier side. Zaman et al. [18] combined an algorithm of DE and GA for solving the issues of DEED by considering different generator units such as thermal, solar–thermal, and wind. The problem of DEED based on the developed PSO and wind’s uncertainty is presented by Aghaei et al. [19].
In [20], new combined framework-based electric vehicles and wind farms are suggested for solving the dynamic economic emission dispatch problem. In [21], the authors presented the combination of renewable energy sources to a multi-objective DEED problem in a day through minimizing the energy cost and emission as well. In [22], the DEED problem is solved as a non-linear and complex objective based on a combined Flower Pollination Algorithm (FPA) with Sequential Quadratic Programming (SQP) algorithm. The authors in [23] provide MODEED for renewable anergy sources i.e., wind–solar–hydro power under tradable green certificates.
To cover the gap of economic load dispatch with demand side management, this article suggests a method of MODEED and DSM program based on next day for residential loads. In this suggested model, we had considered the benefit of consumers by presenting different time delays for all manageable demand with related lifestyle. The suggested model significantly focused on advantages of DSM programs in order to accommodate the supplier side with different residential load levels. In addition, in this paper, an enhanced multi-objective artificial bee colony (MOABC) based on entropy, arrangement, and fuzzy selection is proposed to minimize the MODEED simultaneously with DSM.
The rest of this paper is organized as follows. Section 2 explains the formulation of the DEED problem and DSM. The suggested integrated method is presented in Section 3. Section 4 presented the suggested improved multi-objective artificial bee colony algorithm. In Section 5, some different test systems are presented. The numerical analysis and their comparisons are presented in Section 6. At the last section, the conclusion is presented.

2. The Problem Formulation

2.1. Proposed Multi-Objective Problem

This multi-objective problem is the vital optimization challenge in the electricity network operation and control for enhancing social and economic dimensions. In the DEED problem, the total fuel cost and emission cost should be minimized simultaneously [24]:
F 1 = t = 1 τ g = 1 G C g , t ( P g , t )
F 2 = t = 1 τ g = 1 G E g , t ( P g , t ) .
F1 and F2 are the total costs of fuel and the emission of the gth generator unit at time τ . C g , t and E g , t   are the price and pollution functions through time t and Pg,t is the output of the gth generator at unit time t. The fuel cost function is modeled by the effect of the valve point, and the total rate of gases such as NOx and SOx are modeled as the sum of quadratic expressions:
C g , t ( P g , t ) = a g P g , t 2 + b g P g , t + c g + | e g s i n ( e g ( P g m i n P g , t ) ) |
E g , t ( P g , t ) = ( γ g P g , t 2 + β g P g , t + α g ) + ξ g e x p ( λ g P g , t )
where cg, bg, and ag are the of fuel cost coefficients of the gth generator unit and eg and dg are the valve point effect coefficients. γ g , β g , α g , and λ g are emission coefficients of the gth generator unit.

2.2. Constrains

The problem of DEED optimization has different equality and inequality constrains as follows:
(i)
Power balance
g = 1 G P g , t P D , t P L , t = 0 ,   t { 1 , 2 , , τ }
PL,t and PD,t are the transmission power loss and total load demand power in the tth time, respectively. PL,t could be calculated by:
g = 1 G j = 1 G P g , t B ( g , j ) P j , t
where B(g,j) denotes the coefficient of transmission power loss. Pg,t and Pj,t are the real electricity outputs of the gth and jth generator unit at the tth time, respectively.
(ii)
Generation boundary
This inequality constrain can be modeled by:
P g m i n P g , t P g m a x , g { 1 , 2 , , G }
where P g m a x and P g m i n describe the lower and higher values for power output in the gth generator unit.
(iii)
Ramp-up and Ramp-down
This inequality constrain can be modeled by:
P g , t P g , t 1 U R g , g { 1 , 2 , , G }
P g , t 1 P g , t D R g , g { 1 , 2 , , G } .  
Therefore, the above equations can be rewritten as:
m a x ( P g m i n , P g , t 1 D R g ) P g , t m i n ( P g m a x , P g , t 1 + U R g )
where URg and DRg are the upper and lower ramp bound rates of the gth of generation unit. They show that increasing or decreasing the output powers for thermal production units is a time-consuming action.

2.3. Problem of Demand Side Management

The strategies of DSM mostly are needed for public facilities in order to grow their economics and develop a demand shape. Typically, companies of public industry have interesting DSM methods for encouraging the higher incorporation of consumers. Therefore, the public industry companies could easily succeed in reaching their aims. According to recent papers that address the DSM problem, the clipping of peak, filling the path, load shifting, strategic consideration, growth of strategic demand, and supple load curve are considered as the six main approaches [7]. The first three approaches are basic levels and the others are innovative methods that monitor the total load curve by either limiting or extending.
The load shifting method is the sum of two restricting peak and filling path methods, and it is considered the best method among the all demand management approaches. The demand-shifting model could be applied by controllable demands in the user side. In this mode, the controllable demands shift from peak time to off-peak, excluding any change in consuming power. The six methods of DSM are illustrated in Figure 2.
The DSM technique of load shifting based on the next day is used in this paper in order to investigate its impacts on the production side. This paper considers minimizing the bill of public energy as a basic aim for implementing DSM. Therefore, the prediction curve of load demand is estimated based on previous data. Consequently, the price signal is dedicated for each unique load, and the public company creates an aim load shape that is contrary with separate values. During the previous day, the DSM central controller receives an aim load shape as an input and computes the controlling measurements of ideal demand consumptions. Regarding the obtained results, the controlling measurements were conducted in ON time periods. During ON time operations, when the consumer sends the request connection of a device via bottom ON over the domestic devices, DSM controls or permits the attachment or provides another attachment time. The total ON time procedure is conducted efficiently by using mutual information and connection technologies. The total sell price of the electricity market of each individual break is dedicated by the ToU tariff approach, which is one of the methods of pricing tools. In the ToU tariff model, the pricing of the critical peak and lower price for off-peak periods are evaluated. According to theses pricing tools, DSM members want to place their plans in off-peak periods. The DSM can be controlled by electricity consumption patterns. In this paper, the aim of DSM with the suggested algorithm is discovering an optimized solution.

3. Utility Energy Modeling of DSM

The critical purpose of public industry power bill function is decreasing the space of the predicted load demand curves and aimed load demand trend through the controllable loads. The proposed function is formulated as follows:
m i n F = t = 1 τ ( ψ ( t ) ξ ( t ) ) 2
where ξ ( t ) and ψ ( t ) are the quantities of aimed load demands and the load after timing DSM at period t. τ denotes the numbers of existence total time in load demand profile in a day. The suggested flowchart is demonstrated in Figure 3.
According to above equation, the ψ ( t ) can be computed as follows:
ψ ( t ) = F L ( t ) + C L ( t ) D L ( t )
where FL(t) is the quantity of the predicted load at period t, CL(t) and DL(t) are the quantities of attached load demands and shut-off during demand shifting at period t. It is calculated as follows:
C L ( t ) = i = 1 t 1 l = 1 N X l i t · P 1 l + j = 1 t 2 k = j + 1 t 1 l = 1 N P ( t k + 1 ) l .
X l i t is the amount of l manageable domestic devices that is changed from i to t time, N is the total type of controllable domestic devices, P 1 l   and   P ( t k + 1 ) l are the electricity load consumption due to the change device of l type and time steps (tk + 1). Here, the (tk + 1) is the time step of electricity consumption with device type 1 in t time, which is changed from j to k.
D L ( t ) = q = t + 1 t + m l = 1 N X l t q · P 1 l + j = 1 t 1 k = j + 1 j + m l = 1 N P ( t j + 1 ) l
where X l t q is the number of controllable domestic devices from type 1 that had changed from t time to q period and in addition, the delayed maximized steps of m have the ability to manage the controllable domestic devices. For the load-shifting process, the following constrains should be considered for load management:
X l i t > 0   ,     l , i , t
t = 1 r X l i t C t r d ( i )
where the Ctrd (i) is the total number of controllable domestic devices from type 1 in time t. The other overall conditions are provided as follows:
P ( t k + 1 ) l = 0     ,     ( t k + 1 ) > D
X l i t = 0   ,     i > t .
X l i t = 0   ,     ( t i ) > m
where D depicts the whole time period. Equation (18) presents that the DSM approach only has the delayed feature and it is not of advanced type. Equation (19) is the indicator of maximized m delayed for all domestic devices. In this paper, we had provided solutions to the multi-objective optimization model with the non-dominated sort and fuzzy tools. At this point, a linear membership function ui,k (kth objective function, ith solution) is proposed for each of the objective functions Fi as follows:
u i , k = { F k max F i , k F k max F k min , F k max > F i , k > F k min 1 ,       F k min F i , k 0 ,       F i max F i , k
u i = i = 1 o u i , k k = 1 s i = 1 o u i , k
where O and S denote the number of objective functions and non-dominated solutions, respectively. Fmink and Fmaxk are the minimum and maximum of Fk(X) of the kth objective function, while u is the quantity of the kth objective function. The maximized quantity of u makes a decision about the ultimate solution of the multi-objective problem.

4. Improved Multi-Objective Artificial Bee Colony Algorithm

The artificial bee colony (ABC) has been proposed by Mr. Karaboka [25]. To improve the classic version of ABC, a chaotic version of this model is considered in this paper. The ergodicity and randomness specifications of chaos can understand a local deep search. An optimal local optimized ability is provided by looking for the space near superior individuals. The concept of a chaotic system can strengthen the local search ability. The restrictions of this region are determined by system parameters. Based on other features of chaos systems, they are looking at a particular area of primary conditions. In this paper, the mentioned improvement is presented by the following steps. First, the riotous coefficient appropriate with the determined region and the number of variables are generated. Then, the chaotic variables of the next iteration are calculated and then converted into decision variables. Finally, if the new results are better than the initial one/reach max iteration, they replace it as the final answer; otherwise, go to step 2. This paper had used the features of a riotous system to find ideal weights. The logistic function is a non-linear function and has one control parameter:
x ( k + 1 ) = A x ( k ) ( 1   x ( k ) )
where x(k) shows the system condition and A is a constant value. This function intensively depends on the parameter A. By changing A, this function shows behaviors such as (from periodic). By putting A = 4 in the equation, the logistic function shows chaos behavior. From the point of formulation, the riotous coefficient appropriate with a determined region and the number of variables (Ng) are:
X c l s 0 = [ X c l s , 0 1 , X c l s , 0 2 , , X c l s , 0 N g ] 1 × N g c x 0 = [ c x 0 1 , c x 0 2 , , c x 0 N g ] , c x 0 j = X c l s , 0 j X j , min X j , max X j , min , j = 1 , 2 , , N g .
So, we achieve:
X c l s i = [ X c l s , i 1 , X c l s , i 2 , , X c l s , i N g ] 1 × N g , i = 1 , 2 , , N c h a o s x c l s , i j = c x i 1 j ( X j , max X j , min ) + X j , min , j = 1 , 2 , , N g .
where X c l s 0 is the obtained primary place for the chaos variable. Xj,min and Xj,max are the lower and upper values of the chaos variable. Nchaos is the number of chaos variables, respectively. On the other hand, the study and investigations of artificial bee colony show that while the particles are leading by gbest, they will have better total searching. In the artificial bee colony algorithm, the investigation is done on the basis of worker bees, and it is not utilized from the obtained best solution in each stage. Based on this principle, the standard equation of bee colony algorithm (25) is changed to Equation (26):
ν i j = x i j + ϕ i j ( x i j x k , j )
ν i j = x i j + ϕ i j ( x i j x k , j ) + λ i j ( g b e s t i x i j )
where ϕ i j and λ i j are the random numbers between (−1,1). In comparison to the other optimization methods, the proposed methods have the following significant benefits:
  • Unlike other traditional methods, this method does not need differentiation.
  • Less sensitivity to the nature of the objective function means that it has convexity and continuity.
  • Unlike other methods, it needs less adjustment of parameters.
  • Has the ability to escape from local solutions.
  • It is easily implemented and planned with other mathematical and logical operations.
  • For objective function with random nature, it could be applied.
The proposed algorithm can be followed in the below steps:
  • Generate the initial solutions Xij
  • Compute the initial solutions in objective function
  • Initial iteration circle =1
  • Supply new solutions based on Equation (26)
  • Select the best resource or best answer between Xij and Vij
  • Calculate the possibility rate for Xij solutions based on:
P i = f i t i i = 1 S N f i t i .
Indeed, to achieve appropriate solutions, one gets:
f i t i = { 1 1 + f i , f i 0 1 + | f i | , f i < 0   .
The solutions of Pi are between (−1, 1).
7.
Generate new solutions Vi based on ABC operator from solutions Xi and determine their possibility rate Pi.
8.
Select the best solutions between the answers of Xij and Vij.
9.
Determine the distorted resources and substitute the random resources with created random resources by scout bee Xi by:
x ij = min j + r a n d ( 0 , 1 ) × ( max j min j ) .
10.
Save the best solution (the most qualified resource) that is obtained in this stage.
11.
Cycle = cycle + 1.
12.
Repeat the previous stages until arriving at the stop criterion.
For modeling the suggested method, let X be an n-dimension key of the search space through the decision-making vector X = x 1 , x 2 , x 3 , , x n and X* be the optimized result of the fitness f ( x ) = [ f 1 ( x ) , f 2 ( x ) , f k ( x ) ] for which the non-linear condition of g i ( x ) 0 , i = 1 , 2 , , m and the P linear provision of h i ( x ) = 0 , i = 1 , 2 , , p are set. In the procedure of the suggested approach, all functions based on Pareto criteria are connected together. It can be noted that the problem of optimization could be converted to a maximized problem of optimization and vice versa:
min   Obj ( X ) = { obj 1 ( X ) , obj 2 ( X ) , , obj M ( X ) } X = x 1 , x 2 , , x D R D s . t . { g i ( X ) 0 , i = 1 , 2 , , k h j ( X ) = 0 , j = 1 , 2 , , l
Essentially, the above formula could be answered in two methods. One is the combination of fitness as one objective function. Therefore, the objective functions with appropriate and precise weight coefficients should be integrated together. The improved method of this article or the 2nd approach are based on sets of optimized Pareto. Assume that the C is a probable region answer (sets of results of x X that cover all linear and non-linear provisions) and I = { 1 , 2 , , k } . The f x * C will be an optimized Pareto if x C is the i I f i ( x * ) = f i ( x ) or i I f i ( x * ) < f i ( x ) . U = u 1 , u 2 , u 3 , , u k and V = v 1 , v 2 , v 3 , , v k are the vectors in the considered functions and U will dominate for V if and only if the i I , u i v i and i I when Ui < Vi. The optimized Pareto (P*) is a set of possible solutions if P * = { x C |   x C ,   f (   x   ) f ( x ) } . In this work, the PF = { f ( x ) | x P * } as a Pareto front. The dominant count in a set of answers is equivalent to the numbers of solutions in the whole population that are dominant. The initial non-dominated front is equivalent to the sets of solutions whose domination count equals 0. The 2nd non-dominated front is the sets of results whose dominant count equals zero and whose 1st non-dominated front is uncountable. Meanwhile, the total ith of the non-dominant front ψ i is a set of solutions whose dominant count equals zero when the solutions are uncountable in front ψ 1 , ψ 2 , , ψ i 1 . Now, all the obtained solutions throughout the 1st front include the non-dominant front value 1. Naturally, the solutions throughout the second front consist of non-dominant value 2. The mutuality approach is evaluated in guarantee the discovery of optimized solutions. In the method, the quantity of evaluated suitability for every aim function in level 1 is shared. Then, this quantity of suitability that is the little shared quantity in past functions is signed as a next Pareto front. Similarly, the method of sharing is done for the second level. Overall, this strategy will be continued until the quantity of suitability is joint in all levels. The possible equation for the shared approach (Share (dij)) is defined as follows:
Share ( d i j ) = { 1 ( d i j μ s h a r e ) 2 , i f   d i j < μ s h a r e 0 , o t h e r w i s e
d i j = a = 1 P 1 ( x s i x s j x s max x s min ) 2
where p1 is the number of decisions made, xs is the quantity of the sth decision-making variable, and i and j are counters. µshare is the highest acceptable distance between two variables, and its signing as the member niche indicates that this counter could be computed for the total (N) population as follows:
N i c h e c o u n t i = j = 1 N Share ( d i j ) .
Additionally, to enhance the convergence procedure between the non-dominated sets, the crowding distance is evaluated for evaluating the set of results [26]. This method is based on the computation of average distance, and an appropriate estimation of the density rate of better results between populations is achieved. In other words, this technique leads to the concentration of Pareto solutions. The entropy distribution for the ith objective function could be expressed as follows:
E i j = [ p l i j l o g 2 ( p l i j ) + p u i j l o g 2 ( p u i j ) ] p l i j = d l i j c i j , p u i j = d u i j c i j , c i j = d l i j + d u i j
where duij and dlij are the current solutions with determined upper and limited restrictions of the ith objective function. As expressed before, the optimized Pareto scale is the indicator that vector x C is not present, which could modify the optimized Pareto vector. The fuzzy logic is implemented as a strategy in order to evaluate the appropriate cluster of their non-linear ones. The fuzzy decision-making function, which is presented by the membership function, should be able to substitute the accurate quantity of parameters.

5. Simulation Test Systems

In this article, the six thermal units considered as the case study are considered in different scenarios. The fuel cost coefficient of a generator, emission coefficient, the bound of the ramp rate, the predicted load demand profile for 24, and other corresponding system data can be found in [27,28,29], and for the reader’s convenience, they are presented in Table 1 and Figure 4. As presented in this figure, the first unit production is higher than the other units. The matrix of transmission loss constant of the six studied system units is shown in Equation (35). In total, the demand of each network is a combination of domestic, commercial, and industrial demands. The residential area has several controllable domestic devices such as a dish washing machine, washing machine, kettle, oven, and other domestic devices that could be simply managed during the demand shifting approach in comparison with other industrial and commercials demands. Hence, only the demand shift technique of DSM based on the next day is implemented for residential loads. During the implementation process of DSM, four cooperating levels with 5%, 10%, 15%, and 20% of the whole habitable demand are evaluated. The electrical prices of the market are dedicated for total public facilities in each hour with the ToU tariff. In the mentioned test, the utilization of total controllable domestic devices is considered 2 kW, but their pattern of electricity consumption is different. In the mentioned model, the maximized late steps of every controllable device based on their consumption lifestyle are dedicated. For example, two or three maximized delayed steps for necessary devices such as a kettle, oven, and hair dryer are evaluated in this work. In same approach, 12 maximum of delayed steps for less necessary devices such as a cloth dryer, iron, and vacuum cleaner are considered.
B = ( 2.2 1.1 0.1 0.1 0.1 0.4 1.1 1.6 0 0.1 0 0.3 0.1 0.1 0.1 0.4 0 0.1 0 0.3 2.4 1 1 0.7 1 1.9 0.7 0.4 1 0.7 0.7 0.4 1.6 0 0 2.6 ) × 10 4       p e r   M W

6. The Results of Simulation and Discussion

In this article, the effects of DSM are studied over the public and production industry companies. The issue optimization of DSM and DEED is calculated in MATLAB software. In order to find the best answer, 30 different tests are conducted.

6.1. The Effects of DSM on the Public Facility Side

The main aim of this paper is analyzing the effects of DSM evaluation on the production side. Thus, the DSM is evaluated by minimization of the public electricity bill as the basic goal. Figure 5 presents the predicted load shape and the load curves after implementation of DSM with different levels of residential cooperation. It is obvious that an improved demand curve for higher cooperator levels is achieved. The public industry company has achieved interesting advantages, and this is because of the DSM evaluation that is presented in Figure 6a,b. By the obtained results of the DSM problem, the daily frugality of energy bills of the public industry company for participation levels are 5%, 10%, 15%, and 20% from those whole inhabitant demand are $363, $731, $1950, and $1457, respectively. Similarly, the peak load demand also for different levels of participation is 12.32, 24.32, 36.12, and 49.01 MW, respectively.
In order to analyze the DSM effects in production, three test vases by various participation levels of DSM are considered. In the first and second test cases, the problems of dynamic economical and emission dispatch are individually minimized by the DSM approach. Case 3 elaborates individually the suggested approach MODEED by the DSM model.

6.2. Case 1: DSM Bundled with Dynamic Economic Dispatch

The single dynamic economic dispatch is considered here as the first test case by considering the DSM effects over a fuel cell. For qualitative study, four different levels of participation are presented in DSM. In this approach, dynamic economic dispatch and DSM have been minimized simultaneity based on the suggested approach. The obtained numerical results are presented in Table 2 by including/excluding the DSM. Figure 7 demonstrates the convergence issues of DEED optimization including/excluding DSM. Results demonstrate the useful effects of DSM on electricity production through decreasing their fuel costs. In addition, it shows that the quantity of fuel production cost is minimized in different participation levels of DSM. For instance, DSM with the participation level of 20% has about a 7.5% drop in daily fuel cost in compared to the condition without DSM. Production companies can save a daily fuel cost equal to $91.5, and this frugality is the result of DSM implementation.

6.3. Case 2: DSM Bundled with Dynamic Emission Distribution

The single dynamic emission dispatch objective is considered in these test cases including the DSM. Obtained numerical analyses are presented in Table 3 by considering the dynamic emission distribution and including/excluding the DSM. Additionally, in this table, the proposed algorithm is compared with two other optimization models i.e., multi-objective genetic algorithm (NSGA) and multi-objective particle swarm optimization (MOPSO). Obtained results prove the validity and superiority of the proposed algorithm in minimum cost and emission as well. Figure 8 demonstrates the convergence features of dynamic emission dispatch including/excluding DSM. Regarding the obtained results, it is clear that there is a remarkable decrease in the emission level by implementation of DSM. For instance, in DSM, for the participation rate of 20%, there is a daily 0.077 ton drop in the emission level compared to excluding DSM, which means 0.038 $/day i.e., 15.981 − 15.943 = 0.038.

6.4. Case 3: DSM Bundled with Economical and Emission Dispatch

The DEED model by considering the DSM is considered in this test case through the MOABS algorithm. The obtained numerical analysis is presented in Figure 9 based on MODEED by considering various levels of DSM participation. In addition, Figure 10 shows the set of different Pareto values with different levels of DSM participation. The finest adaptive quantity of fuel cost and distribution using the fuzzy membership approach is found.
It is seen from the results that the proposed model has the ability to present the best solution compared to the single objective model for the similar participation level in DSM. For instance, the production companies could have saved a partial cost of daily fuel of 60.91%, 180%, and 256% for participation levels of 5%, 10%, 15%, and 20% of inhabitant demand, respectively. At this time, the production companies can decrease their sets of distribution levels. The decreases of distribution levels for different levels of participation are 0.032, 0.056, 0.074, and 0.121, respectively. The values of production units for timing programs of the proposed model in the participation level of DSM are achieved at 20% with or without DSM and are presented in Figure 11a,b.

6.5. Test Function for Multi-Objective Algorithm

This section presents a new test system to evaluate the proposed multi-objective ABC algorithm and compare its results with other well-known multi-objective optimization algorithms. Therefore, the ZDT2 test function issue is selected [29]:
min f 1 ( x ) = x 1 min f 2 ( x ) = g ( x ) ( 1 ( x 1 g ( x ) ) 2 ) g ( x ) = 1 + 9 n 1 i = 2 n x i 2 , x 1 [ 0 , 1 ] , x i [ 1 , 1 ] , i = 2 , 3 , , n
If n = 30, the problem of non-dominated Pareto front will be 219 in the regional Pareto front. To compare the proposed algorithm, consider two powerful MOPSO and NSGA-I algorithms with the same initial conditions such as the number of populations at 100 and a maximum iteration of 1000. The best Pareto distribution for the proposed MOABC is arrived after 350, while this number for NSGA-I is 650, and for MOPSO, it is about 1000 iterations. The final Pareto solutions are shown in Figure 12. Figure 12 shows that the superiority of scattering solution points (Pareto front) is achieved through the proposed algorithm compared to the NSGA and MOPSO models.

7. Conclusions

This paper combined the MODEED with the DSM model in order to use the advantages of DSM in the public and production industry side. During the process of DSM, the load shift technique based on the next day for controlling residential loads and minimizing the public facilities energy bill energy is considered. Considering the regular manner of consumers, all essential household devices are included. The objective functions of emission and power dispatch were minimized for a system with six thermal units. Four various levels of inhabitant participation for investigating the impacts of DSM in the production side were considered. The multi-objective method is utilized for minimizing the MODEED based on a non-dominated arrangement. The simulation results demonstrated that the proposed model has the ability to present benefits for public companies and the production side. Furthermore, it is observed that the benefits of a 20% participation level are high.

Author Contributions

O.A.: Conceptualization, methodology, software, validation, formal analysis, investigation, resources, data curation, writing—original draft preparation, M.B.: writing—review and editing, visualization, supervision, project administration, funding acquisition. Both authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by Collaborative Research Project (CRP) Grant of Nazarbayev University under grant no. 021220CRP0322, and in part by the Faculty Development Competitive Research Grant, Nazarbayev University, under grant no. 021220FD1251.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Coninx, K.; Deconinck, G.; Holvoet, T. Analysis of Activation Constraints and their Effect on Demand-Side Flexibility Allocations. In Proceedings of the 2018 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT-Europe), Institute of Electrical and Electronics Engineers (IEEE), Sarajevo, Bosnia and Herzegovina, 21–25 October 2018; pp. 1–5. [Google Scholar]
  2. Yilmaz, S.; Chambers, J.; Patel, M. Comparison of clustering approaches for domestic electricity load profile characterisation Implications for demand side management. Energy 2019, 180, 665–677. [Google Scholar] [CrossRef]
  3. De Craemer, K.; Vandael, S.; Claessens, B.; Deconinck, G. An Event-Driven Dual Coordination Mechanism for Demand Side Management of PHEVs. IEEE Trans. Smart Grid 2013, 5, 751–760. [Google Scholar] [CrossRef]
  4. Sobhani, S.O.; Sheykhha, S.; Azimi, M.R.; Madlener, R. Two-Level Distributed Demand-Side Management Using the Smart Energy Hub Concept. Energy Procedia 2019, 158, 3052–3063. [Google Scholar] [CrossRef]
  5. van de Meerssche, B.; van Ham, G.; van Hertem, D.; Deconinck, G. Balancing renewables by demand side man-agement: Local and global potential. Int. J. Distrib. Energy Resour. 2013, 9, 383–397. [Google Scholar]
  6. Tang, R.; Wang, S.; Li, H. Game theory based interactive demand side management responding to dynamic pricing in price-based demand response of smart grids. Appl. Energy 2019, 250, 118–130. [Google Scholar] [CrossRef]
  7. Essiet, I.; Sun, Y.; Wang, Z. Scavenging differential evolution algorithm for smart grid demand side management. Procedia Manuf. 2019, 35, 595–600. [Google Scholar] [CrossRef]
  8. Kuiken, D.; Más, H.F. Integrating demand side management into EU electricity distribution system operation: A Dutch ex-ample. Energy Policy 2019, 129, 153–160. [Google Scholar] [CrossRef]
  9. Craparo, E.; Sprague, J. Integrated supply- and demand-side energy management for expeditionary environmental control. Appl. Energy 2019, 233–234, 352–366. [Google Scholar] [CrossRef]
  10. Lokeshgupta, B.; Sivasubramani, S. Multi-objective dynamic economic and emission dispatch with demand side management. Int. J. Electr. Power Energy Syst. 2018, 97, 334–343. [Google Scholar] [CrossRef]
  11. Mellouk, L.; Boulmalf, M.; Aaroud, A.; Zine-Dine, K.; Benhaddou, D. Genetic Algorithm to Solve Demand Side Management and Economic Dispatch Problem. Procedia Comput. Sci. 2018, 130, 611–618. [Google Scholar] [CrossRef]
  12. Logenthiran, T.; Srinivasan, D.; Shun, T.Z. Demand Side Management in Smart Grid Using Heuristic Optimization. IEEE Trans. Smart Grid 2012, 3, 1244–1252. [Google Scholar] [CrossRef]
  13. Ma, K.; Hu, G.; Spanos, C.J. Distributed Energy Consumption Control via Real-Time Pricing Feedback in Smart Grid. IEEE Trans. Control. Syst. Technol. 2014, 22, 1907–1914. [Google Scholar] [CrossRef] [Green Version]
  14. Ma, K.; Hu, G.; Spanos, C.J. Energy Management Considering Load Operations and Forecast Errors with Application to HVAC Systems. IEEE Trans. Smart Grid 2018, 9, 605–614. [Google Scholar] [CrossRef]
  15. Altinoz, O.T. The distributed many-objective economic/emission load dispatch benchmark problem. Swarm Evol. Comput. 2019, 49, 102–113. [Google Scholar] [CrossRef]
  16. Alham, M.; Elshahed, M.; Ibrahim, D.; Zahab, E.E.D.A.E. A dynamic economic emission dispatch considering wind power uncertainty incorporating energy storage system and demand side management. Renew. Energy 2016, 96, 800–811. [Google Scholar] [CrossRef]
  17. Dehnavi, E.; Abdi, H. Optimal pricing in time of use demand response by integrating with dynamic economic dispatch problem. Energy 2016, 109, 1086–1094. [Google Scholar] [CrossRef]
  18. Zaman, F.; Elsayed, S.M.; Ray, T.; Sarker, R.A. Configuring two-algorithm-based evolutionary approach for solving dynamic economic dispatch problems. Eng. Appl. Artif. Intell. 2016, 53, 105–125. [Google Scholar] [CrossRef]
  19. Aghaei, J.; Niknam, T.; Azizipanah-Abarghooee, R.; Arroyo, J.M. Scenario-based dynamic economic emission dispatch con-sidering load and wind power uncertainties. Int. J. Electr. Power Energy Syst. 2013, 47, 351–367. [Google Scholar] [CrossRef]
  20. Qiao, B.; Liu, J. Multi-objective dynamic economic emission dispatch based on electric vehicles and wind power integrated system using differential evolution algorithm. Renew. Energy 2020, 154, 316–336. [Google Scholar] [CrossRef]
  21. Zou, Y.; Zhao, J.; Ding, D.; Miao, F.; Sobhani, B. Solving dynamic economic and emission dispatch in power system integrated electric vehicle and wind turbine using multi-objective virus colony search algorithm. Sustain. Cities Soc. 2021, 67, 102722. [Google Scholar] [CrossRef]
  22. Gul, R.N.; Ahmad, A.; Fayyaz, S.; Sattar, M.K.; Haq, S.S.U. A Hybrid Flower Pollination Algorithm with Sequential Quadratic Programming Technique for Solving Dynamic Combined Economic Emission Dispatch Problem. Mehran Univ. Res. J. Eng. Technol. 2021, 40, 371–382. [Google Scholar] [CrossRef]
  23. Li, X.; Wang, W.; Wang, H.; Wu, J.; Fan, X.; Xu, Q. Dynamic environmental economic dispatch of hybrid renewable energy systems based on tradable green certificates. Energy 2020, 193, 116699. [Google Scholar] [CrossRef]
  24. Kaboli, A.; Abdullah, S.H.; Alqallaf, K. Solving non-convex economic load dispatch problem via artificial cooperative search algorithm. Expert Syst. Appl. 2019, 128, 14–27. [Google Scholar] [CrossRef]
  25. Armaghani, S.; Amjady, N.; Abedinia, O. Security constrained multi-period optimal power flow by a new enhanced artificial bee colony. Appl. Soft Comput. 2015, 37, 382–395. [Google Scholar] [CrossRef]
  26. Abedinia, O.; Wyns, B.; Ghasemi, A. Robust fuzzy PSS design using ABC. In Proceedings of the 2011 10th International Conference on Environment and Electrical Engineering, Institute of Electrical and Electronics Engineers (IEEE), Rome, Italy, 8–11 May 2011; pp. 1–4. [Google Scholar]
  27. Niknam, T.; Narimani, M.; Aghaei, J.; Azizipanah-Abarghooee, R. Improved particle swarm optimisation for multi-objective optimal power flow considering the cost, loss, emission and voltage stability index. IET Gener. Transm. Distrib. 2012, 6, 515. [Google Scholar] [CrossRef]
  28. Simon, S.; Padhy, N.; Anand, R. Ant colony system based unit commitment problem with Gaussian load distribution. In Proceedings of the 2006 IEEE Power Engineering Society General Meeting, Montreal, QC, Canada, 16 October 2006; Volume 8. [Google Scholar] [CrossRef]
  29. Niknam, T.; Narimani, M.R.; Abarghooee, R.A. A new hybrid algorithm for optimal power flow considering pro-hibited zones and valve point effect. Energy Convers Manag. 2012, 58, 197–206. [Google Scholar] [CrossRef]
Figure 1. Suggested demand side management (DSM) of this article.
Figure 1. Suggested demand side management (DSM) of this article.
Energies 14 02961 g001
Figure 2. Overall view of DSM methods.
Figure 2. Overall view of DSM methods.
Energies 14 02961 g002
Figure 3. Simplified flowchart of compound DSM and MODEED models.
Figure 3. Simplified flowchart of compound DSM and MODEED models.
Energies 14 02961 g003
Figure 4. The load demand profile of 24 h from six test system units.
Figure 4. The load demand profile of 24 h from six test system units.
Energies 14 02961 g004
Figure 5. The curves of demand after DSM evaluation by various participation levels.
Figure 5. The curves of demand after DSM evaluation by various participation levels.
Energies 14 02961 g005
Figure 6. Frugality of public industry energy bill (a) and decline of peak load (b) by various levels of DSM participation.
Figure 6. Frugality of public industry energy bill (a) and decline of peak load (b) by various levels of DSM participation.
Energies 14 02961 g006
Figure 7. The convergence features of dynamic economic dispatch by various participation levels of DSM.
Figure 7. The convergence features of dynamic economic dispatch by various participation levels of DSM.
Energies 14 02961 g007
Figure 8. The convergence features of dynamic emission dispatch by different levels of DSM participation.
Figure 8. The convergence features of dynamic emission dispatch by different levels of DSM participation.
Energies 14 02961 g008
Figure 9. Dynamic economic and emission dispatch by various levels of DSM participation.
Figure 9. Dynamic economic and emission dispatch by various levels of DSM participation.
Energies 14 02961 g009
Figure 10. The sets of Pareto MODEED issues by various levels off DSM participation.
Figure 10. The sets of Pareto MODEED issues by various levels off DSM participation.
Energies 14 02961 g010
Figure 11. The output of optimized electricity of 24 h of generators, (a) in the present of DSM and (b) in the absence of DSM.
Figure 11. The output of optimized electricity of 24 h of generators, (a) in the present of DSM and (b) in the absence of DSM.
Energies 14 02961 g011
Figure 12. Pareto front of reformed ZDT2 issue by two aim functions.
Figure 12. Pareto front of reformed ZDT2 issue by two aim functions.
Energies 14 02961 g012
Table 1. The cost data of six thermal production units and their emission coefficients.
Table 1. The cost data of six thermal production units and their emission coefficients.
Thermal UnitesPower LimitsFuel Cost CoefficientsEmission CoefficientsRamp Rate Limits
Pmin (MW)Pmax (MW)agbgcgdgegγgβgαgξgλgURg (MW/h)DRg (MW/h)
Unit 1502000.0037520180.0370.0649−0.055540.040910.00022.8575050
Unit 220800.01751.750160.0380.05638−0.060470.025430.00053.3331616
Unit 315500.062510140.0400.04586−0.050940.042580.00000181010
Unit 410350.008343.250120.0450.0338−0.03550.053260.002277
Unit 510300.02530130.0420.04586−0.050940.042580.000001866
Unit 612400.0253013.50.0410.05151−0.055550.061310.0000016.66788
Table 2. Dynamic economical dispatch with various participation levels of DSM.
Table 2. Dynamic economical dispatch with various participation levels of DSM.
Participation LevelWithout DSMDSM with 5%DSM with 10%DSM with 15%DSM with 20%
Fuel cost ($/day)13.55413.51313.46913.45613.413
Emission (tons/day)7.5007.3437.3017.2867.284
Table 3. Dynamic emission distribution by various levels of DSM participation.
Table 3. Dynamic emission distribution by various levels of DSM participation.
Participation LevelMethodWithout DSMDSM with 5%DSM with 10%DSM with 15%DSM with 20%
Fuel cost ($/day)NSGA17.5317.5617.6517.7518.53
Emission (tons/day)6.7846.7536.6896.6246.124
Fuel cost ($/day)MOPSO17.0317.0417.2317.2817.35
Emission (tons/day)6.2416.2116.1656.0216.001
Fuel cost ($/day)Proposed15.94315.96215.97615.99115.981
Emission (tons/day)4.9364.9114.8794.8814.859
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Abedinia, O.; Bagheri, M. Power Distribution Optimization Based on Demand Respond with Improved Multi-Objective Algorithm in Power System Planning. Energies 2021, 14, 2961. https://doi.org/10.3390/en14102961

AMA Style

Abedinia O, Bagheri M. Power Distribution Optimization Based on Demand Respond with Improved Multi-Objective Algorithm in Power System Planning. Energies. 2021; 14(10):2961. https://doi.org/10.3390/en14102961

Chicago/Turabian Style

Abedinia, Oveis, and Mehdi Bagheri. 2021. "Power Distribution Optimization Based on Demand Respond with Improved Multi-Objective Algorithm in Power System Planning" Energies 14, no. 10: 2961. https://doi.org/10.3390/en14102961

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop