715 search results - page 49 / 143 » Neighborhood structures for genetic local search algorithms |
JCO
2007
14 years 9 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
107
click to vote
CEC
2010
IEEE
14 years 1 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...