26 search results - page 4 / 6 » A Hybrid Genetic Algorithm for the Traveling Salesman Proble... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
IWANN
2001
Springer
13 years 12 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
BMCBI
2008
13 years 7 months ago
2008
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
HM
2009
Springer
14 years 2 days ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....