The University of Southampton
University of Southampton Institutional Repository

A search algorithm for global optimisation

A search algorithm for global optimisation
A search algorithm for global optimisation
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.
1122-1130
Chen, S.
9310a111-f79a-48b8-98c7-383ca93cbb80
Wang, X.X.
38cba1ba-039f-427c-ac6f-459768df3834
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Wang, L.
ff28fc9d-dbeb-460f-943c-f49997f58bf7
Chen, K.
01830b60-b648-4843-ab65-99940f3e2236
Ong, Y.S.
62497a6f-823e-4663-b263-4a805a00f181
Chen, S.
9310a111-f79a-48b8-98c7-383ca93cbb80
Wang, X.X.
38cba1ba-039f-427c-ac6f-459768df3834
Harris, C.J.
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Wang, L.
ff28fc9d-dbeb-460f-943c-f49997f58bf7
Chen, K.
01830b60-b648-4843-ab65-99940f3e2236
Ong, Y.S.
62497a6f-823e-4663-b263-4a805a00f181

Chen, S., Wang, X.X. and Harris, C.J. (2005) A search algorithm for global optimisation. Wang, L., Chen, K. and Ong, Y.S. (eds.) 1st International Conference on Natural Computation, Changsha, China. 27 - 29 Aug 2005. pp. 1122-1130 .

Record type: Conference or Workshop Item (Other)

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.

Text
36111122.pdf - Other
Download (712kB)

More information

Published date: 2005
Additional Information: Published as LNCS 3611 Event Dates: August 27-29, 2005
Venue - Dates: 1st International Conference on Natural Computation, Changsha, China, 2005-08-27 - 2005-08-29
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 261193
URI: http://eprints.soton.ac.uk/id/eprint/261193
PURE UUID: e50c7a6f-c7d1-4965-99cf-2436f328a303

Catalogue record

Date deposited: 06 Sep 2005
Last modified: 14 Mar 2024 06:49

Export record

Contributors

Author: S. Chen
Author: X.X. Wang
Author: C.J. Harris
Editor: L. Wang
Editor: K. Chen
Editor: Y.S. Ong

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×