Black-box optimization benchmarking for noiseless function testbed using PSO_bounds

Authors:
Mohammed El-Abd;Mohamed S. Kamel
Affiliations:
University of Waterloo, Waterloo, ON, Canada;University of Waterloo, Waterloo, ON, Canada
Venue:
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Year:
2009

Citing 2
Cited 2

Telephone Network Traffic Overloading Diagnosis and Evolutionary Computation Techniques

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009

Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
The continuous differential ant-stigmergy algorithm for numerical optimization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper benchmarks the particle swarm optimizer with adaptive bounds algorithm (PSO Bounds) on the noisefree BBOB 2009 testbed. The algorithm is further augmented with a simple re-initialization mechanism that is invoked if the bounds tend to overlap.