1. Introduction
The new emphasis on clean energy has led to a growing interest in photovoltaic (PV) power production. To afford competitiveness to this new method of generating power, it must be made more energy-efficient and cost-effective. Having numerous applications in producing and transporting power and in mobile appliances, PV systems are embraced ever more widely, and it is anticipated that, by 2020, renewable sources will satisfy 20% of European energy demand [
1,
2]. In this context, PV plant-related financial and maintenance issues call for more efficient solar energy conversion and prolonging the useful life of PV arrays [
3].
Transient obstacles (e.g. shadow, dust, bird droppings) and irreversible deterioration (e.g. suboptimal performance, PV cell/diode malfunction) can affect PV arrays when PV systems are in use. The National Renewable Energy Laboratory (NREL) [
4,
5], reported that PV arrays aged at different paces, and PV modules deteriorated in line with Gaussian distribution, and the annual pace at which PV modules deteriorated was 0.5% [
6]. Thus, to prolong the service life and enhance the power yield of PV plants, the strategies for increasing PV power production for aged PV arrays must be explored. Substitution of aging PV modules with new ones is highly expensive, it is better to improve the efficiency of aged PV modules instead of replacing by new modules [
7].
The warrants the formulation of a novel strategy for restructuring PV modules that are dysfunctional or old. Optimally, such an approach should involve the straightforward rearrangement of PV modules to increase the power yield [
3,
8]. This kind of strategy based on the bucket effect that stems from the PV string maximum short-circuit current (
ISC). It would be advantageous to have some basic knowledge of the general aspects of how PV arrays are organised and how they function [
9].
In a PV array, PV modules can be organised and linked in various ways, with particular applications and properties being associated with every configuration format.
Figure 1 shows the fundamental formats [
10,
11], namely, series-parallel (SP), total-cross-tied (TCT), and bridge-link interconnection (BLI). SP involves the in-series connection of modules and in-parallel correlation of ensuing rows. TCT involves the in-parallel connection of modules and in-series correlation of the configurations. BLI involves the linking of ties over junction rows [
12,
13].
The limitations of SP and BLI can be most effectively overcome based on TCT. TCT involves in-parallel correlation of PV modules so that each module has the same voltage and the current over a module row is additive, with the subsequent possibility of in-series connection of the rows of modules [
14,
15]. Studies investigating how different arrangements of PV arrays perform differ in terms of the arrangement formats they focus on, with some limiting themselves to fundamental series and parallel configurations, while others focus solely on TCT [
16].
The multitude of options requiring consideration to establish the best solution is the main obstacle that has to be overcome for PV array rearrangement. Researchers have proposed different approaches in this regard. One approach proven to be suitable for sorting methods is to determine PV array rearrangement based on a genetic algorithm (GA) [
17]. Meanwhile, other rearrangement approaches are geared towards enhancing power yield in settings with shade [
18]. By prioritising the methods of array construction, however, [
18] failed to implement real-time executable control algorithms, which resulted in an unfeasible number of sensors and switches requiring complicated control algorithms to detect on/off switch turning. Unlike the approach put forward in [
18], a lower number of voltage or current sensors and switches are necessary for adaptive PV array rearrangement. In [
19], an offline rearrangement approach was devised to make aged PV systems more energy efficient by inspecting the possible options for PV module rearrangement based on the identification of the maximum power point. Meanwhile, in [
1] the ideal arrangement for balancing and attenuating the aging process of switches in the switching matrix was assessed on the basis of the Munkres algorithm [
20,
21]. Issues related to the restructuring of modules in PV arrays of different sizes can be managed via additional approaches proven to be efficient, although these are computationally too complex and time-consuming because they involve a search of every possible manner, in which restructuring can be achieved [
22].
This work primarily aims to propose an approach to repositioning PV modules to improve flaws or effects of aging of PV systems, thus increasing the power that a PV array can generate. In this context, speeding up the process of identifying the best arrangement is a key condition for the suggested algorithm. The structure of the rest of the work outlined below:
Section 2 is the problem statement.
Section 3 and
Section 4 describe the developed reconfiguration scheme for a non-uniformly aged PV array.
Section 5 shows the simulation outcomes resulting from 4 × 3 and 8 × 5, 8 × 7 PV arrays.
Section 6 presents restriction of inverter voltage.
Section 7 presents a discussion of these findings.
Section 8 reports the conclusions of our results and identifies the recommendations for future work.
4. Reconfiguration Algorithm of PV Array
An N × M PV array can typically have arrangements. This means that the number of potential methods for a 3 × 4 PV array will be 1,227,656, which will make it extremely challenging to determine the maximum power for every possible PV module arrangement for a PV array with larger N and M values. To attain the best configuration in a few iterative steps, a new reconfiguration algorithm is put forth, drawing on the principle of sorting PV modules repetitively and hierarchically. Given its close correlation with the short-circuit current of all PV modules, the aging scale (coefficient) serves as the varying parameter in the suggested algorithm. Five modules representing different levels of solar irradiance:
Module 1: solar irradiance 200 W/m2 and temperature 25 °C.
Module 2: solar irradiance 400 W/m2 and temperature 25 °C.
Module 3: solar irradiance 600 W/m2 and temperature 25 °C.
Module 4: solar irradiance 800 W/m2 and temperature 25 °C.
Module 5: solar irradiance 1000 W/m2 and temperature 25 °C.
In a suitable module, the STC specifies the short-circuit current to be 1 per unit (pu), which corresponds to 1000 W/m
2. The digits indicate the various aging factors (AF) associated with the PV modules in the array, is directly correlated with their separate short-circuit current. For instance, the optimisation issue addressed in the present work is based on an iterative and hierarchical sorting algorithm, called selection sort and use for iteration steps to achieve optimum configuration, which applied to a PV array arrangement
Figure 9. The AFs take the form of pu value of the health condition of separate PV modules and represent the working box variables. The rules suggested for this work are listed below.
The first rule specifies that equivalence exists between string one working box, string two working box and string n working box. Means that both string two and string n will have three working boxes if the string is associated with three working boxes.
The second rule specifies that, in a string, the minimal number represent the working box output. Its means that the output is the lowest among all values from high to low.
= Summation of aging factors in a series of connected modules.
- A.
Pre-arrangement can be mathematically characterised within five steps.
Step 1: Initialize the summation of for each string Pre-arrangement, as follows:
0.8 pu | 0.8 pu | 0.7 pu | 0.2 pu |
0.3 pu | 0.3 pu | 0.4 pu | 0.8 pu |
0.8 pu | 0.7 pu | 0.2 pu | 0.3 pu |
Step 2: Arrange the working boxes of Pre-arrangement in descending order, in the case study.
Select lowest number:
Step 3: Arrange the working boxes of Pre-arrangement in descending order, in the case study.
Step 4: Arrange the working boxes of Pre-arrangement in descending order.
Step 5: Arrange the working box of Pre-arrangement in descending order.
- B.
The potential PV array arrangements from initial to final string must be identified sequentially.
As shown by the equation below, the PV array takes the form of a matrix to facilitate the running of the MATLAB program.
Figure 10 illustrates the flowchart associated
N ×
M with the rearrangement algorithm for the PV array. The suggested algorithm geared towards mitigating the impact of mismatch losses between the PV modules in a given string by relocating separate PV modules in every string according to their AFs. Due to the direct correlation between aging and the short-circuit current, AFs are the only short-circuit current data needed by the algorithm. To attain the best arrangement, the algorithm run until every criterion is satisfied
Figure 10.
Before presenting the five steps of the suggested algorithm, several parameters need to be described to elucidate the rearrangement approach from the previous flowchart.
, where the number of strings in the PV array called .
Summation of aging factors in a series of connected modules.
= Minimum in a series connection for a string .
= Maximum in a series connection for a string .
= Position of PV module with a minimum in a series of connected modules.
= Position of PV module with a maximum in a series of connected modules.
Step 1: Initialize the summation of
for each string and arrange the total string level
in descending order, in the case study.
Step 2: Arrange the total string level in a downward order in the case study.
Step 3: Determine and for
Now, if , then swap with , repeat steps 1, 2 and 3.
Then,
on the left-hand side are:
Moreover,
on the right-hand side are:
Step 4: Repeat steps 1, 2 and 3 till .
Then, the sum of
the left-hand side are:
Moreover, on the right-hand side are:
Step 5: Find and for , swap the corresponding with and repeat steps 1 and 2 until the end (N–1).
Then, the final step, the sum of
in the left-hand side are:
In the right-hand side are:
According to the final step, the best arrangement exhibited by the PV array on the right-hand side (RHS). Nevertheless, a comparison conducted between every arrangement arriving at every step and the initial arrangement
Figure 9. Under non-uniform aging conditions, the ideal arrangement was obtained solely through five repetitive steps for a 3 × 4 PV array. In the case of a large PV array, execution based on a MATLAB program, with the configuration for the best power yield being represented by the enhanced form. Hence, the ideal arrangement for a 3 × 4 PV array is the PV array Post-arrangement. The PV arrays of Pre-Post arrangements are compared in
Table 2.
In
Table 3, the maximum power and voltage at MPP are set out for all arrangements and the string currents in every case. It is obvious that, from the first to the fifth step, there is a 22.4% rise in the overall output power and the voltage at MPP is greater than the output current. To minimise multiple peaks caused by incompatibility effects (non-uniform aging), the proposed algorithm increases the currents in every string as much as possible through the integration of the PV modules showing similar electrical features.
5. Simulation Results
PV arrays of different dimensions (e.g. 3 × 4, 5 × 8 and 7 × 8) were assessed to prove that the suggested algorithm was valid. A MATLAB-developed PV array model was used to compute the maximum power outputs from the PV structures pre-arrangement as well as post-arrangement. The computations were conducted with an Intel® Core™ computer with i3-3220 CPU, 30.30 GHz and 8 GB (RAM), with tabulation of the equivalent computing times for the different PV array dimensions indicated above.
- A.
Case study on 3 × 4 PV array
Figure 9 shows the MATLAB-based validation of the results. Under STC, the maximum short-circuits current in a suitable module established at 1 pu, which is equivalent to 1000 W/m
2 irradiance at a module temperature of 25 °C.
Table 2 shows the PV configuration following a rearrangement using the proposed algorithm. Using the PV array data presented in
Table 2,
I-V and
P-V curves were then plotted as depicted in
Figure 11. In
Figure 11 highlights that the maximum output power pre-arrangement, is 247.4 W, with a PV array output voltage of 51 V and a GMPP current of 4.8 A, respectively. The maximum output power post-arrangement is 320.8 W, with a PV array output voltage of 68 V and GMPP current of 4.68 A, respectively. It can be seen that the total power output increases by 29.7% as presented in
Figure 11 when using the proposed algorithm. The computational time for these rearrangements (as presented in
Table 4) for an aged 3 × 4 PV array took 0.02 s.
- B.
Case study on 5 × 8 PV array
The PV array of dimensions 5 × 8 consisted of five strings and eight modules with in parallel and in-series linking, respectively. For developing a 5 × 8 matrix, simulating non-uniform aging PV array pre-arrangement and determine the best PV structure post-arrangement for this particular case, MATLAB (R2018a) employed for arbitrary production of the AFs in the range 0.9-0.6 pu (
Table 5). The ability of the suggested algorithm to yield the ideal arrangement was confirmed by simulating both PV structures.
Figure 12 illustrates that the maximum power output pre-arrangement is 1722 W, with a PV array output voltage of 143 V and a GMPP current of 11.9 A, respectively. The maximum power output post-arrangement is 1885 W, with a PV array output voltage of 138 V and a GMPP current of 13.6 A, respectively. The computational time for the proposed algorithm to identify the rearrangements of an aged 8 × 5 PV array (as presented in
Table 6) took 0.25 s.
- C.
Case study on 7 × 8 PV array
In this case, an 7 × 8 PV array was, comprising of seven parallel-connected strings and eight series-connected modules, The aging factors, ranging from 0.9 pu to 0.4 pu (as shown in
Table 7), were randomly generated, as in case 1 and 2.
Figure 13 illustrates that the total output power increases by 32.5% when the proposed algorithm used. The computational time for the proposed algorithm to identify the rearrangements (as presented in
Table 8) took time 5.64 s.