266 search results - page 2 / 54 » A greedy genetic algorithm for the quadratic assignment prob... |
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
GECCO
2009
Springer
14 years 2 days ago
2009
Springer
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
WEA
2004
Springer
14 years 24 days ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
GECCO
2006
Springer
13 years 11 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...