A States of Matter Search-based Approach for Solving the Problem of Intelligent Power Allocation in Plug-in Hybrid Electric Vehicles

Recently, many researchers have proved that the electrification of the transport sector is a key for reducing both the emissions of greenhouse pollutants and the dependence on oil for transportation. As a result, Plug-in Hybrid Electric Vehicles (or PHEVs) are receiving never before seen increased attention. Consequently, large-scale penetration of PHEVs into the market is expected to take place in the near future, however, an unattended increase in the PHEVs needs may cause several technical problems which could potentially compromise the stability of power systems. As a result of the growing necessity for addressing such issues, topics related to the optimization of PHEVs' charging infrastructures have captured the attention of many researchers. Related to this, several state-of-the-art swarm optimization methods (such as the well-known Particle Swarm Optimization (PSO) or the recently proposed Gravitational Search Algorithm (GSA) approach) have been successfully applied in the optimization of the average State of Charge (SoC), which represents one of the most important performance indicators in the context of PHEVs' intelligent power allocation. Many of these swarm optimization methods, however, are known to be subject to several critical flaws, including premature convergence and a lack of balance between the exploration and exploitation of solutions. Such problems are usually related to the evolutionary operators employed by each of the methods on the exploration and exploitation of new solutions. In this paper, the recently proposed States of Matter Search (SMS) swarm optimization method is proposed for maximizing the average State of Charge of PHEVs within a charging station. In our experiments, several different scenarios consisting on different numbers of PHEVs were considered. To test the feasibility of the proposed approach, comparative experiments were performed against other popular PHEVs' State of Charge maximization approaches based on swarm optimization methods. The results obtained on our experimental setup show that the proposed SMS-based SoC maximization approach has an outstanding performance in comparison to that of the other compared methods, and as such, proves to be superior for tackling the challenging problem of PHEVs' smart charging.


Introduction
Carbon dioxide (CO 2 ) is the main pollutant gas emitted as a result of several human activities related to the combustion of fossil fuels (such as coal, natural gas, and oil).The use of fossil fuel for transportation accounts for about a 25% of the CO 2 emissions around the world, while also accounting for over a 55% of the world's oil consumption [1].However, in recent years, the traditional view of Energies 2017, 10, 92 2 of 14 power systems has been reshaped as a result of technological advances, as well several economic and environmental incentives.It has been proved by several researches that significant reductions in both green-house gas emissions and the dependence on fossil fuels could be accomplished by the electrification of the transport sector [2].As a result of this, Plug-in Hybrid Electric Vehicles (or PHEVs) have received never before seen increased attention related to their low emission of pollutants and overall low energy cost.Recent PHEVs technologies promise to increase the overall fuel efficiency by implementing specialized battery systems, which could allow such hybrid vehicles to be charged from traditional power grid systems.In this sense, the currently growing PHEVs tendency promises to shift the current energy demand from fossil fuel to electricity [3].
Statistics provided by the Electric Power Research Institute (EPRI) suggest that by the year 2050 about 62% of the United States vehicle fleet will be comprised of PHEVs [4].However, an unattended increase of PHEV needs may threaten the stability of power systems, and as such, there is a growing necessity for addressing the technological implications.Furthermore, the power demand patterns related to differences in the needs of multiple PHEVs within a charging station have a naturally significant impact on the electric power market, and therefore, it must also be considered [5].
There is a growing need for more efficient algorithms and mechanisms which could allow smart grid technologies to handle complex problems (such as energy management, efficient charging infrastructure, cost reduction, etc.), subject to a wide variety of different objectives and system constraints.In order to both maximize customer satisfaction and minimize the burdens and disturbances to the power grid, an specialized control approach is required to properly handle multiple PHEV battery loads [6].These control mechanisms must consider several real-world constraints, such as variations on the infrastructure and communication among individual vehicles.They must also be able to adapt to differences in times between arrivals and departures, as well as the number of PHEVs within the charging station.A crucial constraint for accurate charging of PHEVs is related their battery State-of-Charge.The State-of-Charge (or SoC) is a parameter which measures the amount of electrical energy stored in a vehicle's battery.In fact, the performance of PHEVs is highly dependent on the proper management of electric power, which is solely dependent on the battery's SoC.
Recently, many researchers have focused their efforts on improving the interaction between PHEVs and the electric power grid by proposing a wide variety of intelligent power allocation frameworks.One of the most popular approaches to solve these power allocation problems involves the use optimization techniques known as swarm-optimization methods [7].In [8,9], respectively, the Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) methods have been successfully applied for solving the problem of smart power management among a given number of PHEVs under different SoC conditions.While the PSO and GSA methods are known for providing acceptable results, such techniques have a tendency to produce suboptimal solutions related to a lack of balance between the exploration and exploitation of solutions [10,11].
In this paper, the recently developed swarm optimization method known as State of Matter Search (SMS) is proposed for solving the problem of intelligent power allocation on PHEVs.In the SMS method, individual particles emulate a set of molecules which interact in correspondence to a set of evolutionary operators based on the principles of thermal-energy motion [12].The SMS combines the use of such operators with a unique control strategy based on the states of matter transitions which modifies the parameter setting of each operation during the evolutionary process.In contrast to other swarm optimization techniques, the computational procedures incorporated in the SMS approach yield a better balance between the exploration and exploitation of solutions, typically leading to better results [12].In order to prove its feasibility for solving the proposed optimization problem, the SMS was compared in terms of performance with several other state-of-the-art swarm optimization methods such as PSO and GSA.The rest of this paper is organized as follows: in Section 2, the Intelligent PHEVs charging optimization problem foundations are presented.In Section 3, the main traits of the SMS optimization method are highlighted.In Section 4, we present our experimental setup and results.Finally, in Section 5, conclusions are drawn.

Problem Formulation
The main motivation behind a smart charging scheme is to charge a vehicle whenever it is most beneficial, such as when the price of electricity and the total power demand are low, or when the generated power reaches an excess capacity [13].In order for the system to be effective, it should allow most PHEVs to leave the charging station prior to their expected charging time.
Suppose there is a charging station with a total power capacity P specifically designed to charge Plug-in Hybrid Vehicles (PHEVs).The main objective is to allocate power intelligently for each individual PHEV that comes into the charging station.In order to do so, it is necessary to consider each PHEV's State-of-Charge (SoC).Each vehicle's SoC changes constantly as a result of the charging process, so, it is necessary to keep track of such changes in order to allocate power effectively.Therefore, each vehicle's current SoC represents the main parameter which has to be maximized in order to ensure a proper power allocation.To do so, an objective function which takes into account several constraints (such as charging time, current SoC, and price of the energy) is considered for the maximizing the of average State-of-Charge [14].
In order to illustrate this, let N stand for the number of PHEVs that need to be served on a regular 24-h day.Let k denote a fixed time step for which we aim to maximize the average State-of-Charge J(k).An objective function which models such a maximization case may be defined as follows: where w i (k) denotes a weighting term associated to a given PHEV i at time step k, SoC i (k + 1) stands for the vehicle's State-of-Charge at time step k + 1.In the proposed approach, it is assumed that the charging current remains constant for every instant of time.That is: It follows that: where the sample time ∆t is defined by the charging station operators and I i (k) is the charging current over ∆t.Furthermore, the PHEV's battery unit is modeled as a capacitor circuit, where the battery's power capacity C i is represented by its respective capacitance value (in Farad).
Therefore, over a small time interval, the change of voltage could be assumed to be linear, such that: from which it follows that: Also, since our decision variable is the power allocated to each individual PHEV, we replace the current term I i (k) as follows: where P i (k) represents the amount of electric power assigned to the i-th vehicle on the charging station, while V i (k) = 0.5 • (V i (k + 1) + V i (k)) denotes the average voltage between the voltage values at time steps k and k + 1.By replacing I i (k) on Equation (3), it follows that: where V i (k + 1) is obtained by replacing I i (k) in Equation ( 6).This yields: We may finally represent the objective function J(k) as follows: which is subject to: 0 where P utility = P i,max • N denotes the maximum power that can be provided by a charging station with capacity for N PHEVs [15], while P i,max stands for the maximum power that can be absorbed by a specific PHEV.Also, η denotes the efficiency of the charging station (typically of 90%) and it is assumed to be constant.Furthermore, SoC i,max = 0.8 stands for SoC limit related to the i-th PHEV [9] (see Table 1).In practice, it is not recommended to fully charge a PHEV's battery due to the risk of a possible overload.As such, the value SoC i,max is set as a security measure in order to prevent damage to the battery [16].
Finally, the charging weight w i (k) is expressed as a function of three particular parameters, defined as follows: where ) denotes the proportion of the i-th PHEV's rated battery capacity C i that remains to be filled at a given time step k.Furthermore, t i (k) stands for the i-th PHEV's remaining charging time at time step k, and d i (k) represents the difference between the price of the real-time energy and the price that a specific customer at the i-th PHEV charger is willing to pay at such time step k [17].In this case, the weighting term w i (k) gives a degree of preference which is proportional to certain specific attributes of each individual PHEV; i.e., if a given PHEV has both, a lower initial State-of-Charge and less remaining charging time, but the driver is eager to pay a higher price, the system will provide more power to this particular PHEV battery charger: It is worth noting that the terms c i (k), d i (k) and t i (k) are not of the same scale, and as such all terms must be normalized to assign similar relevance to each of them.Furthermore, the charging station operators may also manifest several different interests, which could be influential when assigning an importance factor to each these terms.With that being said, we may express each weighting term as follows: Energies 2017, 10, 92 5 of 14 where α 1 , α 2 and α 3 denotes the importance factors assigned to the terms c i (k), d i (k) and t i (k) respectively, and such that ∑ j α j = 1.In the proposed approach, it is assumed that α 1 = α 2 = α 3 at every time step k.

The States of Matter Search (SMS) Algorithm
The States of Matter Search (SMS) is a swarm optimization method which emulates the states of matter phenomenon.In this optimization approach, individuals within a population of search agents are represented as molecules which interact with each other by computing a set of unique evolutionary operators based on the physical principles of the thermal-energy motion mechanism [18].
The SMS's evolutionary process is divided in three sequential stages: (1) a gas state in which the molecules experience severe displacements and collisions; (2) a liquid state in which there is a significant reduction of molecular movement; and (3) a solid state in which the force among particles becomes so strong that molecular movement is almost completely inhibited.As the SMS evolutionary process transitions from one stage to another, different movement behaviors are exhibited by the molecules within a given search space.Such behaviors allow the SMS method to preserve a better balance between the exploration and exploitation of solutions, allowing the evolutionary process to find potentially better solutions [19].

States of Matter Transition
As previously stated, in the States of Matter Search (SMS) approach the whole optimization process is divided into three different stages: (1) gas state; (2) liquid state; and (3) solid state.The gas state comprises the first stage of the SMS method.In this stage, molecules experience severe displacements and collisions.The gas state lasts for 50% of the total iterations which comprise the whole SMS's optimization process.The next stage in the SMS optimization process is the liquid state.In this stage, the motion and collisions exhibited by the molecules within the search space are more restricted in comparison to the gas state.The liquid state lasts for 40% of the total iterations of the SMS evolution process.The third and last stage of the SMS optimization method is represented by the solid state.In this stage, forces among particles are much stronger in comparison to the previous SMS stages, which in turn prevents particles from moving freely.The solid state lasts for only the remaining 10% of total SMS's iterations.The overall transition of the SMS optimization process is described in Figure 1.
During each SMS stage, a series of parameters α, β and γ (which are employed on the molecular movement operators described in Section 3.2) are all modified, allowing SMS to control the way in which the molecules move on each of such stages.Table 2 shows the SMS parameters setup corresponding to each particular SMS stage, as given by its own reference [12].During each SMS stage, a series of parameters , and (which are employed on the molecular movement operators described in Section 3.2) are all modified, allowing SMS to control the way in which the molecules move on each of such stages.Table 2 shows the SMS parameters setup corresponding to each particular SMS stage, as given by its own reference [12].

Molecule Movement Operators
In the SMS approach, search agents are treated as molecules whose positions within a multidimensional space are changed as the algorithm evolves.In the SMS, the movement of such molecules is analogous to the principles which govern the motion of thermal-energy.The movement of every molecule is determined by considering: (1) the attraction force among the molecules; (2) a series of collision phenomenon; and (3) some random phenomena experienced by the molecules [18].

Direction of Movement
The direction vector operator indicates the way in which molecules will change their positions as the SMS's evolution process develops.For each -dimensional molecule within the total population of molecules , an -dimensional direction vector is assigned to each particle.During the SMS's initialization process, all direction vectors ( = { , , … }) are randomly initialized with values within the range [−1, 1].
As the system develops, the molecules within the search space experience several attraction forces.This attraction force is modeled as a movement towards the best solution found so far by the evolutionary process.Therefore, at each iteration of the evolutionary process, the direction vector update is computed as follows: where = ( − )/‖ − ‖ denotes a unitary attraction vector toward the best individual seen so-far ( ), represent the current iteration number, and stand for the total iterations number which constitute the entire evolution process.
Once a movement direction has been assigned to a given molecule its respective velocity vector is then computed and assigned to the particle.The magnitude is computed as follows: where denotes a velocity magnitude which is calculated as follows:

Molecule Movement Operators
In the SMS approach, search agents are treated as molecules whose positions within a multi-dimensional space are changed as the algorithm evolves.In the SMS, the movement of such molecules is analogous to the principles which govern the motion of thermal-energy.The movement of every molecule is determined by considering: (1) the attraction force among the molecules; (2) a series of collision phenomenon; and (3) some random phenomena experienced by the molecules [18].

Direction of Movement
The direction vector operator indicates the way in which molecules will change their positions as the SMS's evolution process develops.For each n-dimensional molecule p i within the total population of molecules P, an n-dimensional direction vector d i is assigned to each particle.During the SMS's initialization process, all direction vectors (D = {d 1 , d 2 , . . .d N }) are randomly initialized with values within the range [−1, 1].
As the system develops, the molecules within the search space experience several attraction forces.This attraction force is modeled as a movement towards the best solution found so far by the evolutionary process.Therefore, at each iteration of the evolutionary process, the direction vector update is computed as follows: where a i = p best − p i / p best − p i denotes a unitary attraction vector toward the best individual seen so-far (p best ), k represent the current iteration number, and itern stand for the total iterations number which constitute the entire evolution process.Once a movement direction has been assigned to a given molecule p i its respective velocity vector v i is then computed and assigned to the particle.The magnitude is computed as follows: where v init denotes a velocity magnitude which is calculated as follows: denote the lower and upper j-th parameter bounds respectively, while n stands for the total number of decision variables (dimensions).Furthermore, α ∈ [0, 1] denotes a scalar factor whose value depends on the current SMS stage (see Table 2).
Finally, the position of each molecule for each molecule p i is updated as follows: where rand(0, 1) stand for a random number generated within the range of [0, 1], while γ ∈ [0, 1]  stands for a scalar factor whose value depends on the current SMS stage (see Table 2).

Collisions
The collision operator emulates the collision phenomenon that molecules suffer when they interact with each other.The collision operator is only calculated if the distance between two different molecules p i and p q is smaller than a given collision radius r, calculated as follows: where b low j and b high j represent the lower and upper j-th parameter bounds respectively, while n stands for the total number of decision variables (dimensions).Furthermore, β ∈ [0, 1] denotes a scalar factor whose value depends on the current SMS stage (see Table 2).
In other words, if p i − p q < r, it is assumed that molecules p i and p q have entered into collision; in such a situation, the direction vectors d i and d q corresponding to each involved particle are exchanged, such that: The collision operator provides SMS the ability to control the diversity of solutions by forcing molecules to change their directions whenever they get close to each other, which prevents them from prematurely overcrowding a given region within the search space.

Random Behavior
In order to simulate the random behavior commonly demonstrated by molecules during their transition from one matter state to another, the SMS method integrates an operator which, by following a probabilistic criterion, allows it to randomly change the positions of molecules within a given search space.Under such operation, each molecule within the set of positions P k+1 = p k+1 1 , p k+1 2 , . . ., p k+1 N (which corresponds to the set of positions generated by computing the movement operators described in Section 3.2.1) is assigned a probability of changing its current position with that of a randomly generated molecule within the feasible search space.This mechanism may be modeled as follows: denote the lower and upper j-th parameter bounds respectively, while rand(0, 1) stand for a random number within the range [0, 1].Furthermore, P represents the probability that a given particle has to change its current position and its value (as mentioned in Section 3.2) depending on the current SMS stage (see Table 2).

SMS-Based Smart Power Allocation for PHEVs
In this paper, the States of Matter Search (SMS) algorithm (as described in Section 3) is proposed to solve the problem of smart power allocation for PHEVs.As illustrated in Section 2, the main objective of a PHEV's smart power allocation algorithm may be described as follows: For a given time step k, find an optimal power allocation configuration [P 1 (k), P 2 (k), . . . ,P N (k)] which leads to the average State-of Charge J(k) (as given by Equation ( 10)) yielding a maximum value.
In the proposed approach, the SMS algorithm starts by generating a set of N molecules P(k) = {p 1 (k), p 2 (k), . . . ,p N (k)} within a feasible search space.In the context of a PHEV's smart power allocation problem, the positions occupied by each molecule p j (k) ∈ P(k) (with k denoting a specific time step) represents a specific power allocation vector, given as follows: p j (k) = p j,1 (k), p j,2 (k), . . . ,p j,n (k) (24) where the elements p j,i (k) represent the total power allocated to the i-th PHEV at a given time step k, and where j ∈ {1, 2, . . . ,N} represents the index of the j-th molecule.
Guided by the SMS's unique evolutionary operators, each molecule p j (k) moves around a feasible search space while looking for an optimal power allocation vector configuration.The quality (fitness) of each of molecule p j (k) is evaluated by considering the average State-of-Charge function given by Equation (10), such that: where J p j (k) represents the average State-of-Charge computed with regard to the power allocation vector corresponding to the molecule p j (k) at a given time step k.Furthermore, since J p j (k) is given for a specific time step k (each defined by charging time of length ∆t = 20 min, as given in Table 1) within a regular 24-h day, an optimal power allocation vector must be found for each finite time period.Figure 2 illustrates an example of several power allocation configurations, assigned to 50 PHEVs during a regular 24-h day.

SMS-Based Smart Power Allocation for PHEVs
In this paper, the States of Matter Search (SMS) algorithm (as described in Section 3) is proposed to solve the problem of smart power allocation for PHEVs.As illustrated in Section 2, the main objective of a PHEV's smart power allocation algorithm may be described as follows: For a given time step , find an optimal power allocation configuration [ ( ), ( ), … , ( )] which leads to the average State-of Charge ( ) (as given by Equation ( 10)) yielding a maximum value.
In the proposed approach, the SMS algorithm starts by generating a set of molecules ( ) = { ( ), ( ), … , ( )} within a feasible search space.In the context of a PHEV's smart power allocation problem, the positions occupied by each molecule ( ) ∈ ( ) (with denoting a specific time step) represents a specific power allocation vector, given as follows: where the elements , ( ) represent the total power allocated to the -th PHEV at a given time step , and where ∈ {1,2, … , } represents the index of the -th molecule.
Guided by the SMS's unique evolutionary operators, each molecule ( ) moves around a feasible search space while looking for an optimal power allocation vector configuration.The quality (fitness) of each of molecule ( ) is evaluated by considering the average State-of-Charge function given by Equation (10), such that: where ( ( )) represents the average State-of-Charge computed with regard to the power allocation vector corresponding to the molecule ( ) at a given time step .Furthermore, since ( ( )) is given for a specific time step (each defined by charging time of length ∆ =20 min, as given in Table 1) within a regular 24-h day, an optimal power allocation vector must be found for each finite time period.Figure 2 illustrates an example of several power allocation configurations, assigned to 50 PHEVs during a regular 24-h day.
The algorithm's learning factors were set to c 1 = 2 and c 2 = 2. (2) GSA: The initial gravitation constant value has been set to G o = 100, while the constant parameter alpha has been set to α = 20, as given in [21].
(3) FA: The parameters setup for the randomness factor and the light absorption coefficient are set to α = 0.2 and γ = 1.0 respectively, as illustrated on its own reference [22].(4) GA: The crossover and mutation probabilities are both set to c p = 0.8 and m p = 0.2 respectively [24].( 5) SMS: This algorithm was implemented by considering the parameter setup illustrated in Section 3 (see Table 2), as recommended in [12].
In addition, a randomized PHEV charging algorithm (referred as RCA in this paper) in which the power allocation vectors p j (k) at each step k are randomly assigned was also implemented.
For our experiments, several PHEVs' smart charging scenarios were simulated.As illustrated in Section 4, the general procedure consists of finding an optimal power allocation vector at each finite time step k (where k = 1, 2, . . ., 72 when ∆t = 20 min) within a regular 24-h day.Each of the compared methods are required to run a total of 72 times to complete a single simulation.For our purposes, five different PHEV power allocation scenarios were considered.For each of the scenarios, a fixed number of PHEVs at a time (50, 100, 300, 500 and 1000) is taken into account when performing a simulation.Each scenario was simulated a total of 50 times, by considering a population size of 50 individuals (search agents) and a maximum of 100 iterations for each simulation.All calculations were performed on an AMD (R) A6-5400k CPU 3.60 GHz, 4.0 GB RAM, Microsoft 64 bit Windows 7 OS, and MATLAB© R2015A.
The experimental setup aims to compare the proposed approach's performance against those of PSO and GSA.In each approach, performance is evaluated by averaging the values obtained by computing the objective function J(k) (as given by Equation ( 25)) at each time step k of an individual 24-h day simulation (see Figure 3).The results for 50 individual runs are reported in Table 3, where the best outcome for each particular PHEVs' smart charging scenario is boldfaced.The reported results consider the following performance indexes: The Average Best-so-far (AB) solution, the Median Best-so-far (MB) and the Standard Deviation (SD) of the best-so-far solution.According to this table, the SMS algorithm performance is superior to those of the other compared methods.Such a large difference in performance is intuitively related the SMS method´s better trade-off between exploration and exploitation.Furthermore, as illustrated in Figure 4, which represents the evolution curves for each particular smart charging scenarios, GSA has a slower convergence rate in comparison to the other methods.On the other hand, PSO and SMS show to have the fastest convergence rate, with them finding their best solutions in less than 20 iterations on average.However, it is still clear that the SMS algorithm surpasses all of the compared methods, in terms of solution quality.Finally, in Table 4, the computational times (in seconds) corresponding to each of the compared methods are shown.As evidenced in the table, the computational times corresponding to the SMS method for each given PHEVs' smart charging scenario are in between those of the other compared methods, with the GSA algorithm taking the most time to complete a given simulation.While PSO has a clear advantage against SMS and GSA in terms of computational time, the superior performance and quality of our proposed approach more than makes up for such differences.The non-parametric statistical significance proof known as the Wilcoxon's rank sum test for independent samples [25,26] was conducted over the best fitness values found by each of the compared method on 50 independent test runs (50 samples per set).Table 5 reports the -values produced by the Wilcoxon's test for the pair-wise comparison over two independent fitness samples (SMS vs. PSO, SMS vs. GSA, SMS vs. GA, SMS vs. FA and SMS vs. RCA), by considering a 5% significance level.As a null hypothesis, it is assumed that there is a significant difference between mean values of two algorithms.On the other hand, the alternative hypothesis (rejection of the null hypothesis) considers that the difference between the mean values of both approaches is insignificant.As shown by all of the -values reported in Table 5 there is enough evidence to reject the null hypothesis (this is that all values are less than 0.05, and as such satisfy the 5% significance level criteria).Such evidence indicates that the proposed method's results are statistically significant and that they had not occurred by coincidence (i.e.due to common noise contained in the process).The non-parametric statistical significance proof known as the Wilcoxon's rank sum test for independent samples [25,26] was conducted over the best fitness values found by each of the compared method on 50 independent test runs (50 samples per set).Table 5 reports the p-values produced by the Wilcoxon's test for the pair-wise comparison over two independent fitness samples (SMS vs. PSO, SMS vs. GSA, SMS vs. GA, SMS vs. FA and SMS vs. RCA), by considering a 5% significance level.As a null hypothesis, it is assumed that there is a significant difference between mean values of two algorithms.On the other hand, the alternative hypothesis (rejection of the null hypothesis) considers that the difference between the mean values of both approaches is insignificant.As shown by all of the p-values reported in Table 5 there is enough evidence to reject the null hypothesis (this is that all values are less than 0.05, and as such satisfy the 5% significance level criteria).Such evidence indicates that the proposed method's results are statistically significant and that they had not occurred by coincidence (i.e.due to common noise contained in the process).

Conclusions
In this paper, the swarm optimization method known as States of Matter Search (SMS) was applied to solve the problem of smart power allocation for PHEVs.In the SMS approach, individual molecules that move around a given search space guided by unique evolutionary operators based on the principles of motion of thermal energy.The mechanisms and operators employed by SMS provide a better balance between the exploration and exploitation of new solutions, which in turn prevents several issues commonly found in other swarm optimization methods, such as those related to premature convergence.
The performance of the proposed method has been compared to other similar approaches in terms of performance and solution quality.Such comparisons were made by a cost function which takes into account the average state of charge of several hybrid vehicles within a charging station at different time steps of a regular 24-h day.Furthermore, several different PHEVs smart charging scenarios were also considered while performing the experimental comparisons.Experimental results show that, compared to the other compared methods, the proposed SMS-based PHEVs' smart power allocation approach yields significantly better results in terms of both performance and solution quality, which further proves the proficiency of the proposed approach for solving the complex problem of smart power allocation for PHEVs.

Figure 1 .
Figure 1.States of Matter Search (SMS) evolution process.

Figure 1 .
Figure 1.States of Matter Search (SMS) evolution process.

Figure 2 .
Figure 2. Illustration of different power allocation configurations assigned to 50 PHEVs during a regular 24-h day.

Figure 2 .
Figure 2. Illustration of different power allocation configurations assigned to 50 PHEVs during a regular 24-h day.

Figure 3 .
Figure 3. Cost function values ( ) obtained for a simulated PHEVs' smart charging scenario consisting of 50 PHEVs, corresponding to: (a) PSO; (b) GSA; (c) SMS; (d) GA; (e) FA and (f) RCA.In each case, the average values , corresponding to the average of all ( ) values obtained during a single simulation, are indicated.

Figure 3 .
Figure 3. Cost function values J(k) obtained for a simulated PHEVs' smart charging scenario consisting of 50 PHEVs, corresponding to: (a) PSO; (b) GSA; (c) SMS; (d) GA; (e) FA and (f) RCA.In each case, the average values J avg , corresponding to the average of all J(k) values obtained during a single simulation, are indicated.

Table 1 .
Parameter settings for the PHEV's smart power allocation objective function.

Table 2 .
States of Matter Search (SMS) parameters setup.

Table 2 .
States of Matter Search (SMS) parameters setup.

Table 3 .
Maximization results for several PHEVs' smart charging scenarios, considering n = 50 individual runs and maximum number of iterations itern = 100.

Table 3 .
Maximization results for several PHEVs' smart charging scenarios, considering = 50 individual runs and maximum number of iterations = 100.

Table 4 .
Computation times for several different PHEVs' smart charging scenarios.Al reported times are expressed in seconds (s).

Table 5 .
-values produced by the Wilcoxon test.The table shows the comparisons for SMS vs. PSO, SMS vs. GSA, SMS vs. GA, SMS vs. FA and SMS vs. RCA over the "averaged best fitness values".

Table 4 .
Computation times for several different PHEVs' smart charging scenarios.Al reported times are expressed in seconds (s).