715 search results - page 33 / 143 » Neighborhood structures for genetic local search algorithms |
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
CPHYSICS
2006
14 years 9 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
EGC
2005
Springer
15 years 3 months ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...