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.
|
| 主題: |