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.
Saved in:
Main Author: | Yuan, Yu. |
---|---|
Other Authors: | Lim, Meng Hiot |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/19648 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A tabu search algorithm for static routing and wavelength assignment problem
by: Wang, Ying, et al.
Published: (2010) -
Storage location assignment problem in a warehouse system
by: Sushant Gupta.
Published: (2014) -
Fast neural networks digital beamformer based on slow genetic algorithm solutions
by: Wang, Yan.
Published: (2008) -
Algorithms development for financial problems
by: Vasudevan Prabhakaran
Published: (2009) -
Adaptive active noise control with genetic algorithm
by: Yang, Xiaoguang
Published: (2008)