PSO with randomized low-discrepancy sequences

Authors:
Xuan H. Nguyen;Quang U. Nguyen;Robert I. McKay
Affiliations:
VietNam Military Technical Academy, Hanoi, Vietnam;VietNam Military Technical Academy, Hanoi, Vietnam;Seoul National University, Seoul, South Korea
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 5
Cited 0

Quasi-random sequences and their discrepancies

SIAM Journal on Scientific Computing
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
Genetic algorithms using low-discrepancy sequences

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Randomized Halton sequences

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initialize a global-best particle swarm with a Halton sequence, comparing it with uniform initialization on a range of benchmark function optimization problems. We see substantial improvements in performance, particularly with high complexity problems /small populations. Halton initialization yields equivalent performance to uniform initialization with substantially smaller populations.