359 search results - page 35 / 72 » A Hybrid Genetic Algorithm for the Quadratic Assignment Prob... |
109
click to vote
ANOR
2002
15 years 2 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
124
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
111
click to vote
SETN
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
125
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
113
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...