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:
主要作者: | Yuan, Yu. |
---|---|
其他作者: | Lim, Meng Hiot |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2009
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/19648 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
A tabu search algorithm for static routing and wavelength assignment problem
由: Wang, Ying, et al.
出版: (2010) -
Storage location assignment problem in a warehouse system
由: Sushant Gupta.
出版: (2014) -
Fast neural networks digital beamformer based on slow genetic algorithm solutions
由: Wang, Yan.
出版: (2008) -
Algorithms development for financial problems
由: Vasudevan Prabhakaran
出版: (2009) -
Adaptive active noise control with genetic algorithm
由: Yang, Xiaoguang
出版: (2008)