scholar.google.com › citations
In this paper, we investigate the use of some wel-known randomised low-discrepancy sequences (Halton, Sobol, and Faure sequences) for initialising particle ...
Missing: randomized | Show results with:randomized
We initialize a global-best particle swarm with a Halton sequence, comparing it with uniform initialization on a range of benchmark function optimization ...
Abstract— In this paper, we investigate the use of some wel- known randomised low-discrepancy sequences (Halton, Sobol,.
PSO. PSO algorithm starts with a population of particles randomly initialized in the search space. Each particle represents a potential solution. The ...
Missing: randomized | Show results with:randomized
In this paper, we investigate the use of some well-known randomised low-discrepancy sequences (Halton, Sobol, and Faure sequences) for initializing particle ...
Randomized Halton Sequence, Particle Swarm Optimization ... In Monte Carlo simulations, randomized low discrepancy sequences [4,5] have been found more effective.
The discrete particle swarm optimization algorithm is tested on a set of benchmark instances with symmetric distances up to 442 nodes from the literature.
Feb 9, 2011 · I found low-discrepancy sequences and think they allow a 1N scaling instead of the 1√(N) for random sampling. I am not sure how to apply them. I ...
Missing: randomized | Show results with:randomized
The simulation results show that a significant improvement can be made in the performance of BPSO, by simply changing the distribution of random numbers to ...
The proposed ICPSO algorithm is initialized using quasi random Vander Corput sequence and differs from unconstrained PSO algorithm in the phase ... Low ...