A search algorithm for global optimisation

Authors:
S. Chen;X. X. Wang;C. J. Harris
Affiliations:
School of Electronics and Computer Science, University of Southampton, Southampton, U.K;Neural Computing Research Group, Aston University, Birmingham, U.K;School of Electronics and Computer Science, University of Southampton, Southampton, U.K
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 6
Cited 0

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
The Strength of Weak Learnability

Machine Learning
A decision-theoretic generalization of on-line learning and an application to boosting

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Adaptive simulated annealing for optimization in signal processing applications

Signal Processing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An introduction to boosting and leveraging

Advanced lectures on machine learning

Quantified Score

Hi-index	0.00

Visualization

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.