Sciweavers

266 search results - page 1 / 54
» A greedy genetic algorithm for the quadratic assignment prob...
Sort
View
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
13 years 10 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
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...
Bryant A. Julstrom
COR
2000
112views more  COR 2000»
13 years 4 months ago
A greedy genetic algorithm for the quadratic assignment problem
Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 4 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 8 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
EMO
2009
Springer
219views Optimization» more  EMO 2009»
13 years 11 months ago
An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
Hui Li, Dario Landa Silva