An Effective and Efficient Two Stage Algorithm for Global Optimization

  • Yong-Jun Wang
  • Jiang-She Zhang
  • Yu-Fen Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3930)


A two stage algorithm, consisting of gradient technique and particle swarm optimization (PSO) method for global optimization is proposed. The gradient method is used to find a local minimum of objective function efficiently, and PSO with potential parallel search is employed to help the minimization sequence to escape from the previously converged local minima to a better point which is then given to the gradient method as a starting point to start a new local search. The above search procedure is applied repeatedly until a global minimum of the objective function is found. In addition, a repulsion technique and partially initializing population method are also incorporated in the new algorithm to increase its global search ability. Global convergence is proven, and tests on benchmark problems show that the proposed method is more effective and reliable than the existing optimization methods.


Particle Swarm Optimization Local Search Global Optimization Particle Swarm Optimization Algorithm Global Optimization Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ge, R.: A Filled Function Method for Finding a Gobal Minimizer of a Function of Several Variables. Mathematical Programming 46, 191–204 (1990)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Levy, A., Montalvo, A.: The Tunneling Algorithm for the Global Minimization of Functions. SIAM Journal of Scientific and Statistical Computing 6, 15–29 (1985)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Holland, J.H.: Genetic algorithms. Scientific American 4, 44–50 (1992)Google Scholar
  4. 4.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proc. 6th Symp., Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  6. 6.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)Google Scholar
  7. 7.
    Shi, Y., Eberhart, R.C.: A Modified Particle Swarm Optimizer. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1998), Piscataway, NJ, pp. 69–73 (1998)Google Scholar
  8. 8.
    Noel, M.M., Jannett, T.C.: Simulation of a New Hybrid Particle Swarm Optimization Algorithm. In: Proceedings of the Thirty-Sixth Southeastern Symposium on System Symposium, pp. 150–153 (2004)Google Scholar
  9. 9.
    RoyChowdhury, P., Singh, Y.P., Chansarkar, R.A.: Hybridization of Gradient Descent Algorithms with Dynamic Tunneling Methods for Global Optimization. IEEE Transactions on Systems, Man, and Cybernetics 30, 384–390 (2000)CrossRefGoogle Scholar
  10. 10.
    Yiu, K.F.C., Liu, Y., Teo, K.L.: A hybrid Descent Method for Global Optimization. Journal of Global Optimization 28, 229–238 (2004)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Deb, K.: Optimization for Engineering Design, Algorithms and Examples. Prentice-Hall, New Delhi (1995)Google Scholar
  12. 12.
    Parsopoulos, K.E., Vrahatis, M.N.: On the Computation of All Global Optimizers Through Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 8, 211–223 (2004)CrossRefGoogle Scholar
  13. 13.
    Cvijovic, D., Klinowski, J.: Taboo search, An Approach to the Multiple Minima Problem. Science 267, 664–666 (1995)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Bilbro, G.L., Snyder, W.E.: Optimization of Functions With Many Minima. Transaction on Systems, Man, and Cybern. 21(7), 840–849 (1991)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Anerssen, R.S., Jennings, L.S., Ryan, D.M.: Optimization. University of Queensland Press, St. Lucia (1972)Google Scholar
  16. 16.
    Dekkers, A., Aarts, E.: Global Optimization and Simulated Annealing. Mathematical Programming 50, 367–393 (1991)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Barhen, J., Protopopescu, V., Reister, D.: TRUST: A Deterministic Algorithm for Global Optimization. Science 276, 1094–1097 (1997)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yong-Jun Wang
    • 1
  • Jiang-She Zhang
    • 1
  • Yu-Fen Zhang
    • 2
  1. 1.Institute of Information and System Science, School of ScienceXi’an Jiaotong UniversityXi’anChina
  2. 2.Faculty of Mathematics and Computer ScienceHebei UniversityBaodingChina

Personalised recommendations