Sciweavers

596 search results - page 29 / 120
» Search Strategies for Hybrid Search Spaces
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
EPS
1998
Springer
13 years 12 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 9 days 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
148views Optimization» more  GECCO 2009»
14 years 9 days ago
Benchmarking the NEWUOA on the BBOB-2009 noisy testbed
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
Raymond Ros
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
14 years 9 days ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros