Sciweavers

GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 7 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
EMO
2001
Springer
107views Optimization» more  EMO 2001»
13 years 8 months ago
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
Joshua D. Knowles, Richard A. Watson, David Corne
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
13 years 9 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
GECCO
2005
Springer
103views Optimization» more  GECCO 2005»
13 years 9 months ago
Maximally rugged NK landscapes contain the highest peaks
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
Benjamin Skellett, Benjamin Cairns, Nicholas Geard...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
13 years 9 months ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
SGAI
2007
Springer
13 years 10 months ago
Escaping Local Optima: Constraint Weights vs. Value Penalties
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
Muhammed Basharu, Inés Arana, Hatem Ahriz
ISICA
2007
Springer
13 years 10 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
13 years 10 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor
SCALESPACE
2009
Springer
13 years 11 months ago
Momentum Based Optimization Methods for Level Set Segmentation
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
Gunnar Läthén, Thord Andersson, Reiner...
LION
2009
Springer
203views Optimization» more  LION 2009»
13 years 11 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz