Genetic algorithm based approaches for the quadratic assignment problem

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:
Bibliographic Details
Main Author: Yuan, Yu.
Other Authors: Lim, Meng Hiot
Format: Theses and Dissertations
Language:English
Published: 2009
Subjects:
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
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
Description
Summary: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.

Similar Items