1 Introduction

In power systems, power generation needs to meet customer demand. As a result, the system must remain stable under high step-load perturbations (SLPs) to regulate frequency instability. The main part of automatic generation control (AGC) is load–frequency control (LFC), which is required for maintaining nominal tie-line power and nominal system frequency during disturbances. The regulated output of the AGC is an area control error (ACE), which is guided to zero to eliminate frequency and tie-line power deviations [1, 2]. The following summarizes an LFC’s primary responsibilities [3]:

  • At steady state, each region should be able to support its own load.

  • During the transition period, areas in need of electricity might partner with one another.

  • The system must be kept under control during an abrupt load interruption and any other disruptions.

  • The frequency and tie-line power deviations in terms of overshoot, undershoot, and settling time should be minimized to enhance system stability.

As a result, various LFC controlling methods have been established to maintain tie-line power and system frequency with minimum changes, such as proportional–integral (PI) [4], integral–derivative (ID) [5], proportional–integral–derivative (PID) [6], and optimal PID [7] controllers. To achieve better performance, LFC is built using a fuzzy scheme in [8], and an adaptive fuzzy scheme for a PI scheme is described in [9]. These approaches are difficult to execute, and success cannot be guaranteed. Recently, soft computing schemes for addressing LFC issues in an interconnected power system (IPS) have been designed. LFC research focusing on the design of classical integer controllers has been extensive, e.g., bacterial-foraging optimization (BFO)-based PID [10], differential-evolution (DE)-based PID [11], teaching–learning-based optimization (TLBO)-based PID [12], and 2DOF-PID [13]. Nonlinear LFC problems and system stability under large SLPs and uncertainties have been addressed using novel control techniques, such as the adaptive neuro fuzzy inference system (ANFIS) [14], model predictive control [15, 16], fuzzy logic [17, 18], and artificial neural networks [19]. For integration of renewable energy, such as wind energy, a grouped grey wolf optimizer based interactive PI controller for maximum power point tracking and democratic joint operations algorithm based PID controller for optimum power extraction are presented in [20, 21], respectively.

Because of the growing complexity of IPSs, such as high load disruptions and nonlinearities, the performance of non-CCs deteriorates significantly [22]. In the case of non-CCs, there are fewer tuning parameters than with CCs. However, with more tuning parameters in the controller structure, it can produce better results. Hence, the CC structure is one of the most effective controller techniques for improving the performance of a control system, especially with disturbances and parameter uncertainties [23,24,25]. Consequently, CCs for AGC, such as the Bat algorithm-based PD-PID CC [26], modified gray wolf optimizer (MGWO)-based PI-PD and CC-TID, are presented in [27, 28], respectively, simplified GWO (SGWO)-based adaptive fuzzy PID controller is given in [29], and a maiden application of the slap swarm algorithm-based TID-TID CC is presented in [22].

An AGC control strategy must be able to deal effectively with nonlinearities such as governor dead band (GDB) and generation rate constraint (GRC), parameter uncertainties, and disturbances while still achieving the desired dynamic performance. In addition, the controller application should not be overly complex in order to provide a realistic solution for engineering problems. Recently, FO calculus has also been used. These controllers are computationally more powerful in enhancing the performance than conventional methods because they remove the limitations produced by their traditional counterparts, and it has been confirmed that they can achieve significant efficiency improvements [23, 30, 31]. A Yin-Yang-Pair optimization-based FOPID controller is presented in [32] to harvest the maximum solar power from the PV arrays, while control of superconducting magnetic energy storage systems in grid-connected microgrids using the slap swarm algorithm based-FOPID is proposed in [33]. The adaptive FO-fuzzy-PID controller optimized by the TLBO algorithm is presented, where all the controller parameters are tuned simultaneously to handle the uncertainties caused by renewable sources, parametric and load variations [34]. An LFC strategy via FO controllers is introduced and compared with classical ones to demonstrate the superiority of FO, where the fraction of integral and derivative parts lie within the [0, 1] range [30, 35,36,37,38]. A recent innovation in this method is where the fractional integral and derivative parts do not necessarily lie within the [0, 1] range, but can be any real numbers for the differentiator and integrator orders that exhibit better dynamic response with excellent robustness to parameter uncertainties and external disturbances [23, 39,40,41].

Finally, to attain the best performance, a powerful optimizer must be applied [42, 43]. Therefore, a new and powerful algorithm such as the chaos game optimizer (CGO) is used [44]. The main idea of the CGO technique is based on the principles of chaos theory, wherein the structure of fractals by the chaos game principle and the fractal problems of self-similarity are considered. CGO has some advantages over other swarm schemes, such as fast convergence and avoiding trapping in a local minimum [44]. Thus, CGO has been used in solving many engineering problems [45,46,47]. From the above discussion, the controller enhancements come from the appropriate fractional calculus, using a cascade controller (CC), and fine-tuning of CC parameters using a powerful optimizer. Therefore, in this paper, a combination of CGO and a novel cascade FOPID–FOPI controller is proposed. This combination (CGO: FOPID–FOPI) is employed based on an integral of time multiplied by the absolute error (ITAE) criterion as a secondary controller for the study of LFC in four test systems, to demonstrate the effectiveness and robustness of the proposed CGO: FOPID–FOPI scheme.

In summary, the main contributions of this study are as follows:

  1. 1.

    The deployment of the novel CGO-based controller for dealing with LFC problems.

  2. 2.

    Optimization of the FOPID–FOPI controller parameters using four different IPS test systems.

  3. 3.

    Dynamic analysis in the presence of nonlinearities, which demonstrates the superior performance of CGO: FOPID–FOPI.

  4. 4.

    Comparison of the dynamic performance of the CGO: FOPID–FOPI controller with those of recently developed soft-computing-based controllers.

2 Systems study

2.1 Two-area IPS for a thermal unit (Test-systems 1, 2)

First, investigations are conducted on a two-area IPS with and without GDB nonlinearity. The parameters of the two systems are presented in “Appendices 1 and 2”, respectively. The two systems are referred to as Test-system 1 (without GDB) and Test-system 2 (with GDB) as shown in Fig. 1. Their transfer function (TF) models are frequently used in the literature as common test systems [10, 13, 23, 48, 49]. Each non-reheat power plant consists of a speed governing system, turbine, and generator, and has three inputs and two outputs [13]. The inputs are the tie-line power deviation \({\varDelta P}_{tie}\), controller output ΔPref, and the SLP (ΔPL), and the outputs are the generator frequency deviation Δf, and the ACE calculated as [13]:

$$\mathrm{ACE}=B\Delta f\pm \Delta {P}_{tie,}$$
(1)

where \(B\) is the frequency bias parameter. The TFs are used to designate each component in the system [13]. For non-reheat turbines, the TF is simple because it is exhibited as a first-order TF with a time constant \({T}_{t}\), as:

Fig. 1
figure 1

TF model of the two-area nonthermal unit: a without GDB (Test-system 1) and b with GDB (Test-system 2)

$${G}_{T}\left(s\right)=\frac{1}{1+{T}_{t}S},$$
(2)

When the load changes, the frequency fluctuates. The control system detects these fluctuations and adjusts the turbine to dampen the frequency fluctuations. The governor TF is modeled as:

$${G}_{G}\left(s\right)=\frac{1}{1+{T}_{g}S}$$
(3)

Because the response of the governor valve to the fluctuation of the small input signal is inapplicable, the nonlinearity of GDB is considered. The nonlinearity of GDB causes more fluctuations and degrades the overall stability of the power system [48]. The governor TF with GDB is modeled as:

$${C}_{g}=\frac{0.8-\frac{0.2}{\pi }S}{1+{T}_{g}S}$$
(4)

The governor system has two inputs ΔPref and Δf, and provides an output ΔPG, which is presented by [13]:

$$\Delta {P}_{G}=\Delta {P}_{ref}-\frac{1}{R}\Delta f,$$
(5)

where R is the speed regulation parameter. The general TF of the generator-load is described by:

$${G}_{P}\left(s\right)=\frac{{K}_{PS}}{1+{T}_{PS}S}$$
(6)

where KPS and TPS are the power system gain and time constant, respectively [13, 48]. Because of the similarity of both areas in Test-systems 1 and 2, similar controllers with the same gains are employed in areas 1 and 2.

2.2 Two-area multisource power system (Test-system 3)

To further characterize the performance of the CGO-tuned FOPID–FOPI CC, the study is expanded to a more practical multi-source IPS. The two-area six-unit IPS consists of more power generating sources such as reheat, hydro, and gas units in both area 1 and area 2 with a rating of 2000 MW, and the load is 1840 MW [10, 11, 13]. The two-area six-unit system is broadly applied and is used for the design and analysis of the automatic LFC for IPS, and its TF is displayed in Fig. 2. The nominal parameters of the studied system are displayed in “Appendix 3”. The load change ΔPL is mimicked to be close to an actual load using [50]:

Fig. 2
figure 2

TF model of two-area multi-source system (Test-system 3)

$$\Delta {P}_{\mathrm{L}}=0.6 \sqrt{{P}_{\mathrm{Load}}}$$
(7)

Therefore, ΔPL = 25 MW, which is 1.25% SLP from the power rating. In this study, the investigations are done under 2% SLP to ensure the stability of the proposed controller. Because the two areas are equivalent, the three controllers in both areas are the same. This avoids the requirement for tuning of the six controllers for the six units, which would be costly in terms of optimizing and impractical for operation.

2.3 Three-area hydrothermal IPS (Test-system 4)

A three-area thermal–thermal–hydro IPS is established and used to test the proposed approach’s capability of coping with a multi-area multi-source IPS. This system, called Test-system 4, is shown in Fig. 3, and the system parameters are listed in “Appendix 4”. It is generally recognized that power generation cannot change at an unlimited rate because of the system physics and dynamics. To limit the rate of generation change, a substantial limitation known as GRC is considered for all the areas in Fig. 3. The benchmark value of GRC for thermal plants according to the literature is 3% per min [23]. For the third area (hydro), a GRC of 360% per minute for decreasing generation and 270% per minute for increasing generation, are considered. In Test-systems 3 and 4, three controllers with several parameters must be adjusted at the same time. As a result, a strong optimizer such as CGO is required to achieve the desired performance.

Fig. 3
figure 3

TF model of three-area multi-source IPS (Test-system 4)

3 Control-approach-based performance function

3.1 Fractional-order controller

Because of their quick reaction time, strong stability under varied conditions, and excellent resilience to perturbations, fractional-order (FO) controllers have seen a notable increase in use in control system engineering. As a result, research using the FOPID controller has been conducted in a variety of application fields such as speed control of DC motors [37, 51], heat flow processes [52], and autonomous microgrid VSC systems [31], as well as LFC of IPS as previously mentioned. A common FO controller based on FO calculus is FOPID, which is referred to as \({\mathrm{PI}}^{\uplambda }{\mathrm{D}}^{\upmu }\) where λ and μ are the integral and derivative parts of non-integer orders. The TF of the FOPID controller is:

$${G}_{FOPID}\left(s\right)={K}_{P}+\frac{{K}_{I}}{{S}^{\uplambda }}+{K}_{D}{s}^{\upmu },$$
(8)

The enhancement of performance comes from the fine-tuning of the integral and derivative parts (λ and μ) besides the proportional (KP), integral (KI), and derivative (KD) gains. The tuning of λ and μ produces many controller structures. In real-time applications and computer simulations, the fraction TF of s is required to approximate to an integer-order TF. The Oustaloup filter offers this approximation within a frequency band [\({\omega }_{L}, {\omega }_{H}\)], where \({\omega }_{L}\) is the lower frequency and \({\omega }_{H}\) is the higher frequency with order N as follows [53]:

$${G}_{f}\left(s\right)={S}^{\alpha }=K\prod_{K=-N}^{N}\frac{s+{\omega }_{k}^{z}}{s+{\omega }_{k}^{p}} ,$$
(9)

where K is the gain of the filter, \({\omega }_{k}^{p}\) and \({\omega }_{k}^{z}\) are the poles and zeroes of Gf(s), respectively.

From (9), two critical factors can significantly impact the performance of the approximation, i.e., the approximation order N, and filter gain K. K is adjusted so that the approximate gain is unity at 1 rad/s. Lower N values result in easier approximation and simpler implementation, but efficiency degrades because of ripple development in the phase and magnitude response. Increasing the N value complicates the approximation and makes computation hard in real-time implementation. Therefore, choosing N is a trade-off between complexity and accuracy. In this study, N = 5 and a fitting frequency band within [\({10}^{-3}: {10}^{3}\)] rad/s is considered.

3.2 Proposed FOPID–FOPI CC

This study proposes a FOPID–FOPI CC to improve LFC performance in four IPS test systems. Figure 4a shows the proposed FOPID–FOPI CC scheme, which has not been used previously in LFC research. The processing time in any optimization problem directly depends on the number of variables in the problem. Therefore, in simulation mode, to reduce the number of controller variables, the fraction integral \(\lambda 1\) and the fraction derivative \(\mu\) are set within the [0, 1.5] range. To reduce the complexity in real implementation, instead of \(\lambda 1\) and \(\mu\), two cascaded fraction integrals \(\lambda 11\) and \(\lambda 12\) and two cascaded fraction derivatives \(\mu 11\) and \(\mu 21\) for the first FOPID controller are designed, respectively. The range of \(\lambda 11\), \(\mu 11\), and \(\lambda 21\) lie within [0, 1] range, while \(\lambda 12\) and \(\mu 12\) lie within [0, 0.5] range as shown in Fig. 4b. For example: (i) if \(\lambda 1\ge\) 1, it sets \(\lambda 11=1\) and \(\lambda 12\) equals the fraction that is more than 1; (ii) If \(\lambda 1\) \(<\) 1, \(\lambda 11\) equals the fraction that is less than 1 and \(\lambda 12=0\). These settings are also applied at \(\mu .\) The main objectives of CC are for the internal process (FOPID) to attenuate the effect of a supply disruption while the external process (FOPI) manages the final production quality [54]. A CC system can be used to quickly reject a disturbance, before it spreads to other parts of the system, to attain greater performance [26]. To implement the FOPID–FOPI CC system for the investigated process, a powerful new CGO scheme is demonstrated.

Fig. 4
figure 4

a Proposed FOPID–FOPI controller structure reduced variables (simulation mode), b proposed FOPID–FOPI controller structure (for real implementation)

3.3 Optimization of the FOPID–FOPI CC

In power systems, LFC must achieve two objectives under load perturbations, i.e., a return of the steady-state frequency to zero and maintenance of the power transfer at predetermined values. Therefore, the LFC should be tuned carefully by choosing the most suitable objective function, e.g., integral of absolute error, integral of time multiplied by squared error, integral of squared error, and ITAE. ITAE is the most meaningful objective in LFC design [11, 12]. The optimization is confirmed by reducing the value of the objective function given by the ITAE as follows:

$$\begin{aligned} &{J}_{ITAE}\,\left({\mathrm{Two}}\,{\text{areas}}\right)\\ &\quad ={\int }_{0}^{{t}_{sim}}\left(\left|\Delta {F}_{1}\right|+\left|\Delta {F}_{2}\right|+\left|\Delta {P}_{tie12}\right|\right).t.dt, \end{aligned}$$
(10)
$$\begin{aligned} &{J}_{ITAE}\,\left({\mathrm{Three}}\,{\text{area}}\right)={\int }_{0}^{{t}_{sim}}\left(\left|\Delta {F}_{1}\right|+\left|\Delta {F}_{2}\right|+\left|\Delta {F}_{3}\right|+\left|\Delta {P}_{tie12}\right|+\left|\Delta {P}_{tie13}\right|+\left|\Delta {P}_{tie23}\right|\right).t.dt,\end{aligned}$$
(11)

where \({t}_{sim}\) is the simulation time. In this paper, the adopted optimization problem is defined as:

$$Minimize\, \left(ITAE\right)$$
(12)

which is subject to:

$$\begin{aligned} {K}_{P1}^{min} &\le {K}_{P1}\le {K}_{P1}^{max}\\ {K}_{P2}^{min}&\le {K}_{P2}\le {K}_{P2}^{max} \\ {K}_{I1}^{min}&\le {K}_{I1}\le {K}_{I1}^{max}\\ {K}_{I2}^{min}& \le {K}_{I2} \le {K}_{I2}^{max}, \\ {K}_{D}^{min}& \le {K}_{D}\le {K}_{D}^{max}\\ {\lambda }_{1}^{min}& \le {\lambda }_{1}\le {\lambda }_{1}^{max} \\ {\lambda }_{2}^{min}& \le {\lambda }_{2}\le {\lambda }_{2}^{max}\\ {\mu }^{min}& \le \mu \le {\mu }^{max} \end{aligned}$$
(13)

where \(min\,\,\mathrm{and}\,\,max\) are the minimum and maximum gains of the employed FOPID–FOPI controller. The ranges of \({K}_{P1}, {K}_{P2},\) \({K}_{I1}\), \({K}_{I2}\), and KD are within [0, 3] in Test-systems 1 and 2, and within [0, 2] in Test-systems 3 and 4, whereas the ranges of λ1 and μ are within [0, 1.5] and [0, 1] for λ2 in all test systems [23].

4 Chaos game optimization

The key idea of the CGO algorithm is based on certain concepts of chaos theory in which the structure of fractals by chaos game principles and the fractals’ self-similarity problems are considered [44]. Design problems have become extremely complex and traditional algorithms based on mathematical concepts are unable to produce satisfactory results. The implementation of an efficient new optimization algorithm is therefore of great interest if it can achieve high performance, high accuracy, and improved speed when dealing with complex problems. In the CGO algorithm, chaos game theory is used as the main algorithm concept, and the algorithm formula is based on game theory.

4.1 Inspiration

Chaos theory focuses on the randomness of complex processes that are sensitive to initial conditions, and applies to current key patterns, such as fractals, repeated templates, etc., [55]. Chaos theory reveals that small change in the system’s initial conditions can result in very large changes in later conditions. In addition, the current state of the system can settle on the future state of the system, although the approximated current state can hardly determine the future state of the system.

Most chaos approaches include fractal graphical forms. A fractal is a geometric shape that is replicated in various scales and depicts them as self-similar structures. In mathematics, the chaos game is the method of constructing fractals using an initial polygon form with a random starting point. In this regard, the vertices of the main polygon/fractal should be arranged first, and an initial random point is chosen as the starting point for fractal construction. The next point is defined as a fraction of the distance between the initial point and one of the vertices of the polygon. The fractal is generated by repeating this process continuously, considering the random initial point and the random selection of the vertex in each iteration. The inspiration of CGO is shown in Fig. 5. The Sierpinski triangle is formed by using three vertices with a factor of 1/2. As the number of initial vertices for the fractal is increased to N, a Sierpinski with N − 1 dimensions can be created as presented in Fig. 6.

Fig. 5
figure 5

Inspiration for CGO

Fig. 6
figure 6

Formation of the final shape and self-similarity of the Sierpinski triangle at different scales

4.2 Mathematical model

Initially, the Sierpinski triangle is considered as the search space for solution candidates in the CGO algorithm. CGO considers several solutions (\(S\)), which denote some eligible seeds inside a Sierpinski triangle [56]. Each solution candidate (\({S}_{i}\)) consists of some decision variables (\({S}_{i,j}\)) which epitomize the position of the seeds as:

$$\begin{aligned} S&=\left[\begin{array}{c}\begin{array}{c}{S}_{1}\\ {S}_{2}\end{array}\\ \begin{array}{c}\vdots \\ {S}_{i}\\ \vdots \end{array}\\ {S}_{n}\end{array}\right]=\left[\begin{array}{cccccc}{s}_{1}^{1}& {s}_{1}^{2}& \cdots & {s}_{1}^{j}& \cdots & {s}_{1}^{d}\\ {s}_{2}^{1}& {s}_{2}^{2}& \cdots & {s}_{2}^{j}& \cdots & {s}_{2}^{d}\\ \vdots & \vdots & \cdots & \vdots & \cdots & \vdots \\ {s}_{i}^{1}& {s}_{i}^{2}& \cdots & {s}_{i}^{j}& \cdots & {s}_{i}^{d}\\ \vdots & \vdots & \cdots & \vdots & \cdots & \vdots \\ {s}_{n}^{1}& {s}_{n}^{2}& \cdots & {s}_{n}^{j}& \cdots & {s}_{n}^{d}\end{array}\right], \\ \\ & \quad \quad where\,\,\left\{\begin{array}{l}i=1, 2, \dots ,n.\\ j=1, 2, \dots ,d.\end{array}\right. \end{aligned}$$
(14)

where \(n\) is the number of solutions/eligible seeds inside the search space/Sierpinski triangle, and \(d\) is the dimension of these seeds [57]. The seeds’ initial positions \({s}_{i}^{j}\) are determined randomly as:

$${s}_{i}^{j}={x}_{i,min}^{j}+r.\left({s}_{i,max}^{j}-{s}_{i,min}^{j}\right)$$
(15)

where \(r\) is a random number within [0,1], and \({s}_{i,min}^{j}\), \({s}_{i,max}^{j}\) are the lower boundary (LB) and upper boundary (UB) for the \({j}{\text{th}}\) decision variable of the \({i}{\text{th}}\) solution, respectively. The initial seeds generated reflect the primary patterns of dynamic systems based on the theory of chaos. For each of the eligible seeds in the search space (\({\mathrm{S}}_{\mathrm{i}}\)), a temporary position triangle is drawn with three seeds: the defined Global Best (\(\mathrm{GB}\)), the mean value for each Group (\({\mathrm{M}}_{\mathrm{Gi}}\)), and the \({i}{\text{th}}\) solution applicant (\({S}_{\mathrm{i}}\)) as the certain seed. The three seeds are positioned in the \({\mathrm{S}}_{\mathrm{I}}\), GB, and \({\mathrm{M}}_{\mathrm{Gi}},\) respectively. The mathematical presentation of the first seed process is given as:

$${Seed}_{i}^{1}={S}_{\mathrm{i}}+{\mathrm{x}}_{\mathrm{i}}*\left({\mathrm{y}}_{\mathrm{i}}*GB-{\mathrm{z}}_{\mathrm{i}}*{\mathrm{M}}_{\mathrm{Gi}}\right)$$
(16)

where \({\mathrm{x}}_{\mathrm{I}}{,\mathrm{ y}}_{\mathrm{I}}, {\mathrm{z}}_{\mathrm{I}}\) represent the random integer of \(0\) or \(1\) for modelling the possibility of rolling a dice [58]. Then, the schematic presentation of the described process of the second, third and fourth seeds is formulated as:

$${Seed}_{i}^{2}=\mathrm{GB}+{\mathrm{x}}_{\mathrm{i}}*\left({\mathrm{y}}_{\mathrm{i}}*{S}_{\mathrm{i}}-{\mathrm{z}}_{\mathrm{i}}*{\mathrm{M}}_{\mathrm{Gi}}\right)$$
(17)
$${Seed}_{i}^{3}={\mathrm{M}}_{\mathrm{Gi}}+{\mathrm{x}}_{\mathrm{i}}*\left({\mathrm{y}}_{\mathrm{i}}*{S}_{\mathrm{i}}-{\mathrm{z}}_{\mathrm{i}}*GB\right)$$
(18)
$${Seed}_{i}^{4}={S}_{\mathrm{i}}\left({s}_{i}^{k}={s}_{i}^{k}+r\right)$$
(19)

where k is a random integer within [1, d]. To control and adjust the exploitation and exploration rate of the CGO algorithm, four different formulations are presented for \({\mathrm{x}}_{\mathrm{I}}\) which controls the movement boundaries of the seeds [44]:

$${\mathrm{x}}_{\mathrm{i}}=\left\{\begin{array}{l} r \\ 2*r \\ \delta *r+1 \\ \varepsilon *r+\sim \varepsilon \end{array}\right.$$
(20)

where \(\delta\) and \(\varepsilon\) are random integers within [0, 1]. The flowchart of the CGO algorithm is shown in Fig. 7. The consistency of the new solution candidates is compared to the previous ones and the lowest value is retained and the seeds with the worst fitness values are excluded equal to the worst degree of self-similarity. When the solution variables (\({s}_{i}^{j}\)) violate the limit conditions, a measured flag is specified in which a boundary change is ordered for \({s}_{i}^{j}\). The optimization process is terminated after a maximum number of iterations have been completed.

Fig. 7
figure 7

Flowchart of CGO

To attain the finest gains of the FOPID–FOPI variables, CGO requires to set the one parameter which is the number of seeds \(({N}_{seeds})\), making it a low number of runs required. The CGO algorithm is well-matured and is one of the most likely evolutionary schemes employed to solve complex engineering optimization problems, while the robustness and exploratory capability of the CGO depend on the nature and complexity of the problems.

5 Results and discussion

The four test systems are investigated to demonstrate the efficacy of the proposed scheme. An FO calculus toolbox for system modeling and control design with \(1\, \mathrm{ms}\) time step, running on an Intel Core i5 2.1 GHz processor with 8 GB of RAM, is used to simulate the proposed FOPID–FOPI controller in MATLAB/Simulink (2017b). The settling time (Ts) is calculated at 2% of SLP. The CGO procedures and the ITAE criterion are written in .mfile, and the CGO file is linked to the Simulink file for JITAE calculation. CGO employed for LFC studies is carried out before running the test systems. In each test system, to ascertain the robustness of the proposed strategy, a powerful test is applied that is capable of challenging the proposed CGO: FOPID–FOPI scheme.

5.1 Test-system 1 implementation

5.1.1 Application of CGO to LFC studies

According to the literature, the DE and PSO algorithms are capable of solving LFC issues based on different controller structures, number of areas, and different power plants [11, 59,60,61,62]. Thus, initially, to test the suitability of CGO for LFC studies, a comparison with the DE algorithm and PSO based on the proposed FOPID–FOPI controller by taking the error performance function ITAE criterion under 10% SLP at area 1 in Test-system 1 is executed. The dominant parameter of meta-heuristic algorithms is the population size. According to [63], “large initial population sizes do not outperform small populations in terms of identifying the optimum solution”. Therefore, the number of seeds in CGO is set to 15, which is sufficient to obtain an optimum solution and taking up less processing time, and the iteration number is 50 and is performed 20 times to select the best gains of the FOPID–FOPI controller corresponding to the lowest ITAE value. The default MATLAB parameter settings in PSO are used with a population size of 50 [64]. The DE parameters are population size (NP = 50), the number of generations (G = 30), step size (F = 0.2), and crossover probability (CR = 0.6) [65].

The standard deviation, average, maximum, and minimum of ITAE values are displayed in Table 1. From the statistical analysis in Table 1, the minimum value of ITAE is obtained using the proposed CGO algorithm (ITAE = 0.0091). This compares with DE (ITAE = 0.0110) and GA (ITAE = 0.0142). It is concluded that the proposed CGO algorithm is superior to other schemes in terms of average, minimum, and standard deviation values.

Table 1 Comparison of ITAE values over 20 independent runs for various schemes (Test-system-1)

5.1.2 Investigation scenarios

The investigation scenarios are listed below.

  1. 1.

    The proposed CGO: FOPID–FOPI scheme is investigated and compared with other newly published schemes when the first area is exposed to a 10% SLP.

  2. 2.

    Some system parameters increase and decrease by 25% and 50% under ΔPL1 = 10% SLP to demonstrate the stability of the system.

  3. 3.

    The first and second areas simultaneously undergo a 10% and 20% SLP, respectively, i.e., ΔPL1 = 10% SLP and ΔPL2 = 20% SLP.

For scenario 1, the adjusted controller parameters of CGO: FOPID–FOPI with 10% SLP and the competitors, and the performance analysis of ST and objective function ITAE values for Test-system 1 are presented in Table 2. CGO: FOPID–FOPI has the lowest J (ITAE = 0.0091). This compares with DSA: FOPD–FOPI (ITAE = 0.0180) and DSA: FOPID (ITAE = 0.0778). In addition, the settling times are greatly reduced in both frequency and tie-line power deviations. Figure 8 shows the dynamic response for a 10% SLP in area 1, i.e., Fig. 8a, b show the deviations in frequency in area 1 (ΔF1) and area 2 (ΔF2), respectively, and the tie-line power deviation (ΔPtie) is shown in Fig. 8c. It is seen from Fig. 8 and Table 2 that the proposed method outperforms all rivals in terms of objective function values and settling times, validating the efficacy and robustness of the proposed technique.

Table 2 Optimized controller parameters and ST and JITAE results of Test-system-1
Fig. 8
figure 8

Comparison of dynamic responses for Test-system 1 under 10% SLP in area 1: a ΔF1, b ΔF2, and c ΔPtie

In scenario 2, to determine the resilience of the closed-loop system, the power system dynamic behavior is evaluated based on variations in loading circumstances and system parameters. Some system parameters decrease and increase by 25% and 50% under ΔPL1 = 10% SLP at area 1 to verify system stability. Figures 9 and 10 depict the sensitivity analysis for Tt and T12, respectively. The results indicate that the proposed controller is resilient and works effectively in the event of parameter changes of up to 50%.

Fig. 9
figure 9

Sensitivity analysis under variation of Tt: a ΔF1 and b ΔPtie

Fig. 10
figure 10

Sensitivity analysis under variation of T12: a ΔF1 and b ΔPtie

In scenario 3, another study of a 10% step load increase in area 1 and a 20% SLP in area 2 is carried out to conclude the investigation of this test system. Figure 11 depicts the transient temporal responses which show that the proposed CGO: FOPID–FOPI performance outperforms the rivals.

Fig. 11
figure 11

Transient responses under 10% SLP in area 1 and 20% SLP in area 2: a ΔF1 and b ΔPtie

5.2 Test-system 2 investigation

The nonlinearity of GDB is examined to assess the superiority of the proposed CGO: FOPID–FOPI, as the instant response of the governor valve to the variation of the input signal is inapplicable. The nonlinearity of GDB creates greater fluctuations and reduces the power system’s overall stability [48]. To evaluate the proposed scheme’s performance under GDB, a 1% SLP at t = 0 is applied to the first region. Table 3 shows the tuned gains for the FOPID–FOPI controller, and the resulting cost function (ITAE) is compared with previously documented techniques, such as DSA-based FOPI–FOPD and FOPID controllers [23], and ISFS: PID [1], to illustrate the superiority of the proposed strategy. As seen from Table 3, the best value of ITAE is obtained using the proposed CGO: FOPID–FOPI (ITAE = 0.0028). This compares with DSA: FOPI–FOPD (ITAE = 0.0034) and DSA: FOPID (ITAE = 0.0121) controllers. In addition, the transient responses of the proposed regulators and the other schemes at 1% at area 1 are compared in Fig. 12, while the ST of the system responses Δf1, Δf2, and ΔPtie are also shown in Table 3. From Table 3 and Fig. 12, it can be seen that using the proposed method, GDB’s settling times are improved. The proposed method outperforms the compared schemes in terms of GDB nonlinearity, something which poses a practical obstacle to power systems in operation.

Table 3 Optimized controller parameters and ST and JITAE results of Test-system-2
Fig. 12
figure 12

Comparison of dynamic responses for Test-system 2 under 1% SLP in area 1: a ΔF1, b ΔF2, and c ΔPtie

5.3 Test-system 3 investigation

The proposed CGO: FOPID–FOPI CC outperforms others in a more realistic IPS paradigm with six units supplying a given load under varying conditions. In the first area, the controller settings are tuned under 2% SLP. Table 4 shows the improved controller settings as well as some system outcomes obtained with the proposed controller. Compared ith other methods such as DSA-based FOPI–FOPD and FOPID controllers [23], and MGWO-based PID controller [27], the CGO: FOPID–FOPI (ITAE = 0.0259) has the lowest ITAE at 1% load disturbance, demonstrating the applicability of the CGO algorithm for LFC problems in the IPS. This compares with DSA: FOPI–FOPD (ITAE = 0.0461), DSA: FOPID (ITAE = 1.557), and MGWO (ITAE = 0.9197). Table 4 shows the ST from the closed-loop system transient responses, i.e., ΔF1, ΔF2, and \({\mathrm{\Delta P}}_{\mathrm{tie}}\). This demonstrates that the dynamic response in terms of settling times is considerably improved. Figure 13 depicts the dynamic reaction to a 2% load perturbation in the first area. It is inferred from this scenario that the major characteristics of the dynamic response validate the superiority of the proposed CGO: FOPID–FOPI scheme in a hybrid IPS.

Table 4 Optimized controller parameters and ST and JITAE results of Test-system-3
Fig. 13
figure 13

Comparison of dynamic responses for Test-system 3 under 2% SLP in area 1: a ΔF1, b ΔF2, and c ΔPtie

5.4 Test-system 4 investigation

This study extends to a three-area hydrothermal plant and includes the nonlinearity of GRC. When a 1% SLP at t = 0 is applied in all three areas, the controller variables are adjusted using CGO by minimizing JITAE. Table 5 summarizes the optimal gains of FOPID–FOPI CC and the associated system results. The results are contrasted with the results of DSA-optimized FOPI–FOPD and FOPID controllers, as well as ISFS-optimized PID controller, to highlight the capability of the proposed controller.

Table 5 Optimized controller parameters, ST and JITAE results of Test-system-4

According to Table 5, CGO: FOPID–FOPI results in a lower value of JITAE (ITAE = 82.67) than DSA-adjusted FOPI–FOPD CC (ITAE = 147.56) and FOPID controllers (ITAE = 156.32), demonstrating that FOPID–FOPI CC outperforms FOPI–FOPD and FOPID controllers in all test systems. Figure 14 shows the transient results of Test-system 4 at 1% SLP in each area. These demonstrate that the proposed method has the lowest undershoot and is the quickest to settle. Thus, the most promising controller is the CGO-optimized FOPID–FOPI CC, which results in significant reduction in settling time when compared with other methods. Therefore, CGO-optimized FOPID–FOPI CC is proven to be capable of operating successfully in multi-area IPSs with GRC disruption.

Fig. 14
figure 14

Comparison of dynamic responses for Test-system 4 under 1% SLP applied in all areas: a ΔF1, b ΔF2, c ΔF3, d ΔPtie1, e ΔPtie2, and f ΔPtie3

6 Conclusions

Using the novel CGO method, optimally adjusted FOPID–FOPI controllers for four test systems using the ITAE objective functions are provided. To test and analyze the performance of the CGO: FOPID–FOPI scheme, a typical test system containing a two-area two-unit nonthermal plant with and without GDB nonlinearity is used. To exemplify the proposed approach, a two-area multi-source six-unit test system is investigated. Furthermore, a three-area hydrothermal unit is examined to obtain more realistic results for the LFC study and to illustrate the breadth of application of the proposed FOPID–FOPI CC. The dynamic LFC response patterns of the four test systems investigating IPSs are compared with the results from other recent studies. The dynamic response investigation confirms that FOPID–FOPI outperforms the conventional PID controller, single-stage FOPID controller, and FOPI–FOPD CC in all trials with lower oscillations and smaller settling time. Finally, the proposed CGO-tuned cascade TD-TI controller is shown to make the LFC framework resilient and produce stable and improved results across a wide range of loading circumstances.

In the future, prior to further confirming its robustness, the proposed technique will be evaluated with complicated real-world applications such as LFC with integrated electric vehicles, wind, and PV systems with time delay nonlinearity.