359 search results - page 13 / 72 » A Hybrid Genetic Algorithm for the Quadratic Assignment Prob... |
131
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
118
click to vote
COR
2006
15 years 3 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
126
click to vote
ICNC
2009
Springer
15 years 9 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
107
click to vote
WSC
2008
15 years 5 months ago
2008
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
141
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...