41 search results - page 3 / 9 » A fast hybrid genetic algorithm for the quadratic assignment... |
SAC
2004
ACM
14 years 1 months ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
JAMDS
2002
13 years 7 months ago
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The ...