Particle swarm optimization hybrids for the quadratic assignment problem
The Quadratic Assignment Problem (QAPs) is an NP-Hard combinatorial problem concerned with the problem of assigning n facilities to n locations. Heuristic algorithms has to be applied to solve QAP in a reasonable period of time without compromising the quality of the solutions produced. QAP also fal...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | English |
| 出版事項: |
2005.
|
| 主題: |