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...
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2005.
|
| 主題: |