A hybrid metaheuristic for the generalized quadratic assignment problem
The generalized quadratic assignment problem (GQAP) concerns with assigning m facilities to n locations. Multiple facilities can be assigned to a single location as long as the space allows. The aim is to find a way of assignment such that the total cost involved is minimized while respecting the sp...
Main Authors: | Lim, W. L., Alias, M. A. S., Haron, H. |
---|---|
Format: | Conference or Workshop Item |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2016
|
Subjects: |
Similar Items
-
A biogeography-based optimization algorithm hybridized with tabu search for the quadratic assignment problem
by: Lim, W. L., et al.
Published: (2016) -
A biogeography-based optimization algorithm hybridized with tabu search for the quadratic assignment problem
by: Lim, Wee Loon, et al.
Published: (2016) -
Sub-group quadratic assignment problem: A variant Of quadratic assignment problem with model development and comparison
by: Syed Abdullah, Sharifah Shuthairah, et al.
Published: (2020) -
Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using branch and bound approach
by: Syed-Abdullah, Sharifah Shuthairah, et al.
Published: (2018) -
Transformation of DCG onto DAG for task assignment problem.
by: Mohd. Puzi, Shazirawati, et al.
Published: (2022)