129 search results - page 1 / 26 » Evaluating a local genetic algorithm as context-independent ... |
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
13 years 3 months ago
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
EOR
2002
13 years 4 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
PATAT
2004
Springer
13 years 10 months ago
2004
Springer
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...
EVOW
2009
Springer
13 years 9 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...