Cask Theory Based Parameter Optimization for Particle Swarm Optimization

  • Zenghui Wang
  • Yanxia Sun
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7928)


To avoid the bored try and error method of finding a set of parameters of Particle Swarm Optimization (PSO) and achieve good optimization performance, it is desired to get an adaptive optimization method to search a good set of parameters. A nested optimization method is proposed in this paper and it can be used to search the tuned parameters such as inertia weight ω, acceleration coefficients c1 and c2, and so on. This method considers the cask theory to achieve a better optimization performance. Several famous benchmarks were used to validate the proposed method and the simulation results showed the efficiency of the proposed method.


PSO Parameter Optimization Try and Error method Nested Optimization method Cask theory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Clerc, M.: Particle Swarm Optimization. ISTE Publishing Company (2006)Google Scholar
  3. 3.
    Ju, J., Wei, S.: Endowment versus Finance: A Wooden Barrel Theory of International Trade, CEPR Discussion Papers 5109, C.E.P.R. Discussion Papers (2005)Google Scholar
  4. 4.
    Xinchao, Z.: A perturbed particle swarm algorithm for numerical optimization. Applied Soft Computing 10, 119–124 (2010)CrossRefGoogle Scholar
  5. 5.
    Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2008)Google Scholar
  6. 6.
    Roy, R., Dehuri, S., Cho, S.B.: A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem. International Journal of Applied Metaheuristic Computing 2(4), 41–57 (2012)CrossRefGoogle Scholar
  7. 7.
    Chen, W., Zhang, J.: A novel set-based particle swarm optimization method for discrete optimization problem. IEEE Transactions on Evolutionary Computation 14, 278–300 (2010)CrossRefGoogle Scholar
  8. 8.
    Kennedy, J., Clerc, M., et al.: Particle Swarm Central (2012),
  9. 9.
    Mercer, R.E., Sampson, J.R.: Adaptive search using a reproductive metaplan. Kybernetes 7(3), 215–228 (1978)CrossRefGoogle Scholar
  10. 10.
    Keane, A.J.: Genetic algorithm optimization in multi-peak problems: studies in convergence and robustness. Artificial Intelligence in Engineering 9(2), 75–83 (1995)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Pedersen, M.E.H., Chipperfield, A.J.: Simplifying particle swarm optimization. Applied Soft Computing 10(2), 618–628 (2010)CrossRefGoogle Scholar
  12. 12.
    Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 11–18 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Zenghui Wang
    • 1
  • Yanxia Sun
    • 2
  1. 1.Department of Electrical and Mining engineeringUniversity of South AfricaFloridaSouth Africa
  2. 2.Department of Electrical engineeringTshwane University of TechnologyPretoriaSouth Africa

Personalised recommendations