Back to Search
Start Over
A tabu search heuristic for a generalized quadratic assignment problem
- Source :
- Journal of Industrial and Production Engineering. 34:221-231
- Publication Year :
- 2016
- Publisher :
- Informa UK Limited, 2016.
-
Abstract
- The generalized quadratic assignment problem (GQAP) is the task of assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. The facilities may have different space requirements, and the locations may have varying space capacities. Also, multiple facilities may be assigned to each location such that space capacity is not exceeded. In this paper, an application of the GQAP is presented for assigning a set of machines to a set of locations on the plant floor. Construction algorithms and a simple tabu search heuristic are developed for the GQAP. A set of test problems available in the literature was used to evaluate the performances of the TS heuristic using different construction algorithms. The results show that the simple TS heuristic is effective for solving the GQAP.
- Subjects :
- 0209 industrial biotechnology
Mathematical optimization
021103 operations research
Heuristic (computer science)
Quadratic assignment problem
0211 other engineering and technologies
02 engineering and technology
Industrial and Manufacturing Engineering
Tabu search
Set (abstract data type)
020901 industrial engineering & automation
Control and Systems Engineering
Guided Local Search
Metaheuristic
Generalized assignment problem
Weapon target assignment problem
Mathematics
Subjects
Details
- ISSN :
- 21681023 and 21681015
- Volume :
- 34
- Database :
- OpenAIRE
- Journal :
- Journal of Industrial and Production Engineering
- Accession number :
- edsair.doi...........1342e7c0e9e7825feb629f2f86bd7486