Sciweavers

Share
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
9 years 6 months ago
A stigmergy-based algorithm for black-box optimization: noisy function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc
GECCO
2009
Springer
130views Optimization» more  GECCO 2009»
9 years 6 months ago
A stigmergy-based algorithm for black-box optimization: noiseless function testbed
In this paper, we present a stigmergy-based algorithm for solving optimization problems with continuous variables, labeled Differential Ant-Stigmergy Algorithm (DASA). The perfor...
Peter Korosec, Jurij Silc
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
9 years 6 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
9 years 6 months ago
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
Shigeyoshi Tsutsui, Noriyuki Fujimoto
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
9 years 6 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 function testbed
The BFGS quasi-Newton method is benchmarked on the noiseless BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of 105 times the sea...
Raymond Ros
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
9 years 6 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
GECCO
2009
Springer
117views Optimization» more  GECCO 2009»
9 years 6 months ago
BBOB-benchmarking a simple estimation of distribution algorithm with cauchy distribution
The restarted estimation of distribution algorithm (EDA) with Cauchy distribution as the probabilistic model is tested on the BBOB 2009 testbed. These tests prove that when using ...
Petr Posik
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
9 years 6 months ago
Black-box optimization benchmarking for noiseless function testbed using PSO_bounds
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...
Mohammed El-Abd, Mohamed S. Kamel
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
9 years 6 months ago
Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
Anne Auger
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
9 years 6 months ago
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
Anne Auger
books