Genetic algorithm based approaches for the quadratic assignment problem
The quadratic assignment problem (QAP)belongs to the class of NP-hard combinatorial optimization problems. In this thesis, we describe several approaches based on genetic algorithms (GA)for the QAP.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/19648 |