close
Skip to main content

A Search Algorithm for Global Optimisation

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3611))

Included in the following conference series:

  • 2150 Accesses

  • 1 Citation

Abstract

This paper investigates a global search optimisation technique, referred to as the repeated weighted boosting search. The proposed optimisation algorithm is extremely simple and easy to implement. Heuristic explanation is given for the global search capability of this technique. Comparison is made with the two better known and widely used global search techniques, known as the genetic algorithm and adaptive simulated annealing. The effectiveness of the proposed algorithm as a global optimiser is investigated through several examples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  3. Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  4. Corana, A., Marchesi, M., Martini, C., Ridella, S.: Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Trans. Mathematical Software 13(3), 262–280 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ingber, L., Rosen, B.: Genetic algorithms and very fast simulated reannealing: a comparison. Mathematical and Computer Modelling 16(11), 87–100 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, S., Luk, B.L.: Adaptive simulated annealing for optimization in signal processing applications. Signal Processing 79(1), 117–128 (1999)

    Article  MATH  Google Scholar 

  7. Schapire, R.E.: The strength of weak learnability. Machine Learning 5(2), 197–227 (1990)

    Google Scholar 

  8. Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Computer and System Sciences 55(1), 119–139 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Meir, R., Rätsch, G.: An introduction to boosting and leveraging. In: Mendelson, S., Smola, A. (eds.) Advanced Lectures in Machine Learning, pp. 119–184. Springer, Heidelberg (2003)

    Google Scholar 

  10. Schoen, F.: Stochastic techniques for global optimization: a survey of recent advances. J. Global Optimization 1, 207–228 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Shynk, J.J.: Adaptive IIR filtering. IEEE ASSP Magazine, 4–21 (April 1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, S., Wang, X.X., Harris, C.J. (2005). A Search Algorithm for Global Optimisation. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_152

Download citation

Keywords

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.

Publish with us

Policies and ethics