R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proc. 6th Int. Symp. Micromachine Human Sci., Nagoya,Japan, 1995, pp. 39–43.
R. C. Eberhart and Y. H. Shi, “Particle swarm optimization: Developments, applications and resources,” in Proc. IEEE Congr. Evol. Comput.,Seoul, Korea, 2001, pp. 81–86.
X. D. Li and A. P. Engelbrecht, “Particle swarm optimization: An introduction and its recent developments,” in Proc. Genetic Evol. Comput.Conf., 2007, pp. 3391–3414.
B. Liu, L. Wang, and Y. H. Jin, “An effective PSO-based memetic algorithm for flow shop scheduling,” IEEE Trans. Syst., Man, Cybern. B,Cybern., vol. 37, no. 1, pp. 18–27, Feb. 2007.10.1109/TSMCB.2006.883272
G. Ciuprina, D. Ioan, and I. Munteanu, “Use of intelligent-particle swarm optimization in electromagnetics,” IEEE Trans. Magn., vol. 38, no. 2,pp. 1037–1040, Mar. 2002.
J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 281–295,Jun. 2006.10.1109/TEVC.2005.857610
A. Ratnaweera, S. Halgamuge, and H. Watson, “Particle swarm optimization with self-adaptive acceleration coefficients,” in Proc. 1st Int. Conf.Fuzzy Syst. Knowl. Discovery, 2003, pp. 264–268.
P. K. Tripathi, S. Bandyopadhyay, and S. K. Pal, “Adaptive multi-objective particle swarm optimization algorithm,” in Proc. IEEE Congr. Evol.Comput., Singapore, 2007, pp. 2281–2288.10.1109/CEC.2007.4424755
Y. P. Chen,W. C. Peng, andM. C. Jian, “Particle swarm optimization with recombination and dynamic linkage discovery,” IEEE Trans. Syst., Man,Cybern. B, Cybern., vol. 37, no. 6, pp. 1460–1470, Dec. 2007.
P. S. Andrews, “An investigation into mutation operators for particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., Vancouver,BC, Canada, 2006, pp. 1044–1051.
J. J. Liang and P. N. Suganthan, “Dynamic multi-swarm particle swarm optimizer with local search,” in Proc. IEEE Congr. Evol. Comput., 2005,pp. 522–528.
A. Carlisle and G. Dozier, “Adapting particle swarm optimization to dynamic environments,” in Proc. Int. Conf. Artif. Intell., Las Vegas, NV,2000, pp. 429–434.
X. Hu and R. C. Eberhart, “Adaptive particle swarm optimization: Detection and response to dynamic systems,” in Proc. IEEE Congr. Evol.Comput., Honolulu, HI, 2002, pp. 1666–1670.
M. Clerc, “The swarm and the queen: Toward a deterministic and adaptive particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., 1999,pp. 1951–1957.
[26]M. Clerc and J. Kennedy, “The particle swarm-explosion, stability and convergence in a multidimensional complex space,” IEEE Trans. Evol. Comput., vol. 6, no. 1, pp. 58–73, Feb.
2002.10.1109/4235.985692
I. C. Trelea, “The particle swarm optimization algorithm: Convergence analysis and parameter selection,” Inf. Process. Lett., vol. 85, no. 6, pp. 317–325, Mar. 2003.10.1016/S0020-0190(02)00447-7
V. Kadirkamanathan, K. Selvarajah, and P. J. Fleming, “Stability analysis of the particle dynamics in particle swarm optimizer,” IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 245–255, Jun. 2006.10.1109/TEVC.2005.857077
F. van den Bergh and A. P. Engelbrecht, “A study of particle optimization particle trajectories,” Inf. Sci., vol. 176, no. 8, pp. 937–971, Apr. 2006.10.1016/j.ins.2005.02.003
R. C. Eberhart and Y. Shi, “Tracking and optimizing dynamic systems with particle swarms,” in Proc. IEEE Congr. Evol. Comput., Seoul, Korea, 2001, pp. 94–97.
M. Clerc, “The swarm and the queen: Toward a deterministic and adaptive particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., 1999, pp. 1951–1957.
[35]M. Clerc and J. Kennedy, “The particle swarm-explosion, stability and convergence in a multidimensional complex space,” IEEE Trans. Evol. Comput., vol. 6, no. 1, pp. 58–73, Feb.
2002.10.1109/4235.985692
R. C. Eberhart and Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., 2000, pp. 84–88.
A. Ratnaweera, S. Halgamuge, and H. Watson, “Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 240–255, Jun. 2004.10.1109/TEVC.2004.826071
Y. P. Chen,W. C. Peng, andM. C. Jian, “Particle swarm optimization with recombination and dynamic linkage discovery,” IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 6, pp. 1460–1470, Dec. 2007.
P. S. Andrews, “An investigation into mutation operators for particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., Vancouver, BC, Canada, 2006, pp. 1044–1051.
J. J. Liang and P. N. Suganthan, “Dynamic multi-swarm particle swarm optimizer with local search,” in Proc. IEEE Congr. Evol. Comput., 2005, pp. 522–528.
W. J. Zhang and X. F. Xie, “DEPSO: Hybrid particle swarm with differential evolution operator,” in Proc. IEEE Conf. Syst., Man, Cybern., Oct. 2003, pp. 3816–3821.
F. van den Bergh and A. P. Engelbrecht, “A cooperative approach to particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 225–239, Jun. 2004.10.1109/TEVC.2004.826069
A. Ratnaweera, S. Halgamuge, and H. Watson, “Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 240–255, Jun. 2004.10.1109/TEVC.2004.826071
K. E. Parsopoulos and M. N. Vrahatis, “On the computation of all global minimizers through particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 211–224, Jun. 2004.10.1109/TEVC.2004.826076
R. Brits, A. P. Engelbrecht, and F. van den Bergh, “A niching particle swarm optimizer,” in Proc. 4th Asia-Pacific Conf. Simul. Evol. Learn., 2002, pp. 692–696.
R. Brits, A. P. Engelbrecht, and F. van den Bergh, “Locating multiple optima using particle swarm optimization,” Appl. Math. Comput., vol. 189, no. 2, pp. 1859–1883, Jun. 2007.
D. Parrott and X. D. Li, “Locating and tracking multiple dynamic optima by a particle swarm model using speciation,” IEEE Trans. Evol. Comput., vol. 10, no. 4, pp. 440–458, Aug. 2006.10.1109/TEVC.2005.859468
J. Kennedy and R. Mendes, “Population structure and particle swarm performance,” in Proc. IEEE Congr. Evol. Comput., Honolulu, HI, 2002, pp. 1671–1676.
J. Kennedy and R. Mendes, “Neighborhood topologies in fully informed and best-of-neighborhood particle swarms,” IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 36, no. 4, pp. 515–519, Jul. 2006.10.1109/TSMCC.2006.875410
X. Hu and R. C. Eberhart, “Multiobjective optimization using dynamic neighborhood particle swarm optimization,” in Proc. IEEE Congr. Evol. Comput., Honolulu, HI, 2002, pp. 1677–1681.
R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: Simpler, maybe better,” IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 204–210, Jun. 2004.10.1109/TEVC.2004.826074
J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 281–295, Jun. 2006.10.1109/TEVC.2005.857610
J. Kennedy and R. Mendes, “Neighborhood topologies in fully informed and best-of-neighborhood particle swarms,” IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 36, no. 4, pp. 515–519, Jul. 2006.10.1109/TSMCC.2006.875410
J. Kennedy and R. Mendes, “Population structure and particle swarm performance,” in Proc. IEEE Congr. Evol. Comput., Honolulu, HI, 2002, pp. 1671–1676.