Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11539117_152 | ICNC (2) |
Keywords | Field | DocType |
global search optimisation technique,heuristic explanation,proposed optimisation algorithm,genetic algorithm,search algorithm,global optimiser,global optimisation,adaptive simulated annealing,proposed algorithm,global search capability,global search technique | Simulated annealing,Mathematical optimization,Incremental heuristic search,Search algorithm,Computer science,Algorithm,Beam search,Adaptive simulated annealing,Adaptive algorithm,Genetic algorithm,Best-first search | Conference |
Volume | ISSN | ISBN |
3611 | 0302-9743 | 3-540-28325-0 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Chen | 1 | 0 | 0.34 |
| X. X. Wang | 2 | 0 | 0.34 |
| C. J. Harris | 3 | 132 | 7.59 |
| edward s chen | 4 | 0 | 0.34 |