Research Article

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

Table 6

Results obtained by optimization methods (case II).

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

NAPSO [15]121491.0662121491.5261121491.2756100,000/
FAPSO [15]122261.3706122597.5196122471.0751100,000/
PSO [15]124875.8523125368.9204125162.7011100,000/
IABC [16]121491.2751121582.3865121539.4175100,000/
IABC-LS [16]121488.7636121582.2525121526.0333100,000/
QPSO [39]126615.4498128679.5909128621.124120,000/
QPSO-DM(1) [39]131291.9433131586.1562131368.407120,000/
QPSO-DM(2) [39]131318.4412133393.5961131739.525020,000/
QPSO-EDP(1)121681.46121708.01121693.4220,0005.38
QPSO-EDP(2)121875.23121907.26121895.4920,0007.96
DEB-QPSO121472.77121483.67121477.5220,0006.15