33 search results - page 1 / 7 » Solving quadratic assignment problems by genetic algorithms ... |
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
COR
2010
13 years 4 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...