Research Article

An Elitist Transposon Quantum-Based Particle Swarm Optimization Algorithm for Economic Dispatch Problems

Table 5

Results obtained by optimization methods (case I).

MethodsBest cost ($/h)Worst cost ($/h)Mean cost ($/h)FEsCPU time (s)

PSO [11]32858.0033331.0033105.0020,000/
GA [11]33113.0033337.0033228.0020,000/
SA-PSO [12]32708.0032789.0032732.0020,000/
IPSO [13]32,709ā€”32784.510,000/
DSPSO-TSA [14]32715.0632730.3932724.636000/
MTS [22]32716.8732796.1332767.4100,000/
IA_EDP [7]32698.2032823.7832750.2220,000/
QPSO [39]33014.2133342.3033148.776000/
QPSO-DM(1) [39]32970.8533406.2733163.266000/
QPSO-DM(2) [39]32927.9333353.2333156.346000/
QPSO-EDP(1)32707.9932718.3932712.0260004.27
QPSO-EDP(2)32710.1432719.2732716.9460006.35
DEB-QPSO32701.1632701.1832701.1760004.68

In the case of IA_EDP, power balance constraint is not satisfied.