Next Article in Journal
Study on the Possibilities of Natural Use of Ash Granulate Obtained from the Combustion of Pellets from Plant Biomass
Previous Article in Journal
Global CO2 Emission-Related Geotechnical Engineering Hazards and the Mission for Sustainable Geotechnical Engineering
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hybrid Bio-Inspired Computational Heuristic Paradigm for Integrated Load Dispatch Problems Involving Stochastic Wind

1
Beijing Key Laboratory of Energy Safety and Clean Utilization, North China Electric Power University, Renewable Energy School, Beijing 102206, China
2
Department of Electrical and Computer Engineering, COMSATS University Islamabad, Attock Campus, Attock 43600, Pakistan
*
Author to whom correspondence should be addressed.
Energies 2019, 12(13), 2568; https://doi.org/10.3390/en12132568
Submission received: 24 May 2019 / Revised: 28 June 2019 / Accepted: 1 July 2019 / Published: 3 July 2019
(This article belongs to the Section A3: Wind, Wave and Tidal Energy)

Abstract

:
In this research work, bio-inspired computational heuristic algorithms (BCHAs) integrated with active-set algorithms (ASA) were designed to study integrated economics load dispatch problems with valve point effects involving stochastic wind power. These BCHAs are developed through variants of genetic algorithms based on a different set of routines for reproduction operators in order to make exploration and exploitation in the entire search space for finding the global optima, while the ASA is used for rapid local refinements of the results. The designed schemes are estimated on different load dispatch systems consisting of a combination of thermal generating units and wind power plants with and without valve point loading effects. The accuracy, convergence, robustness and complexity of the proposed schemes has been examined through comparative studies based on a sufficiently large number of independent trails and their statistical observations in terms of different performance indices.

1. Introduction

Economic load dispatch (ELD) is a fundamental issue in power plant systems, design and analysis with the aim of optimal scheduling of generated power in order to satisfy the load demand by least probable cost, while however, fulfilling the constraints on power generators [1,2,3]. Generally, the electricity generation cost with thermal power plants is excessively high and suitable planning is indeed needed to minimize the cost within reasonable levels. The ELD optimization problem is in one of the difficult constraints-based optimization systems in the power sector that usually needs excessive computations because of the nature of the cost functions and inherent non-smooth properties. A number of studies have introduced a variety of optimization procedures for ELD problems with and without valve point loading effect (VPLE) based on conventional and recently introduced meta-heuristics schemes, such as Newton methods [4,5], genetic algorithms [6], biogeography-based optimization algorithms [7], teaching learning based optimization methods [8], grey-wolf optimization algorithms [9], ant lion optimization procedures [10], modified krill herd algorithms [11,12], natural updated harmony searches [13], improved differential evolution [14], mine blast algorithms [15], and crow-search algorithms [16].
An additional aim in optimal load dispatch is to decrease or reduce the emissions that are dispersed due to the procedure of electricity generation. Normally, these environmental goals are conflicting with the economical nature of the systems, i.e., the decline in emission from generating units (GUs) results in the increased rate of electricity generation and vice versa. In such circumstances, multi-objective optimization techniques are exploited for combined ELD with emission problems, such as the symbiotic organisms search optimization method [17], simulated annealing algorithms [18], multi-objective evolutionary computing [19], multi-objective biogeography-based optimization [20], flower pollination algorithms [21], modulated particle swarm optimization [22] and chaotic bat algorithms [23].
The modern trend is to exploit the renewable energy assets for economical and unpolluted generation of electric power by incorporating the electricity generation scheme by use of wind power. The significant advantages of wind energy, besides the one-time initial cost of wind plants, are that there are no costs for production of power through wind, it is more environmentally friendly than thermal power plants and its ease in expendability i.e., installation of additional wind power generating units. There are some renewed applications of ELD involving wind energy, such as the binary artificial sheep method [24], integrated imperialist competitive with sequential quadratic programming [25], fuzzy adaptive artificial physics optimization [26], unit commitment problem involving wind power [27], multi-objective evolutionary algorithm [28] and group search optimizer with multiple producers [29]. All these existing procedures have their own competency, importance, applications and drawbacks in terms of precision, stability, and computing requirements. The research community has growing interest to design, explore and exploit modern stochastic solvers by using the strength of artificial intelligence procedures for applications in the diversified field of applied science and engineering, e.g., solution of stiff optimization problems arising in nanotechnology, nonlinear optics, astrophysics, atomic physics, plasma physics, electromagnetics, fluid mechanics, electric machines, piezoelectric systems, fractional order systems, bioinformatics, signal processing, controls, economic and finance [30,31,32,33,34] along with references therein. Additionally, there are many applications in which evolutionary computing paradigms are exploited through variants of genetic algorithms (GAs) based on different set of routines in the reproduction mechanism [35,36]. All of these are inspiring factors for authors to investigate in evolutionary stochastic paradigms for the solution of the emerging domain of energy and power sectors [37,38,39,40] including integrated power plant systems. As per our literature survey, evolutionary computing strategies based on variants of GAs have yet not been exploited in integrated power dispatch problems, therefore, the objective of the present study is to investigate integrated bio-inspired computational heuristic algorithms (BCHAs) based on the variants of GAs aid with the active-set algorithm (ASA) for optimization of load dispatch problems.
A brief summary of innovative contributions in terms of salient features of the proposed study are listed as:
  • Novel applications of bio-inspired computational heuristic paradigms integrated with ASA is presented for accurate, stable, robust and efficient optimization of ELD, ELD with VPLE (ELD-VPLE), ELD-VPLE involving stochastic wind (ELD-VPLE-SW) problems.
  • Global search strength of GAs and its variants is exploited for the design of BCHAs by using an appropriate set of routines for reproduction operators in order to make exploration of the entire search space supported with speedy local refinements with ASA.
  • The performance of the designed schemes is estimated on ELD, ELD-VPLE and ELD-VPLE-SW problems based on a combination of thermal and wind power generating units by means of accuracy, convergence and complexity operators based on the results of statistics for a sufficiently large number of independent trails.
  • The effective operation of BCHAs for integrated load dispatch scenarios, and other illustrative hallmarks for simplicity of the concept, coherent procedures with smooth implementation, robustness, expendability and stability.
The optimization procedure of BCHAs is described in Section 1; a brief overview of the system model of the integrated load dispatch system is presented in Section 2; the results with necessary interpretations are given in Section 3, while conclusions with future relevant studies are listed in Section 4.

2. Materials and Methods

2.1. System Model: Integrated Load Dispatch Problems

Three type of load dispatch problems are discussed in this study involving the no valve point loading effect (VPLE), with VPLE and VPLE involving stochastic wind power.
The fuel cost function for ELD with no VPLE: The total fuel cost of the power plant J1 is modelled in this case with the help of the quadratic cost function and, it is given mathematically as:
J 1 = i = 1 N g [ ( a i + b i P i + c i P i 2 ) ] ,
where Ng represents the total number of the power plants, ai, bi, as well as, ci denote the fuel charge coefficients of ith power plant, and Pi gives the current output power of the ith plant.
The fuel cost function for ELD involving VPLE: The total fuel cost of the power plant J1 is normally modelled with the help of the quadratic term based cost function, while the valve-point effect is similarly measured through adding of the sinusoidal term. The total fuel cost function is written as follows:
J 1 = i = 1 N g [ ( a i + b i P i + c i P i 2 ) + | e i . . sin ( f i ( P i . min P i ) ) | ] ,
The coefficient ei and fi denote the fuel charge for the valve-point effect for the ith power plant.
The fuel cost function for ELD with VPLE and stochastic wind power: There are numerous ways that describe the importance of the functioning and forecasting cost in the scheme comprising of both thermal generators, as well as, wind turbines. Subsequently, the instant wind speed is arbitrary at some specified time, therefore, the operator might overestimate or underestimate the wind power availability. The cost function for the wind power generator is given mathematically as: [25]
J 2 = j = 1 m [ W P C o s t d i r . j + W P C o s t o e . j + W P C o s t u e . j ] ,
where, WPCostdir,j represents the direct cost for the generation of wind power from the jth unit in MWh, WPCostoe,j denotes the overestimation cost for the jth wind generator in MWh and WPCostue,j is defined for the underestimation of the cost of jth wind turbine in MWh.
The WPCostdir,j is directly related to the output wind power and it is given as:
W P C o s t d i r = j = 1 m ( q j × w j )
where, qj and wj are the constant of direct electrical energy generation and real power generated by the jth wind generator in MWh, respectively.
Similarly, the WPCostoe,j can be presented as follows:
W P C o s t o e , j = j = 1 m ( C r w j × E ( Y o e , j ) )
Crwj denotes the charge constant for overestimation and underestimation of the jth wind generator in MW, while E(Yoe, j) is the expected value of wind power overestimation and underestimation for the jth wind generator.
The E(Yoe, j) is mathematically represented as follows: [25]
E ( Y o e , j ) = w j [ 1 exp ( v i n , j K j C j K j ) + exp ( v o u t , j K j C J K j ) ] + ( w r , j v i n , j v r , j v i n , j + w j ) [ exp ( v i n , j K j C j K j ) exp ( v 1 , j K j C j K j ) ] + ( w r , j C j v r , j v i n , j ) [ Γ ( 1 + 1 K j ( v 1 , j C j ) K j ) Γ ( 1 + 1 K j ( v i n , j C j ) K j ) ] ,
where, Kj and Cj are the shape and scale influence of Weibull distribution intended for the jth wind generator, respectively. The parameters, vr, vin and vout stand for wind speed, cut in and cut out speeds in m/s, respectively. An intermediate constant v1 is defined as v1 = vin + (vrvin)w1/wr. The wind turbine parameters wj and wr are representing the generated and rated power of the jth plant, respectively. Moreover, in (6), the symbol Γ with two parameters represent the incomplete gamma function as:
Γ ( x , a ) = 1 Γ ( a ) 0 x t a 1 e t d t ,
while, the symbol Γ with a single parameter represents the standard gamma function as:
Γ ( x ) = 0 x t x 1 e t d t
Similarly, WPCostue,j can be presented as follows:
W P C o s t u e , j = j = 1 m ( C p w j × E ( Y u e , j ) ) .
where, m denotes for number of wind generators, Cpwj defines the cost constant of underestimation for the jth wind generator in MWh and E(Yue, j) represents as the estimated charge of wind underestimation intended for the jth wind generator, while E(Yue, j) is provided mathematically as follows [25]:
E ( Y u e , j ) = ( w r , j w j ) [ exp ( v r , j K j C j K j ) exp ( v o u t , j K j C j K j ) ] + ( w r , j v i n , j v r , j v i n , j + w j ) [ exp ( v r , j K j C j K j ) exp ( v 1 , j K j C j K j ) ] + ( w r . j C j v r , j v i n , j ) [ Γ ( 1 + 1 K j ( v 1 , j C j ) K j ) Γ ( 1 + 1 K j ( v r , j C j ) K j ) ]
Precisely, the cost function for integrated power plant systems is given as:
J = J 1 + J 2
J = i = 1 N g [ ( a i + b i P i + c i P i 2 ) + | e i . . sin ( f i ( P i . min P i ) ) | ] + j = 1 m [ W P C o s t d i r . j + W P C o s t o e . j + W P C o s t u e . j ] ,
where J1 is given in Equation (2). Further necessary details of the system model for the interested readers can be seen in [25].
Constraints: The entire power generation based on thermal and wind generators should be equal to Pload line losses (Ploss) as follows:
i = 1 N g P i + j = 1 m w j = P l o a d + P l o s s ,
where Ng represents the amount of power plants, m denotes the number of wind generators, Pi describesthe power of the ith power plant. wj represents the generated power of the jth wind, Pload defines the total load demand and Ploss defines the line losses.
The losses of the transmission may be ignored for smaller transmission distance as well as for excessive load densities. However, in an enormous interrelated network wherever power is transferred above the extended distance through low load density regions, losses due to transmission are a foremost issue and distress the optimal dispatch. The mathematical relations of the losses are considered as follows:
P l o s s = I = 1 N g j = 1 N g P i B i j P j + i = 1 N g B i 0 P i + B 00
where, Bij, Bi0, B00 is defined as the line loss coefficient and Ng represented the number of power plants. The active power of for each power plant, as well as, wind generators must fulfil the following bounds:
P i , min P 1 P i , max 0 w j w r , j
Pi,min and Pi,max are representing the maximum and minimum parameters of the ith power plant, respectively, while wj and wr,j denote the produced and rated power of the jth wind generator, respectively. Basically, the operational collection of the entire generators are restricted through their ramp rate confines. These limits are reflected as follows:
P i 0 P i D i P i P i 0 U i
Pi and Pi0 represent the current and prior output of the ith power plant, respectively, while Di and Ui define the down and up ramp rate limits, respectively.

2.2. Optimization Techniques

The optimization procedure in this study consists of two parts. In the first part, the design of the bio-inspired heuristic algorithms based on the variant of GAs through its reproduction operators is presented, along with an overview of ASA used for rapid local convergence of the results. While in the second part, the learning procedure of these optimization algorithms to three constrained ELD systems involving VPLE and wind power generators is presented.
GAs is a meta-heuristic algorithm for viable global search and introduced by Holland in the 1970s [41]. GAs work through their fundamental operators of selection, crossover and mutation. These have been effectively utilized in diversified applications of constrained and unconstrained optimization problems with better control, stability, robustness and convergence. The workflow in terms of block structure for GAs is provided in Figure 1, while few potential applications of GAs in power sector can be seen in [42,43,44]. The steady state optimization performance of GAs is speeded-up by the process of combination with the efficient local search method based on ASA. ASA is one of the best local search procedures for linear and nonlinear, constrained and unconstrained optimization problems. The standard working of ASA is to divide the original stiff problems to relatively non-stiff sub-problems and these sub-problems are solved with the ease of algorithms. The block structure form of the workflow of ASA is shown in Figure 1. ASA addresses effectively many optimization problems which include nonnegative matrix factorization problems [45], variation deblurring problems [46] and warehouse location problems [47].
The paramount importance of GAs and ASA has encouraged the use of memetic variants of GAs with ASA (GA-ASA) for integrated load dispatch problems. Nine different sequential computing paradigms, GA-ASA-1 to GA-ASA-9 are designed for optimization based on a different set of reproduction operators as provided in Table 1. The selection operator stochastic uniform, means that GAs move along the line in steps of equal size. The section operator reminder, means that the probability for the selection of the parent is proportional to the fractional part of its scaled value. The selection operator roulette, means that an individual is chosen randomly with a probability equal to their respective area. The crossover operator heuristic, means an offspring that lies on the line containing their parents. The crossover operator arithmetic, means the create/generate offspring that are the weighted arithmetic mean of their parents. The crossover operator scatter, means a random one point, two point or intermediate crossover between the genes of two parents to have new child. The mutation operator adaptive feasible, means randomly generated feasible directions according to the last known successful or unsuccessful generation. The workflow diagram of the proposed approach is presented in Figure 1. In this study, implementation of variants of GAs and ASA is made through the optimization toolbox of the software package, Matlab with the help of ga, gaoptimset, fmincon and optimset routines. All three load dispatch problems are solved by these functions with appropriate settings of the parameters. The pseudocode of ASA is given in Algorithm 1.
Algorithm 1: Active-set Algorithm (ASA)
Inputs:
   The best individual of nine variants of GAs for each ELD, ELD-VPLE and ELD-VPLE-SW in the case involving 40 generation units. Mathematically represented as:
P G A = { [ P 1 , P 2 , , P 40 ] ELD [ P 1 , P 2 , , P 40 ] ELD - VPLE [ P 1 , P 2 , , P 37 , W 1 , W 2 , W 3 ] ELD - VPLE - SW ,
Output: The refined weights by ASA represented as:
P G A A S M = { [ P 1 , P 2 , , P 40 ] ELD [ P 1 , P 2 , , P 40 ] ELD - VPLE [ P 1 , P 2 , , P 37 , W 1 , W 2 , W 3 ] ELD - VPLE - SW
Initialization:
   Initialize the values of random assignments, constraints and parameters of the ASA.
Termination:
   Set stopping requirement of ASA as follows:
      Maximum iterations/cycles i.e., 1000,
      Tolerances
         TolFun, i.e., 10−12,
         TolCon, i.e., 10−12,
         TolX) values, i.e., 10−10,
While {Stopping criteria achieved} do
   Cost calculation:
      Calculate the cost using Equations (1)–(3) for ELD, ELD-VPLE and ELD-VPLE-SW for 40 generating units
   Stoppage
      If any of termination is achieved, then exit from the loop, or else it continues.
   Refinements
      Refine the values of the decision variables at each iteration with ASA using the fmincong routine with algorithm active-set in the MATLAB optimization toolbox.
End
Storage
   Store the values of decision variables for ELD, ELD-VPLE and ELD-VPLE-SW along with their costs, time, function count for current execution of ASA.
Statistics: Repeat the steps from initialization to storage for 100 trials for all nine variants of GA, i.e., GA-1 to GA-9 to generate a dataset of GA-ASA-1 to GA-ASA-9 results for comparative analysis of performance.

3. Results and Discussion

The numerical experimentation of the all nine design schemes for three load dispatch problems based on 40 generation units (40-GUs) involving no VPLE, with VPLE and combined thermal, as well as, wind GUs with VPLE are presented in this section. The nine variants of GA were applied initially and later on, all the results of these variants were given to ASA for further refinements. The load demand (PD) remained fixed at 10,500 MW for all three load dispatch problems. The maximum generators output powers Pmax, the minimum generators output powers Pmin and the cost coefficients in the case of 40 GUs are given in Appendix A [48]. The parameter of wind GUs is given in Appendix B [25,49].
Cost function formulation: The cost function for ELD problems with 40 GUs, i.e., Ng = 40, having quadratic cost function using Equation (1), is written as:
J 1 = i = 1 40 [ ( a i + b i P i + c i P i 2 ) ]
where the values of Pmin, Pmax and cost coefficients vectors a, b and c are given in Table A1 of Appendix A. The constraints associated with the problem are written as:
PD = i = 1 40 P i = 10500 , P i , min P i P i , max
Similarly, the cost function for ELD problems with VPLE (ELD-VPLE) for 40 GUs, i.e., Ng = 40, is written as:
J = i = 1 40 [ ( a i + b i P i + c i P i 2 ) + | e i . . sin ( f i ( P i . min P i ) ) | ] ,
where the values of Pmin, Pmax along with cost coefficients vectors a, b, c, e and f are given in Table A1 of Appendix A. The constraints associated with the problem are given in Equation (16).
The cost function for ELD problems involving VPLE by considering stochastic wind availability (ELD-VPLE-SW), in the case of 3 wind GUs, i.e., m = 3, and 37 thermal GUs, Ng = 37, are given as:
J = i = 1 37 [ ( a i + b i P i + c i P i 2 ) + | e i . . sin ( f i ( P i . min P i ) ) | ] + j = 1 3 [ W P C o s t d i r . j + W P C o s t o e . j + W P C o s t u e . j ]
where the values of Pmin, Pmax and cost coefficients vectors a, b, c, e and f are given in Table A1 of Appendix A, while the parameter of wind generating units is given in Table A2 of Appendix B. The constraints associated with the problem are given in Equation (16).
The design nine variants of GA were applied to solve ELD, ELD-VPLE and ELD-VPLE-SW problems using the cost function given in Equations (15), (17) and (18), respectively, while satisfying the constraints given in Equation (16). The learning curves of GA-1 along its fitness value and output power are shown graphically in Figure 2a,c,e for ELD, ELD-VPLE and ELD-VPLE-SW problems, respectively. The global best weights of GA-1 for all three load dispatch problems are given to ASA for further refinements and respective results of GA-ASA-1 in Figure 2b,d,f. It can be seen that by the process of combination, a significant improvement in the values of the cost function was observed for all three load dispatch problems. Accordingly, the results of all nine variants of GA and GA-ASA were determined. The results of in terms of costs, time consumed, generation (Gen) executed, and fitness function evaluated (FE) are given in Table 2 for ELD, ELD-VPLE and ELD-VPLE-SW problems, while the results of output power Pi of GA and GA-ASA for all three load dispatch problems ELD, ELD-VPLE and ELD-VPLE-SW are listed in Table A3, Table A4 andTable A5, respectively, of Appendix C. For ELD problems without considering VPLE, the minimum cost was achieved by GA-4 and the worst cost was achieved by GA-8, while no noticeable difference in time, generation (Gen) and function evaluated (FE) were observed (see data presented in Table 2). However, in the process of sequential computing the nine variants of GA-ASA, all nine algorithms converged to the same minimum cost. This is understandable given the ELD problems based on smooth/convex cost functions with unique local minima (see the results listed in Table 2).
Apart from the comparison of nine variants of GA and GA-ASA with each other, a detailed analysis of the proposed results in both cases of ELD-VPLE for 40GUs system and integrated power plant systems, i.e., ELD-VPLE-SW for 40GUs system with 3 wind units, is made with reported results. In the case of ELD-VPLE-SW, the results of reported solutions with Hybrid imperialist competitive-sequential quadratic programming (HIC-SQP) [25], PWTED1 [50], DWTED1 [50] and best compromise [50] are listed in Table 3. The best results were reported in HIC-SQP [25] for ELD-VPLE-SW based on the integrated load dispatch problem. Similarly, was the case for ELD-VPLE reported solutions for evolutionary programming aided with sequential quadratic programming (EP-SQP) [51], HIC-SQP [25], ant colony optimization (ACO) [52], biogeography-based optimization (BBO) [53], differential evolution aided with BBO (DE-BBO) [53], bacterial foraging optimization combined with Nelder–Mead (BF-NM) [54], new particle swarm optimization supported with local random searches (NPSO-LRS) [55] and real coded genetic algorithms (RCGA) [56]. The minimum cost achieved by HIC-SQP, PWTED1 and DWTED1 methods are listed in Table 3 for ELD-VPLE-SW, while the minimum costs of ES-SQP, HIC-SQP, ACO, BBO, DE-BBO, BF-NM, NPSO-LRS and RCGA for ELD-VPLE problems are also presented in Table 3. In the case of ELD-VPLE, the reported and our sequential computing algorithms have close resemblance with standard solutions, however none of the variants of GAs, GA-1 to GA-9 and their memetic computing techniques, i.e., GA-ASA-1 to GA-ASA-9, give the best solution reported so far for ELD-VPLE problems. Whereas, the significance of the proposed algorithms was evidently seen in the case of ELD-VPLE-SW problems based on the stiff cost function as defined in Equation (18), involving the calculation of incomplete gamma functions for each evaluation of the objective function. For example, the result achieved by the integrated computing approach GA-ASA-2 was 127,345.345$/h, which was better than the best reported optimization solutions for ELD-VPLE-SW problems in [25]. Additionally, it was observed that the proposed results of all nine variants of GA were poorer than in the reported results. However, after performance with ASA, the results of all nine variants of GA-ASA improved considerably, and even better than the reported results of recently applied algorithms based on HIC-SQP, PWTEDI, DWTEDI and best compromise.
The analysis on multiple run of algorithms: The performance analysis on the basis of multiple runs for all nine variants of GA and GA-ASA were carried out to solve the optimization problems based on ELD, ELD-VPLE and ELD-VPLE-SW systems which consisted of 40 Gus, including both thermal and wind power plants.
The analysis on the precision and reliability were performed through a hundred independent trails of each variant of GA and GA-ASAs in order to optimize all three load dispatch problems. The results for GA-1 and GA-ASA-1 in terms of best cost against the number of runs of the algorithms for ELD, ELD-VPLE and ELD-VPLE-SW systems are shown in Figure 3a,b, respectively, while the histogram plots of GA-1 to solve the ELD, ELD-VPLE, and ELD-VPLE-SW are shown in Figure 3c–e, respectively, and respective histogram plots for GA-ASA-1 algorithms are plotted in Figure 3f–h. Accordingly, the best cost against number of runs along with their histogram studies were conducted for all three load dispatch problems for GA-2 and GA-3 as well as GA-ASA-2 and GA-ASA-3. Similarly, the results of the cost against the number of runs are shown in Figure 4 for GA-4 and GA-ASA-4, while in Figure 5 for GA-8 and GA-ASA-8. From Figure 3, a small variation in the values of GA-1 was observed for all the load dispatch models while such small oscillations were also evident in solving ELD-VPLE and ELD-VPLE-SW systems by GA-ASA-1. However, no variations were seen in ELD problems optimized with GA-ASA-1. The results in Figure 3 also showed that the same trend of GA-1 and GA-ASA-1 were followed by GA-2 to GA-3 and GA-ASA-2 to GA-ASA-3, respectively, for all three ELD, ELD-VPLE, ELD-VPLE-SW power generation systems. Accordingly, the similar behavior of the results is evidently seen from the rest of the illustrations presented in Figure 4 and Figure 5.
The results presented in the histogram illustrations of Figure 3 showed that approximately 19%, 18% and 17% of the runs of GA-1 achieved costs ≤ 1.467 × 105, 1.515 1005 and 1.637 × 105 for ELD, ELD-VPLE, ELD-VPLE-SW power generation systems, respectively. However, 100%, 17% and 19% of the runs GA-ASA-1 obtained the cost ≤ 1.187 × 105, 1.254 × 105 and 1.301 × 105 for three respective load dispatch models. The results revealed that approximately 15%, 14% and 12% of the runs of GA-2 achieved the costs ≤ 1.526 × 105, 1.576 × 105 and 1.679 × 105 for ELD, ELD-VPLE, ELD-VPLE-SW power generation systems, respectively, while 100%, 15% and 14% of the runs GA-ASA-2 obtained the costs ≤ 1.187 × 105, 1.252 × 105 and 1.297 × 105 for three respective load dispatch models. The results with similar observations were achieved by GA-3 to GA-9 as well as GA-ASA-3 to GA-ASA-9. Thus, it can be concluded that generally for non-smooth, as well as smooth cost functions of power dispatch problems, the memetic computing approaches, i.e., GA-ASA-1 to GA-ASA-9, provided relatively better results than the standalone approaches, i.e., GA-1 to GA-9.
Complexity Analysis: The complexity analysis for all nine variants of GA and GA-ASAs are presented in terms of time consume, generation (Gen)/iteration executed and cost function evaluated /counted (FCs) for all three load dispatch systems. The result of complexity operators based on the mean along with its standard deviations (STD) magnitudes are presented in Table 4 for ELD, ELD-VPLE, ELD-VPLE-SW power generating systems in each case of GA and GA-ASAs. Regarding the ELD problem without VPLE, cost, time, Gen and FCs were 147,196 ± 4373, 92 ± 9, 174 ± 14 and 27,126 ± 6754 for GA, while for GA-ASA values of cost, time, Gen, FCs were 118,660 ± 0, 94 ± 12, 196 ± 7, and 28,036 ± 144. The cost, time, Gen and FCs were 152,000 ± 4000, 94 ± 10, 199 ± 20 and 29,000 ± 4000 for GA for ELD by considering VPLE, while for GA-ASA values of cost, time, Gen, FCs were 125,000 ± 1000, 95 ± 9, 428 ± 91 and 47,534 ± 7378. For ELD problems based on VPLE-SW, cost, time, Gen and FCs were 163,788.43 ± 4772.70, 98.37 ± 10.65, 173.60 ± 41.13 and 26,190.00 ± 222.00 for GA, while for GA-ASA the values of cost, time, Gen, FCs were 129,676.74 ± 897.77, 110.05 ± 11.23, 424.41 ± 83.55, and 47,214.99 ± 7472.99. The time based complexity analysis of the proposed variants GA-1 to GA-9, as well as, GA-ASA-1 to GA-ASA-9 is dependent on the specification of the machine on which optimization algorithms are executed. Thus, for better processing platforms, the computing time of optimization of the decision variable is reduced and vice versa. Similarly, varied computational requirement are associated with single generation/cycle of meta-heuristic paradigm based on GAs. Therefore, generations/iterations are also not effective for measurement of the complexity. To overcome these issues, the number of fitness function evaluated during the process of optimization of decision variables has been used as a measure for the analysis of the complexity which is a machine independent gauge. The complexity of the variants is given on the basis of time, iterations and FCs in the current study. These values are used for comparison whenever the same problems are addressed with counterpart meta-heuristic methodologies. The reported values of complexity in terms of time in seconds for the execution of a single generation/iteration were given 0.0597 for HIC-SQP [25] for ELD-VPLE-SW problems based on 37 thermal and three wind turbines based generated units. The CPU time per iteration of HIC-SQP [25] was better than reported PWTED1 [50], DWTED1 [50] and best compromise [50]. The similarly calculated values of complexity measure of proposed variants also provided the consumed time in close vicinity of the reported results.

4. Conclusions

The conclusions are summarized as follows:
  • Bio-inspired computational heuristics is exploited for solving effectively the integrated power plants systems based on thermal and wind generating units. The proposed BCHAs were based on nine variants of GAs and were designed by using different sets of reproduction operators and each global search method was aided with ASA for rapid local convergence.
  • The performance of proposed schemes was examined for solving ELD, ELD-VPLE, ELD-VPLE-SW problems based on 40 generating units with a fix load demand of 10,500 MW. It was found that all nine integrated approaches were viable solvers with reasonable accuracy. Additionally, sequential computing schemes gave relatively better results than standalone approaches.
  • Regarding the smooth cost function based ELD problem, there was no difference in the performance for each integrated methodology, while in the variants of Gas, the best cost was achieved using GA-4, i.e., 131,173.36$/hr, while in case of GA-ASA, the best minimum cost was achieved through GA-9, i.e., 118,600$/hr.
  • Regarding the non-convex cost function based ELD-VPLE problem, the minimum cost was achieved using GA-ASA-1, i.e., 137,359$/hr., while the results of combined optimization approaches were relatively better than GA variants. However the best minimum cost was achieved by standalone GA-6 is 122,175$/hr.
  • The scenario of the integrated power plant system was represented with ELD-VPLE-SW. The most effective optimization solver was GA-1 in terms of accuracy and convergence for the standalone scheme, while for sequential computing schemes, the results of GA-ASA-8 were found to be superior.
  • The validation and verification for the performance of each optimization solver was established from 100 independent trails to solve all three load dispatch problems by using the detailed analysis through statistical operators, convergence curves, as well as, histogram illustrations.
Some potential research directions are briefly narrated as:
  • The presented nine variant of GAs aided ASA, can be a good alternative to be explored or exploited in future for the unit commitment problem in the energy sector.
  • The application of proposed optimization algorithms can be explored for a variety of integrated load dispatch problems based on wind, solar, hydel, and biomass, generating units for dynamic and static requirements.
  • The newly introduced optimization solvers, including fractional order partial swarm optimization algorithms, fireworks algorithms, moth-flame algorithms, backtracking search optimization algorithms and differential search optimization algorithms can give quality solutions for problems arising in integrated power plant systems.

Author Contributions

R.J. provided data, designed the analytical approach proposed and wrote the paper; B.M. conceived the research theme, and N.H.K. and M.A.Z.R. performed analysis.

Acknowledgments

This work was supported by the Famous Teachers Cultivation planning for Teaching of North China Electric Power University (the Fourth Period).

Conflicts of Interest

The authors have no conflicts of interest to declare.

Appendix A

The parameters of thermal 40GUs based load dispatch systems are provided in Table A1.
Table A1. The parameters of 40GUs system based ELD problems.
Table A1. The parameters of 40GUs system based ELD problems.
GeneratorPmin (MW)Pmax (MW)abcef
1361140.006906.7394.7051000.084
2361140.006906.7394.7051000.084
3601200.020287.07309.541000.084
4801900.009428.18369.031500.063
547970.01145.35148.891200.077
6681400.011428.05222.331000.084
71103000.003578.03287.712000.042
81353000.004926.99391.982000.042
91353000.005736.60455.762000.042
101303000.0060512.9722.822000.042
11943750.0051512.9635.202000.042
12943750.0056912.8654.692000.042
131255000.0042112.5913.403000.035
141255000.007528.841760.43000.035
151255000.007089.151728.33000.035
161255000.007089.151728.33000.035
172205000.003137.97647.853000.035
182205000.003137.95649.693000.035
192425500.003137.97647.833000.035
202425500.003137.97647.813000.035
212545500.002986.63785.963000.035
222545500.002986.63785.963000.035
232545500.002486.66794.533000.035
242545500.002486.66794.533000.035
252545500.002777.10801.323000.035
262545500.002777.10801.323000.035
27101500.521243.331055.11200.077
28101500.521243.331055.11200.077
29101500.521243.331055.11200.077
3047970.011405.35148.891200.077
31601900.001606.43222.921500.063
32601900.001606.43222.921500.063
33601900.001606.43222.921500.063
34902000.00018.95107.872000.042
35902000.00018.62116.582000.042
36902000.00018.62116.582000.042
37251100.01615.88307.45800.098
38251100.01615.88307.45800.098
39251100.01615.88307.45800.098
402425500.003137.97647.833000.035

Appendix B

The parameters of wind based generating units are provided in Table A2.
Table A2. The parameters of wind based generating units.
Table A2. The parameters of wind based generating units.
C1C2C3K1K2K3D1D2D3
87622.41.7120120120
V1(m/s)Vin(m/s)Vout(m/s)Crw1(MWh)Crw2(MWh)Crw3(MWh)Crp1(MWh)Crp2(MWh)Crp3(MWh)
14425303030303030

Appendix C

The results in terms of power output of GA and GA-ASA for ELD, ELD-VPLE and ELD-VPLE-SW problems are provided in Table A3, Table A4 andTable A5, respectively.
Table A3. The results in terms of power output of GA and GA-ASA for ELD problems based on 40 GUs without considering VPLE.
Table A3. The results in terms of power output of GA and GA-ASA for ELD problems based on 40 GUs without considering VPLE.
GUVariants of GAVariants of GA-ASA
123456789123456789
P1104.26110.42109.93108.01110.53109.02113.23110.54110.81114.00114.00114.00114.00114.00114.00114.00114.00114.00
P2113.01110.42110.03102.85110.23110.64106.01110.66110.87114.00114.00114.00114.00114.00114.00114.00114.00114.00
P3114.99116.41115.98104.70116.29114.98114.29116.15115.69120.00120.00120.00120.00120.00120.00120.00120.00120.00
P4182.22186.42186.97172.97186.67185.92179.14186.66186.25190.00190.00190.00190.00190.00190.00190.00190.00190.00
P589.1394.4293.9787.1693.3994.7293.0593.6693.4197.0097.0097.0097.0097.0097.0097.0097.0097.00
P6135.77136.42135.95133.55136.23134.90134.15137.15136.72140.00140.00140.00140.00140.00140.00140.00140.00140.00
P7294.78296.42295.95299.36296.24296.90294.66296.17294.29300.00300.00300.00300.00300.00300.00300.00300.00300.00
P8291.76296.42296.02283.74296.45296.86297.37296.66294.97300.00300.00300.00300.00300.00300.00300.00300.00300.00
P9288.03296.42295.96289.37296.33297.55295.84297.65295.87300.00300.00300.00300.00300.00300.00300.00300.00300.00
P10296.96296.42295.89290.86296.96295.76292.06296.63296.84130.00130.00130.00130.00130.00130.00130.00130.00130.00
P11373.38371.42371.85356.12371.22370.86374.90371.64370.7194.0094.0094.0094.0094.0094.0094.0094.0094.00
P12370.31371.34370.99349.42371.08370.25370.45371.66370.5594.0094.0094.0094.0094.0094.0094.0094.0094.00
P13378.98379.80380.47370.85414.06379.75491.18378.19379.83125.00125.00125.00125.00125.00125.00125.00125.00125.00
P14394.11377.49379.90376.44382.13385.65376.03380.76380.08271.67271.67271.67271.67271.67271.67271.67271.67271.67
P15379.10378.53378.85452.45414.08392.10380.98377.65381.58266.66266.66266.66266.66266.66266.66266.66266.66266.66
P16499.11378.31378.30372.42380.44381.36367.90381.11377.84266.66266.66266.66266.66266.66266.66266.66266.66266.66
P17294.15379.64379.34395.28418.37380.64376.86377.86379.01500.00500.00500.00500.00500.00500.00500.00500.00500.00
P18374.92378.35378.34378.94416.93377.17491.13437.12377.14500.00500.00500.00500.00500.00500.00500.00500.00500.00
P19381.67445.45380.76429.41427.37444.50316.51380.84449.02550.00550.00550.00550.00550.00550.00550.00550.00550.00
P20374.44378.68445.85366.75381.05378.64503.95437.49381.23550.00550.00550.00550.00550.00550.00550.00550.00550.00
P21367.83515.23379.20349.20380.51380.31380.01379.08446.48550.00550.00550.00550.00550.00550.00550.00550.00550.00
P22376.98376.63378.23535.04379.94432.77406.31379.67449.04550.00550.00550.00550.00550.00550.00550.00550.00550.00
P23519.05377.96379.48449.96430.43444.34383.32450.25381.14550.00550.00550.00550.00550.00550.00550.00550.00550.00
P24388.12379.74377.68502.64381.12376.41380.99375.94379.48550.00550.00550.00550.00550.00550.00550.00550.00550.00
P25529.89380.76475.00368.14381.47448.18505.01377.16378.60550.00550.00550.00550.00550.00550.00550.00550.00550.00
P26382.01378.46417.66453.88378.51378.40377.79450.54379.88550.00550.00550.00550.00550.00550.00550.00550.00550.00
P2710.0179.50143.97114.3797.17128.7614.61144.62143.1510.0010.0010.0010.0010.0010.0010.0010.0010.00
P2821.09146.3948.5111.21110.6774.47127.5187.8973.8010.0010.0010.0010.0010.0010.0010.0010.0010.00
P29120.0576.7475.4528.08102.9589.6015.8175.9678.3210.0010.0010.0010.0010.0010.0010.0010.0010.00
P3086.7994.9894.0490.7093.2692.9296.8094.4994.4697.0097.0097.0097.0097.0097.0097.0097.0097.00
P31186.80186.42188.00188.65186.51187.59184.68186.73187.78190.00190.00190.00190.00190.00190.00190.00190.00190.00
P32175.01186.42185.99179.04186.23186.91183.07186.66189.20190.00190.00190.00190.00190.00190.00190.00190.00190.00
P33187.29186.42185.87175.25186.25188.94186.93186.14185.98190.00190.00190.00190.00190.00190.00190.00190.00190.00
P34197.19196.42196.80196.60195.81195.89199.86196.66194.86200.00200.00200.00200.00200.00200.00200.00200.00200.00
P35197.10196.42196.76194.61196.33196.92199.78196.67195.87200.00200.00200.00200.00200.00200.00200.00200.00200.00
P36193.26196.42195.49179.11197.33196.94195.15196.66195.86200.00200.00200.00200.00200.00200.00200.00200.00200.00
P37105.68106.42105.80101.07106.31106.5797.64106.66106.79110.00110.00110.00110.00110.00110.00110.00110.00110.00
P38103.10106.42107.0290.17106.26105.98106.18105.83105.74110.00110.00110.00110.00110.00110.00110.00110.00110.00
P39104.43106.42106.98105.93105.94108.10108.87107.21104.33110.00110.00110.00110.00110.00110.00110.00110.00110.00
P40517.24446.64480.78465.74380.93381.84379.97378.92446.55550.00550.00550.00550.00550.00550.00550.00550.00550.00
Table A4. The results in terms of power output of GA and GA-ASA for ELD problem based on 40 Gus by considering VPLE.
Table A4. The results in terms of power output of GA and GA-ASA for ELD problem based on 40 Gus by considering VPLE.
GUVariants of GAVariants of GA-ASA
123456789123456789
P1113.68110.41109.95110.18111.49110.60111.47109.49111.34110.80111.64110.80110.80110.80110.80110.80114.00114.00
P2105.05110.07110.21106.60110.49111.02109.68111.47110.6974.74111.45110.80110.80110.86110.80110.80114.00114.00
P3112.96115.87115.90115.51115.49117.03119.81115.34117.1497.4097.40120.0097.40120.00120.0097.4097.40120.00
P4182.90186.20185.98184.74186.46185.98188.15186.40185.1080.00179.73179.73179.73179.73129.87129.87129.87129.87
P587.3693.8593.0188.7493.4992.0493.9993.2593.0387.8097.0093.9787.8088.0297.0097.0089.6197.00
P6135.91138.09137.27139.70138.91136.06137.76137.38137.34140.00140.00140.00140.00140.00140.00140.00140.00140.00
P7297.86296.63297.22291.51296.49295.97295.16297.48297.27300.00259.60300.00300.00300.00259.60259.60259.60300.00
P8286.46296.11296.23293.08296.95296.95299.72296.44296.18284.60284.60284.60284.60284.60284.60284.60284.60284.60
P9292.44295.94296.09292.58296.49295.00295.54296.43297.21284.60284.60284.60284.60284.60284.60284.60284.60284.60
P10294.94296.13297.10292.90296.49295.97299.84297.32295.14130.00130.00130.00130.00204.80130.00130.00130.00130.00
P11371.15371.40370.20360.53371.45371.01370.85371.49371.81318.40243.60243.60318.40318.40243.60168.80318.40243.60
P12371.40371.11372.54367.15371.49371.03371.52372.65370.58318.40168.80318.40318.40318.40168.80243.60243.60168.80
P13399.82376.82384.39374.27380.05380.11396.77433.54378.18214.76394.28304.52214.76125.00394.28394.28304.52394.28
P14481.35432.68381.55391.22378.74381.36383.99423.66378.53304.52484.04214.76214.76214.76304.52394.28304.52304.52
P15386.83385.23378.29388.42380.58376.28363.82377.95379.36304.52304.52214.76125.00214.76304.52394.28394.28304.52
P16372.68381.30379.76382.01377.51378.40385.30400.05377.84304.52304.52394.28304.52214.76304.52394.28394.28304.52
P17463.13379.69445.59385.09447.68380.45364.38378.89380.59489.28489.28399.52489.28489.28399.52399.52399.52489.28
P18475.03399.82379.05374.55379.97380.52379.84380.68446.02399.52489.28399.52489.28489.28489.28399.52399.52489.28
P19425.57381.54378.96375.22448.88377.49352.18380.83380.52511.28511.28511.28511.28511.28511.28511.28511.28511.28
P20378.68381.34381.07373.04380.29377.53396.67380.00400.84511.28331.76511.28511.28511.28511.28421.52511.28421.52
P21377.41380.08439.15370.32437.23452.26480.10456.86380.07523.28523.28523.28523.28523.28523.28523.28523.28523.28
P22342.65434.14379.78465.87376.55380.39468.39380.57379.76523.28523.28523.28523.28523.28523.28523.28523.28523.28
P23391.60381.49378.17377.86440.41379.27464.56378.00377.77523.28523.28523.28523.28523.28523.28523.28523.28433.52
P24393.98376.72381.54507.85378.21380.59330.46425.23438.45523.28523.28523.28523.28523.28523.28523.28523.28523.28
P25368.35425.73379.82548.74378.85515.41397.21382.00433.57523.28523.28523.28523.28523.28523.28523.28523.28523.28
P26461.86449.35438.72465.38379.02443.31376.78377.87433.30523.28523.28523.28523.28523.28523.28523.28523.28523.28
P2749.8973.79144.0530.2987.85145.04133.0397.64144.7410.0010.0010.0010.0010.0010.0010.0010.0010.00
P2865.97145.5683.7810.17145.4971.1741.4091.4283.6210.0010.0010.0010.0010.0010.0010.0010.0010.00
P2989.5292.1678.36125.3774.0880.7828.40122.9476.5910.0010.0010.0010.0010.0010.0010.0010.0010.00
P3094.6594.1692.6890.8193.4493.0090.9893.2392.2487.8097.0087.8096.3488.4190.5697.0089.5197.00
P31184.57186.59186.48186.51187.07186.04182.93186.49187.55190.00190.00190.00190.00190.00190.00190.00190.00190.00
P32185.05185.91186.17179.94186.46187.06188.10188.76187.68190.00190.00190.00190.00190.00190.00190.00190.00190.00
P33183.89185.79187.22189.30186.42188.99184.83186.49187.65190.00190.00190.00190.00190.00190.00190.00190.00190.00
P34193.83195.58196.13192.41196.49197.92197.64197.29196.16164.80164.80164.80200.00200.00200.00164.80164.80166.11
P35197.01195.11197.21189.09196.49195.96194.90197.35197.38200.00164.80200.00200.00200.00164.80180.96164.80200.00
P36193.84198.03195.29194.34196.46195.90194.88196.04196.24200.00164.80200.00200.00200.00164.80200.00164.80200.00
P37105.95107.12105.7096.74106.49105.93103.50106.36106.24110.00110.00110.00110.00110.00110.00110.00110.00110.00
P38102.44105.85106.17109.72108.49107.05104.41109.46109.56110.00110.00110.00110.00110.00110.00110.00110.00110.00
P39101.25106.69106.23108.49106.49106.02108.97106.32105.99110.00110.00110.00110.00110.00110.00110.00110.00110.00
P40381.10379.94446.98373.77378.62377.08512.12378.97380.74511.28421.52511.28511.28511.28511.28421.52421.52511.28
Table A5. Results in terms of power output of GA and GA-ASA for ELD problem based on 40 GUs by considering VPLE-SW.
Table A5. Results in terms of power output of GA and GA-ASA for ELD problem based on 40 GUs by considering VPLE-SW.
GUVariants of GAVariants of GA-ASA
123456789123456789
P1110.26110.45110.13112.61110.43111.72112.49109.63110.34110.80114.00111.45110.80110.80110.80110.80110.80114.00
P2111.49110.48110.74110.31110.47110.35110.30110.00110.56110.80114.00113.19110.80110.80110.80110.80110.80114.00
P3109.77116.48116.09119.48116.43116.42113.09116.19116.5697.40120.0060.0097.40120.0097.4060.0097.40120.00
P4182.09186.48185.16188.68186.41186.35184.80185.85185.01179.73179.73183.85179.73179.73179.73179.73179.73179.73
P591.5893.4892.9091.3491.4392.8187.7692.9292.0691.8597.0087.8196.3487.8087.8087.8087.8097.00
P6136.59136.48136.13137.04136.43135.42131.93135.94136.12140.00140.00140.00140.00140.00140.00140.00140.00140.00
P7298.14297.48295.99295.65296.38296.29292.16295.66295.97259.60300.00300.00300.00300.00300.00259.60300.00300.00
P8288.10296.48296.76298.96296.43296.29296.05296.90295.93284.60300.00210.03284.60284.60284.60284.60284.60300.00
P9289.65296.42296.56299.71296.43296.92297.07295.93295.02284.60290.17284.63284.60284.60284.60284.60284.60300.00
P10291.58296.48294.19297.20296.43296.26292.12296.07293.97204.80130.00130.00279.60130.00130.00204.58130.00204.80
P11372.69371.48371.83373.94372.43372.51374.94370.92370.94168.80318.40318.36168.80318.40243.60242.76318.40318.40
P12368.51371.48370.93372.39371.37371.17370.26370.81371.01168.80168.80168.94318.40318.40168.80242.17318.40168.80
P13375.69378.37378.04381.17376.59377.61383.10378.37379.48304.52304.52304.50304.52304.52304.52394.28214.76214.76
P14372.98380.93379.57380.50381.71382.50373.85377.10380.83394.28394.28394.30214.76214.76394.28304.52304.52304.52
P15373.65379.99380.66420.85377.97383.71371.95379.83379.56394.28394.28394.28394.28214.76394.28394.28304.52304.52
P16497.71377.12378.40382.99378.03376.40382.64379.61380.65484.04304.52214.76304.52214.76394.28394.28304.52394.28
P17377.78378.04380.58375.72379.20380.95388.07378.30381.69489.28399.52399.50399.52489.28399.52399.52399.52399.52
P18385.98379.72380.35396.43378.49378.56370.27378.25383.99489.28399.52489.28399.52489.28399.52399.52489.28399.52
P19369.66380.14376.71383.11376.05380.13514.11381.48380.53421.52511.28421.55511.28421.52511.28511.28511.28511.28
P20510.86514.48381.93418.77377.37379.99378.16421.36380.39421.52421.52511.29421.52511.28511.28421.52511.28421.52
P21507.27377.87379.89374.86514.91378.18386.26384.22378.25523.28433.52523.31523.28523.28433.52523.28523.28438.64
P22359.22512.72385.18494.32386.84379.08442.63421.33381.37433.52523.28523.30433.52523.28433.52523.28523.28523.28
P23377.36380.61382.38392.60516.35375.06439.89378.91513.87433.52433.52523.27523.28523.28523.28523.28523.28523.28
P24382.14376.36378.39381.61378.81516.50523.65474.95379.06523.28523.28523.28523.28523.28523.28523.28433.52523.28
P25369.11377.69379.76378.90378.52383.25387.77476.45378.13433.52523.28523.29523.28523.28523.28523.28523.28523.28
P26491.53382.72517.24336.93378.61378.28369.65378.45380.07523.28523.28523.28523.28523.28523.28523.28523.28523.28
P2793.4593.4892.8392.9893.4394.4293.5892.4993.1087.8097.0087.8987.8087.8087.8087.8047.0097.00
P28182.05186.33185.87183.07186.43185.37182.88185.91184.05190.00190.00190.00190.00190.00190.00190.00190.00190.00
P29186.87186.43186.05186.34186.44187.64187.78186.05185.87190.00190.00190.00190.00190.00190.00190.00190.00190.00
P30189.23186.47185.33186.56186.43185.37181.57185.14187.15190.00190.00190.00190.00190.00190.00190.00190.00190.00
P31199.59196.47195.85199.89196.43197.29196.01196.80196.10200.00200.00193.39200.00185.94164.80164.80164.80200.00
P32194.80194.73194.75198.31197.43195.97195.80196.88196.32200.00200.00200.00200.00200.00198.88164.80194.80200.00
P33191.83197.48196.88199.74195.43195.41196.11196.63196.16200.00200.00200.00200.00200.00200.00164.80200.00200.00
P34104.06106.45107.13104.28106.43106.42106.60105.88106.07110.00110.00110.00110.00110.00110.00110.00110.00110.00
P35104.09107.43106.76105.89106.43106.2998.74105.98105.74110.00110.00110.00110.00110.00110.00110.00110.00110.00
P36107.07106.41105.67109.77106.43107.29102.26106.43108.01110.00110.00110.00110.00110.00110.00110.00110.00110.00
P37377.79378.89515.38505.45377.28512.67381.81377.41514.16511.28511.28511.26511.28511.28511.28421.52511.28511.28
P3825.70144.48142.0689.64146.43143.8910.08145.00143.0610.0010.0010.0010.0010.0010.0010.0010.0010.00
P3910.00144.48138.94125.33144.43139.23123.60105.01142.8610.0010.0010.0010.0010.0010.0010.0010.0010.00
P40132.0710.0410.0216.6810.0010.0468.1848.9510.0110.0010.0010.0010.0010.0010.0010.0010.0010.00

References

  1. Stoft, S. Power system economics. J. Energy Lit. 2002, 8, 94–99. [Google Scholar]
  2. Akkaş, Ö.P.; Çam, E.; Eke, İ.; Arikan, Y. New Optimization Algorithms for Application to Environmental Economic Load Dispatch in Power Systems. Electrica 2018, 18, 133–142. [Google Scholar] [CrossRef] [Green Version]
  3. Chouhdry, Z.R.; Hasan, K.M.; Raja, M.A.Z. Design of reduced search space strategy based on integration of Nelder–Mead method and pattern search algorithm with application to economic load dispatch problem. Neural Comput. Appl. 2018, 30, 3693–3705. [Google Scholar] [CrossRef]
  4. Zou, D.; Li, S.; Wang, G.G.; Li, Z.; Ouyang, H. An improved differential evolution algorithm for the economic load dispatch problems with or without valve-point effects. Appl. Energy 2016, 181, 375–390. [Google Scholar] [CrossRef]
  5. Zakian, P.; Kaveh, A. Economic dispatch of power systems using an adaptive charged system search algorithm. Appl. Soft Comput. 2018, 73, 607–622. [Google Scholar] [CrossRef]
  6. Chen, W.H.; Wu, P.H.; Lin, Y.L. Performance optimization of thermoelectric generators designed by multi-objective genetic algorithm. Appl. Energy 2018, 209, 211–223. [Google Scholar] [CrossRef]
  7. Roy, P.K.; Ghoshal, S.P.; Thakur, S.S. Biogeography-based optimization for economic load dispatch problems. Electr. Power Compon. Syst. 2009, 38, 166–181. [Google Scholar] [CrossRef]
  8. Chen, X.; Xu, B.; Mei, C.; Ding, Y.; Li, K. Teaching–learning–based artificial bee colony for solar photovoltaic parameter estimation. Appl. Energy 2018, 212, 1578–1588. [Google Scholar] [CrossRef]
  9. Pradhan, M.; Roy, P.K.; Pal, T. Grey wolf optimization applied to economic load dispatch problems. Int. J. Electr. Power Energy Syst. 2016, 83, 325–334. [Google Scholar] [CrossRef]
  10. Kamboj, V.K.; Bhadoria, A.; Bath, S.K. Solution of non-convex economic load dispatch problem for small-scale power systems using ant lion optimizer. Neural Comput. Appl. 2017, 28, 2181–2192. [Google Scholar] [CrossRef]
  11. Chen, G.; Lu, Z.; Zhang, Z. Improved krill herd algorithm with novel constraint handling method for solving optimal power flow problems. Energies 2018, 11, 76. [Google Scholar] [CrossRef]
  12. Mandal, B.; Roy, P.K.; Mandal, S. Economic load dispatch using krill herd algorithm. Int. J. Electr. Power Energy Syst. 2014, 57, 1–10. [Google Scholar] [CrossRef]
  13. Al-Betar, M.A.; Awadallah, M.A.; Khader, A.T.; Bolaji, A.L.A.; Almomani, A. Economic load dispatch problems with valve-point loading using natural updated harmony search. Neural Comput. Appl. 2016, 1–15. [Google Scholar] [CrossRef]
  14. Jebaraj, L.; Venkatesan, C.; Soubache, I.; Rajan, C.C.A. Application of differential evolution algorithm in static and dynamic economic or emission dispatch problem: A review. Renew. Sustain. Energy Rev. 2017, 77, 1206–1220. [Google Scholar] [CrossRef]
  15. Ali, E.S.; Elazim, S.A. Mine blast algorithm for environmental economic load dispatch with valve loading effect. Neural Comput. Appl. 2018, 30, 261–270. [Google Scholar] [CrossRef]
  16. Mohammad, F.; Abdi, H. A modified crow search algorithm (MCSA) for solving economic load dispatch problem. Appl. Soft Comput. 2018, 71, 51–65. [Google Scholar] [CrossRef]
  17. Dosoglu, M.K.; Guvenc, U.; Duman, S.; Sonmez, Y.; Kahraman, H.T. Symbiotic organisms search optimization algorithm for economic/emission dispatch problem in power systems. Neural Comput. Appl. 2018, 29, 721–737. [Google Scholar] [CrossRef]
  18. Ziane, I.; Benhamida, F.; Graa, A. Simulated annealing algorithm for combined economic and emission power dispatch using max/max price penalty factor. Neural Comput. Appl. 2017, 28, 197–205. [Google Scholar] [CrossRef]
  19. Roy, P.K.; Bhui, S. A multi-objective hybrid evolutionary algorithm for dynamic economic emission load dispatch. Int. Trans. Electr. Energy Syst. 2016, 26, 49–78. [Google Scholar] [CrossRef]
  20. Ma, H.; Yang, Z.; You, P.; Fei, M. Multi-objective biogeography-based optimization for dynamic economic emission load dispatch considering plug-in electric vehicles charging. Energy 2017, 135, 101–111. [Google Scholar] [CrossRef]
  21. Abdelaziz, A.Y.; Ali, E.S.; Elazim, S.A. Implementation of flower pollination algorithm for solving economic load dispatch and combined economic emission dispatch problems in power systems. Energy 2016, 101, 506–518. [Google Scholar] [CrossRef]
  22. Jadoun, V.K.; Gupta, N.; Niazi, K.R.; Swarnkar, A. Modulated particle swarm optimization for economic emission dispatch. Int. J. Electr. Power Energy Syst. 2015, 73, 80–88. [Google Scholar] [CrossRef]
  23. Adarsh, B.R.; Raghunathan, T.; Jayabarathi, T.; Yang, X.S. Economic dispatch using chaotic bat algorithm. Energy 2016, 96, 666–675. [Google Scholar] [CrossRef]
  24. Wang, W.; Li, C.; Liao, X.; Qin, H. Study on unit commitment problem considering pumped storage and renewable energy via a novel binary artificial sheep algorithm. Appl. Energy 2017, 187, 612–626. [Google Scholar] [CrossRef]
  25. Morshed, M.J.; Asgharpour, A. Hybrid imperialist competitive sequential quadratic programming (HIC-SQP) algorithm for solving economic load dispatch with incorporating stochastic wind power: A comparative study on heuristic optimization techniques. Energy Convers. Manag. 2014, 84, 30–40. [Google Scholar] [CrossRef]
  26. Teeparthi, K.; Kumar, D.V. Security-constrained optimal power flow with wind and thermal power generators using fuzzy adaptive artificial physics optimization algorithm. Neural Comput. Appl. 2018, 29, 855–871. [Google Scholar] [CrossRef]
  27. Safari, A.; Shahsavari, H. Frequency-constrained unit commitment problem with considering dynamic ramp rate limits in the presence of wind power generation. Neural Comput. Appl. 2018, 1–14. [Google Scholar] [CrossRef]
  28. Qu, B.Y.; Liang, J.J.; Zhu, Y.S.; Wang, Z.Y.; Suganthan, P.N. Economic emission dispatch problems with stochastic wind power using summation based multi-objective evolutionary algorithm. Inf. Sci. 2016, 351, 48–66. [Google Scholar] [CrossRef]
  29. Li, M.S.; Lin, Z.J.; Ji, T.Y.; Wu, Q.H. Risk constrained stochastic economic dispatch considering dependence of multiple wind farms using pair-copula. Appl. Energy 2018, 226, 967–978. [Google Scholar] [CrossRef]
  30. Khan, W.U.; Ye, Z.; Chaudhary, N.I.; Raja, M.A.Z. Backtracking search integrated with sequential quadratic programming for nonlinear active noise control systems. Appl. Soft Comput. 2018, 73, 666–683. [Google Scholar] [CrossRef]
  31. Raja, M.A.Z.; Ahmed, T.; Shah, S.M. Intelligent computing strategy to analyze the dynamics of convective heat transfer in MHD slip flow over stretching surface involving carbon nanotubes. J. Taiwan Inst. Chem. Eng. 2017, 80, 935–953. [Google Scholar] [CrossRef]
  32. Ahmad, I.; Ahmad, S.; Awais, M.; Ahmad, S.U.I.; Raja, M.A.Z. Neuro-evolutionary computing paradigm for Painlevé equation-II in nonlinear optics. Eur. Phys. J. Plus 2018, 133, 184. [Google Scholar] [CrossRef]
  33. Sabir, Z.; Manzar, M.A.; Raja, M.A.Z.; Sheraz, M.; Wazwaz, A.M. Neuro-heuristics for nonlinear singular Thomas-Fermi systems. Appl. Soft Comput. 2018, 65, 152–169. [Google Scholar] [CrossRef]
  34. Umar, M.; Sabir, Z.; Raja, M.A.Z. Intelligent computing for numerical treatment of nonlinear prey–predator models. Appl. Soft Comput. 2019, 80, 506–524. [Google Scholar] [CrossRef]
  35. Raja, M.A.Z.; Sabir, Z.; Mehmood, N.; Al-Aidarous, E.S.; Khan, J.A. Design of stochastic solvers based on genetic algorithms for solving nonlinear equations. Neural Comput. Appl. 2015, 26, 1–23. [Google Scholar] [CrossRef]
  36. Raja, M.A.Z.; Kiani, A.K.; Shehzad, A.; Zameer, A. Memetic computing through bio-inspired heuristics integration with sequential quadratic programming for nonlinear systems arising in different physical models. SpringerPlus 2016, 5, 2063. [Google Scholar] [CrossRef] [PubMed]
  37. Javadi, M.; Marzband, M.; Funsho Akorede, M.; Godina, R.; Saad Al-Sumaiti, A.; Pouresmaeil, E. A centralized smart decision-making hierarchical interactive architecture for multiple home microgrids in retail electricity market. Energies 2018, 11, 3144. [Google Scholar] [CrossRef]
  38. Valinejad, J.; Marzband, M.; Funsho Akorede, M.; D Elliott, I.; Godina, R.; Matias, J.; Pouresmaeil, E. Long-term decision on wind investment with considering different load ranges of power plant for sustainable electricity energy market. Sustainability 2018, 10, 3811. [Google Scholar] [CrossRef]
  39. Valinejad, J.; Barforoshi, T.; Marzband, M.; Pouresmaeil, E.; Godina, R.; PS Catalão, J. Investment Incentives in Competitive Electricity Markets. Appl. Sci. 2018, 8, 1978. [Google Scholar] [CrossRef]
  40. Marzband, M.; Azarinejadian, F.; Savaghebi, M.; Pouresmaeil, E.; Guerrero, J.M.; Lightbody, G. Smart transactive energy framework in grid-connected multiple home microgrids under independent and coalition operations. Renew. Energy 2018, 126, 95–106. [Google Scholar] [CrossRef]
  41. Holland, J.H. Genetic algorithms. Sci. Am. 1992, 267, 66–73. [Google Scholar] [CrossRef]
  42. Wang, S.; Zhao, F.; Liu, Z.; Hao, H. Heuristic method for automakers’ technological strategy making towards fuel economy regulations based on genetic algorithm: A China’s case under corporate average fuel consumption regulation. Appl. Energy 2018, 204, 544–559. [Google Scholar] [CrossRef]
  43. Ferdyn-Grygierek, J.; Grygierek, K. Multi-variable optimization of building thermal design using genetic algorithms. Energies 2017, 10, 1570. [Google Scholar] [CrossRef]
  44. Alcayde, A.; Baños, R.; Arrabal-Campos, F.M.; Montoya, F.G. Optimization of the Contracted Electric Power by Means of Genetic Algorithms. Energies 2019, 12, 1270. [Google Scholar] [CrossRef]
  45. Kim, H.; Park, H. Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl. 2008, 30, 713–730. [Google Scholar] [CrossRef]
  46. Krishnan, D.; Lin, P.; Yip, A.M. A primal-dual active-set method for non-negativity constrained total variation deblurring problems. IEEE Trans. Image Process. 2007, 16, 2766–2777. [Google Scholar] [CrossRef] [PubMed]
  47. Abo-Elnaga, Y.; El-Sobky, B.; Al-Naser, L. An active-set trust-region algorithm for solving warehouse location problem. J. Taibah Univ. Sci. 2017, 11, 353–358. [Google Scholar] [CrossRef]
  48. Sinha, N.; Chakrabarti, R.; Chattopadhyay, P.K. Evolutionary programming techniques for economic load dispatch. IEEE Trans. Evol. Comput. 2003, 7, 83–94. [Google Scholar] [CrossRef]
  49. Azizipanah-Abarghooee, R.; Niknam, T.; Roosta, A.; Malekpour, A.R.; Zare, M. Probabilistic multiobjective wind-thermal economic emission dispatch based on point estimated method. Energy 2012, 37, 322–335. [Google Scholar] [CrossRef]
  50. Khodabakhshian, A.; Pour, M.E.; Hooshmand, R. Design of a robust load frequency control using sequential quadratic programming technique. Int. J. Electr. Power Energy Syst. 2012, 40, 1–8. [Google Scholar] [CrossRef]
  51. Attaviriyanupap, P.; Kita, H.; Tanaka, E.; Hasegawa, J. A hybrid EP and SQP for dynamic economic dispatch with nonsmooth fuel cost function. IEEE Trans. Power Syst. 2002, 17, 411–416. [Google Scholar] [CrossRef]
  52. Pothiya, S.; Ngamroo, I.; Kongprawechnon, W. Ant colony optimisation for economic dispatch problem with non-smooth cost functions. Int. J. Electr. Power Energy Syst. 2010, 32, 478–487. [Google Scholar] [CrossRef]
  53. Bhattacharya, A.; Chattopadhyay, P.K. Solving complex economic load dispatch problems using biogeography-based optimization. Expert Syst. Appl. 2010, 37, 3605–3615. [Google Scholar] [CrossRef]
  54. Panigrahi, B.K.; Pandi, V.R. Bacterial foraging optimisation: Nelder–Mead hybrid algorithm for economic load dispatch. IET Gener. Transm. Distrib. 2008, 2, 556–565. [Google Scholar] [CrossRef]
  55. Selvakumar, A.I.; Thanushkodi, K. A new particle swarm optimization solution to nonconvex economic dispatch problems. IEEE Trans. Power Syst. 2007, 22, 42–51. [Google Scholar] [CrossRef]
  56. Amjady, N.; Nasiri-Rad, H. Nonconvex economic dispatch with AC constraints by a new real coded genetic algorithm. IEEE Trans. Power Syst. 2009, 24, 1489–1502. [Google Scholar] [CrossRef]
Figure 1. Graphical overview of the proposed design schemes for solving integrated economic load dispatch problems involving stochastic wind.
Figure 1. Graphical overview of the proposed design schemes for solving integrated economic load dispatch problems involving stochastic wind.
Energies 12 02568 g001
Figure 2. The adaptation of parameters of ELD systems based on 40 generating unit without considering VPLE, with considering VPLE and VPLE-SW.
Figure 2. The adaptation of parameters of ELD systems based on 40 generating unit without considering VPLE, with considering VPLE and VPLE-SW.
Energies 12 02568 g002
Figure 3. The comparison of results on the basis of 100 independent runs of GA-1 and GA-ASA-1 for all three load dispatch problems.
Figure 3. The comparison of results on the basis of 100 independent runs of GA-1 and GA-ASA-1 for all three load dispatch problems.
Energies 12 02568 g003
Figure 4. The comparison of results on the basis of 100 independent runs of GA-4 and GA-ASA-4 for all three load dispatch problems.
Figure 4. The comparison of results on the basis of 100 independent runs of GA-4 and GA-ASA-4 for all three load dispatch problems.
Energies 12 02568 g004
Figure 5. The comparison of results on the basis of 100 independent runs of GA-8 and GA-ASA-8 for all three load dispatch problems.
Figure 5. The comparison of results on the basis of 100 independent runs of GA-8 and GA-ASA-8 for all three load dispatch problems.
Energies 12 02568 g005
Table 1. The functions invoke to design the variants of the proposed optimization solvers based on genetic algorithms (GAs) supported with the active-set algorithm (ASA).
Table 1. The functions invoke to design the variants of the proposed optimization solvers based on genetic algorithms (GAs) supported with the active-set algorithm (ASA).
MethodsInvoke Routines of Reproduction OperatorsAided with
SelectionCrossoverMutations‘ASA’
GA-1“Stochastic Uniform”“Heuristic”“Adaptive Feasible”GA-ASA-1
GA-2“Stochastic Uniform”“Arithmetic”“Adaptive Feasible”GA-ASA-2
GA-3“Stochastic Uniform”“Scattered”“Adaptive Feasible”GA-ASA-3
GA-4“Reminder”“Heuristic”“Adaptive Feasible”GA-ASA-4
GA-5“Reminder”“Arithmetic”“Adaptive Feasible”GA-ASA-5
GA-6“Reminder”“Scattered”“Adaptive Feasible”GA-ASA-6
GA-7“Roulette”“Heuristic”“Adaptive Feasible”GA-ASA-7
GA-8“Roulette”“Arithmetic”“Adaptive Feasible”GA-ASA-8
GA-9“Roulette”“Scattered”“Adaptive Feasible”GA-ASA-9
Table 2. The results of GA and GA-ASA for ELD problems based on 40 GUs without considering VPLE, considering VPLE and integration of wind units.
Table 2. The results of GA and GA-ASA for ELD problems based on 40 GUs without considering VPLE, considering VPLE and integration of wind units.
MethodWithout VPLEWith VPLEVPLE and Stochastic Wind
CostTimeGenFCsCostTimeGenFCsCostTimeGenFCs
GA-1132,5149020030,150137,3599720030,150147,32511520030,150
GA-2140,4898120030,150146,9199220030,150158,24513220030,150
GA-3138,2469820030,150146,4589020030,150157,4089520030,150
GA-4131,17310320030,150137,9209120030,150152,32610320030,150
GA-5140,1588520030,150146,6649620030,150158,22911720030,150
GA-6138,7219720030,150145,66110520030,150157,54211120030,150
GA-7133,3518820030,150139,82510120030,150148,98710120030,150
GA-8140,8438120030,150146,6939420030,150158,07011320030,150
GA-9139,70010020030,150145,9448820030,150157,7789920030,150
GA-ASA-1118,6609122131,851122,74910534228,861127,61113235029,939
GA-ASA-2118,6608222432,094122,71910032427,325127,74414323720,288
GA-ASA-3118,6609922131,851122,6839935931,507127,10811750041,282
GA-ASA-4118,66010422332,013122,3699827622,760127,51011220216,912
GA-ASA-5118,6608621931,689122,35311750042,617126,77313641235,638
GA-ASA-6118,6609822231,932122,17510122919,182127,14112119816,411
GA-ASA-7118,6608922131,851123,06210621017,498127,25713250041,167
GA-ASA-8118,6608222131,852122,79610434329,568127,03812220416,916
GA-ASA-9118,66010122131,851122,6469320517,054127,39210922018,474
Table 3. The comparison of reported solutions in case of 40 thermal generating without VPLE and with VPLE.
Table 3. The comparison of reported solutions in case of 40 thermal generating without VPLE and with VPLE.
AlgorithmELD-VPLEAlgorithmELD-VPLEAlgorithmELD-VPLE-SW
EP–SQP122,324.00$/hBBO121,688.6634$/hrHIC-SQP136,381.3831$/h
HIC-SQP121,418.23$/hrBF–NM121,423.63$/hrPWTEDI137,985.38$/h
NPSO-RLS123,094.98$/hrDE–BBO121,420.89$/hrDWTEDI137,190.31$/h
ACO121,679.64$/hrRCGA121,628.59$/hrBest compromise143,587.90$/h
Table 4. The comparison of results for ELD problems without considering VPLE, with considering VPLE and VPLE-SW through statistical performance indices.
Table 4. The comparison of results for ELD problems without considering VPLE, with considering VPLE and VPLE-SW through statistical performance indices.
IndexMethodMeanSTD
CostTimeGenFCsCostTimeGenFCs
No VPLEGA-1147,1259220030,15044141700
GA-2152,4318718027,12647398436481
GA-3151,4849320030,15048971300
GA-4145,9519620030,15049701200
GA-5152,8318816925,478448212527865
GA-6151,2409419929,936503411142145
GA-7147,1969620030,1504261900
GA-8152,1199117426,309437316456754
GA-9150,7329119930,0504994771005
GA-ASA-1118,6609222131,8800172126
GA-ASA-2118,6608820228,90508436471
GA-ASA-3118,6609422131,8770132148
GA-ASA-4118,6609622231,8970122144
GA-ASA-5118,6608919127,252012527861
GA-ASA-6118,6609522031,676011142137
GA-ASA-7118,6609722131,882092137
GA-ASA-8118,6609219628,036016456758
GA-ASA-9118,6609222131,7990771012
VPLEGA-1151,9279720030,15046621100
GA-2157,1879018327,611476413446567
GA-3156,5309019929,960507611131905
GA-4153,2489720030,15043921300
GA-5158,0208818327,66247358416083
GA-6157,1939719929,955481412131950
GA-7152,4999820030,15045901000
GA-8158,2559318527,929448216405975
GA-9157,7759420030,1504611700
GA-ASA-1125,52810344551,028120611766701
GA-ASA-2125,1379542848,342119413909677
GA-ASA-3125,3819745451,574119612978408
GA-ASA-4125,23810445952,228122313958366
GA-ASA-5125,0729443348,84212189838732
GA-ASA-6125,28710245351,564123612918065
GA-ASA-7125,65710444450,849106010746405
GA-ASA-8125,4119941647,534114616858818
GA-ASA-9125,37510044550,90311717887378
VPLE-SWGA-1163,55710820030,15053621100.00
GA-2167,7969817125,747483412517741
GA-3167,81510220030,150458090.000
GA-4163,84810820030,150481715000
GA-5167,4569917326,190477211466932
GA-6167,02410520030,15050901600
GA-7163,78810820030,15048411200
GA-8167,1209818027,130514610416169
GA-9167,53910319929,92847389142220
GA-ASA-1130,10211043650,18390111776565
GA-ASA-2129,70610942447,2149751310110,589
GA-ASA-3129,82811444851,19895510897450
GA-ASA-4130,07512044551,11291415847472
GA-ASA-5129,82411041446,7751010129610,323
GA-ASA-6129,81311744951,31989816887699
GA-ASA-7130,24811944050,68384913837516
GA-ASA-8129,66111042848,1151030.11959821
GA-ASA-9129,67711545651,85989511928308

Share and Cite

MDPI and ACS Style

Jamal, R.; Men, B.; Khan, N.H.; Raja, M.A.Z. Hybrid Bio-Inspired Computational Heuristic Paradigm for Integrated Load Dispatch Problems Involving Stochastic Wind. Energies 2019, 12, 2568. https://doi.org/10.3390/en12132568

AMA Style

Jamal R, Men B, Khan NH, Raja MAZ. Hybrid Bio-Inspired Computational Heuristic Paradigm for Integrated Load Dispatch Problems Involving Stochastic Wind. Energies. 2019; 12(13):2568. https://doi.org/10.3390/en12132568

Chicago/Turabian Style

Jamal, Raheela, Baohui Men, Noor Habib Khan, and Muhammad Asif Zahoor Raja. 2019. "Hybrid Bio-Inspired Computational Heuristic Paradigm for Integrated Load Dispatch Problems Involving Stochastic Wind" Energies 12, no. 13: 2568. https://doi.org/10.3390/en12132568

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