Heuristic hybrids for the quadratic assignment problem
This thesis explores the use of hybridized heuristic methods in solving the Quadratic Assignment Problem (QAP), a classical NP-complete combinatorial problem. Previous research works have resulted in a number of algorithm designs suitable for solving the QAP. Using these available algorithms as well...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Thesis |
| Γλώσσα: | English |
| Έκδοση: |
2004.
|
| Θέματα: |