A search algorithm for global optimisation

S. Chen*, X. X. Wang, C. J. Harris

*Corresponding author for this work

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)1122-1130
Number of pages9
JournalLecture Notes in Computer Science
Volume3611
Issue numberPART II
DOIs
Publication statusPublished - 24 Oct 2005

Fingerprint Dive into the research topics of 'A search algorithm for global optimisation'. Together they form a unique fingerprint.

  • Cite this

    Chen, S., Wang, X. X., & Harris, C. J. (2005). A search algorithm for global optimisation. Lecture Notes in Computer Science, 3611(PART II), 1122-1130. https://doi.org/10.1007/11539117_152