Advertisement

OPSEARCH

, Volume 46, Issue 1, pp 3–24 | Cite as

Hybridization of particle swarm optimization with quadratic approximation

  • Kusum Deep
  • Jagdish Chand Bansal
Theory and Methodology

Abstract

Particle swarm optimization (PSO) has been extensively used in recent years for the optimization of nonlinear optimization problems. Two of the most popular variants of PSO are PSO-W (PSO with inertia weight) and PSO-C (PSO with constriction factor). Efforts have also been made to hybridize PSO with other methodologies to improve its performance. In this paper we present the hybridization of PSO with quadratic approximation operator (QA). The hybridization is performed by splitting the whole swarm into two subswarms in such a way that the PSO operators are applied on one subswarm, whereas the QA operator is applied on the other subswarm, ensuring that both subswarms are updated using the global best particle of the entire swarm. Based on this concept, two algorithms, namely qPSO-W and qPSO-C have been developed and their performance is evaluated with respect to PSO-W and PSO-C on the basis of 15 benchmark test problems and 3 real life problems taken from literature. The numerical and graphical results are a proof that the hybridized approach is a definite improvement in terms of efficiency, reliability and robustness.

Keywords

Particle swarm optimization Quadratic approximation Nonlinear optimization Hybridization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Kennedy, J., Eberhart, R.: Particle swarm optimization. Proceedings IEEE International Conference Neural Networks, 4, 1942–1948 (1995)CrossRefGoogle Scholar
  2. [2]
    Arumugam, M., Senthil, Rao, M.V.C., Tan Alan W.C.: A novel and effective particle swarm optimization like algorithm with extrapolation technique. Applied Soft Computing, 9, 308–320 (2009)CrossRefGoogle Scholar
  3. [3]
    Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computations, 1, 67–82 (1997)CrossRefGoogle Scholar
  4. [4]
    Angeline, P.J.: Using selection to improve particle swarm optimization. Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1998), Anchorage, Alaska, USA, 84–89 (1998)Google Scholar
  5. [5]
    Løvbjerg, M., Rasmussen, T., Krink, T.: Hybrid particle swarm optimizer with breeding and subpopulations. Proceedings of the 3rd Genetic and Evolutionary Computation Conference (GECCO-2001), 1, 469–476 (2001)Google Scholar
  6. [6]
    Miranda, V., Fonseca, N.: New evolutionary particle swarm algorithm (EPSO) applied to voltage/VAR control. The 14th Power Systems Computation Conference (PSCC’02), Seville, Spain (2002)Google Scholar
  7. [7]
    Løvbjerg, M., Krink, T.: Extending particle swarms with self-organized criticality. Proceedings of the 4th Congress on Evolutionary Computation (CEC-2002), 1588–1593 (2002)Google Scholar
  8. [8]
    Blackwell, T., Bentley, P.J.: Don’t push me! Collision-avoiding swarms. IEEE Congress on Evolutionary Computation, 2002 Honolulu, Hawaii USA, 1691–1696 (2002)Google Scholar
  9. [9]
    Krink, T., Vesterstrøm, J.S., Riget, J.: Particle swarm optimization with spatial particle extension. Proceedings of the 4th Congress on Evolutionary Computation (CEC-2002), 1474–1479 (2002)Google Scholar
  10. [10]
    Higashi, N., Iba, H.: Particle swarm optimization with Gaussian mutation. Proceedings of the IEEE swarm intelligence symposium 2003 (SIS 2003), Indianapolis, Indiana, USA, 72–79 (2003)Google Scholar
  11. [11]
    Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time varying accelerating coefficients. IEEE Transactions on Evolutionary Computation 8, No. 3, 240–255 (2004)CrossRefGoogle Scholar
  12. [12]
    Juang, C. F.: A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Trans Syst Man Cybern — Part B: Cybern 34(2), 997–1006 (2004)CrossRefGoogle Scholar
  13. [13]
    Blackwell, T., Bentley, P.J.: Don’t push me! collision-avoiding swarms. IEEE Congress on Evolutionary Computation, 2002 Honolulu, Hawaii USA, 1691–1696 (2002)Google Scholar
  14. [14]
    Robinson, J., Sinton, S., Rahmat-Samii, Y.: Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna. IEEE International Symposium on Antennas & Propagation. San Antonio, Texas, 314–317 (2002)Google Scholar
  15. [15]
    Jian, M., Chen, Y.: Introducing recombination with dynamic linkage discovery to particle swarm optimization. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2006), 85–86 (2006)Google Scholar
  16. [16]
    Grimaccia, F., Mussetta, M., Zich, R.E.: Genetical swarm optimization: self-adaptive hybrid evolutionary algorithm for electromagnetics. Antennas and Propagation, IEEE Transactions on, 55(3), 781–785 (2007)CrossRefGoogle Scholar
  17. [17]
    Poli, R., Di, Chio. C., Langdon, W.B.: Exploring extended particle swarms: a genetic programming approach. In: Beyer, H.-G. et al. (eds.), GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, Washington, DC, pp. 169–176. New York: ACM (2005)CrossRefGoogle Scholar
  18. [18]
    Poli, R., Langdon, W.B., Holland, O.: Extending particle swarm optimization via genetic programming. In: Keijzer, M. et al. (eds.) Lecture notes in computer science. Proceedings of the 8th European Conference on Genetic Programming, Lausanne, Switzerland. vol. 3447, pp. 291–300. Berlin: Springer (2005)Google Scholar
  19. [19]
    Krink, T., Løvbjerg, M.: The lifecycle model: combining particle swarm optimisation, genetic algorithms and hillclimbers. Proceedings of Parallel Problem Solving from Nature (PPSN), Granada, Spain, 621–630 (2002)Google Scholar
  20. [20]
    Hendtlass, T.: A combined swarm differential evolution algorithm for optimization problems. Proceedings of the 14th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. Lecture Notes in Computer Science, vol. 2070, pp. 11–18 Springer-Verlag (2001)Google Scholar
  21. [21]
    Zhang, WJ., Xie, XF.: DEPSO: hybrid particle swarm with differential evolution operator. IEEE International Conference on Systems, Man and Cybernetics (SMCC), Washington DC, USA, 3816–3821 (2003)Google Scholar
  22. [22]
    Hendtlass, T., Randall, M.: A survey of ant colony and particle swarm metaheuristics and their application to discrete optimization problems. Proceedings of The Inaugural Workshop on Artificial Life (AL’01), 15–25 (2001)Google Scholar
  23. [23]
    Van den Bergh, F., Engelbrecht, A.P.: A cooperative approach to particle swarm optimization”, IEEE Transactions on Evolutionary Computation, 8(3) 225–239 (2004)CrossRefGoogle Scholar
  24. [24]
    Parsopoulos, K.E., Vrahatis, M.: On the computation of all global minimizers through particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 211–224 (2004)CrossRefGoogle Scholar
  25. [25]
    Xie, X., Zhang, W., Yang, Z.: A dissipative particle swarm optimization. IEEE Congress on Evolutionary Computation, 2002, Honolulu, Hawaii USA, 1456–1461 (2002)Google Scholar
  26. [26]
    Liu, H., Abraham, A.: Fuzzy adaptive turbulent particle swarm optimization. Proceedings of 5th International Conference on Hybrid Intelligent Systems (HIS’05), Rio de Janeiro, Brazil, 6–9 November 2005, 39–47 (2005)Google Scholar
  27. [27]
    Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing: an International Journal, 7(1), 109–124 (2008)CrossRefGoogle Scholar
  28. [28]
    Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. Proceedings of the IEEE International Conference on Evolutionary Computation, Piscataway, NJ: IEEE Press, 69–73 (1998)Google Scholar
  29. [29]
    Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization. The 7th Annual Conference on Evolutionary Programming, San Diego, USA, 591–600 (1998)Google Scholar
  30. [30]
    Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. Congress on Evolutionary Computing, 1, 84–88 (2000)Google Scholar
  31. [31]
    Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. Proceedings, 1999 ICEC, Washington, DC, 1951–1957 (1999)Google Scholar
  32. [32]
    Deep, K., Das, K.N.: Quadratic approximation based hybrid genetic algorithm for function optimization. Applied Mathematics and Computation, 203(1) 86–98 (2008)CrossRefGoogle Scholar
  33. [33]
    Mohan, C., Shanker, K. (now Deep, K.): A random search technique for global optimization based on quadratic approximation. Asia Pacific Journal of Operations Research, 11 93–101 (1994)Google Scholar
  34. [34]
    Bharti: Controlled random search technique and their applications, Ph.D. Thesis. Department of Mathematics, University of Roorkee, Roorkee, India (1994)Google Scholar
  35. [35]
    Ali, M.M., Kaelo, P.: Improved particle swarm algorithms for global optimization. Applied Mathematics and Computation, 196, 578–593 (2008)CrossRefGoogle Scholar
  36. [36]
    Zhang, Li-ping., YU, Huan-jun, HU, Shang-xu: Optimal choice of parameters for particle swarm optimization. Journal of Zhejiang University Science, 6A(6), 528–534 (2005)CrossRefGoogle Scholar
  37. [37]
    Schutte, Jaco. F., Groenwold, Albert. A.: A study of global optimization using particle swarms. Journal of Global Optimization, 31, 93–108 (2005)CrossRefGoogle Scholar
  38. [38]
    Deep, K., Thakur, M.: A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation 188(1), pp. 895–911 (2007)CrossRefGoogle Scholar
  39. [39]
    Arora, J.S.: Introduction to Optimum Design, 2/e Academic Press, Elsevier. UK (2006)Google Scholar
  40. [40]
    Clerc, M.: Particle Swarm Optimization. ISTE Ltd., USA (2007)Google Scholar
  41. [41]
    Bhave, P.R.: Optimal Design of Water Distribution Networks. Narosa Publishing House, New Delhi, India (2003)Google Scholar

Copyright information

© Operational Research Society of India 2009

Authors and Affiliations

  1. 1.Department of MathematicsIndian Institute of Technology RoorkeeRoorkeeIndia

Personalised recommendations