A GENERALIZATION OF THE GENERALIZED QUADRATIC ASSIGNMENT PROBLEM

The generalized quadratic assignment problem (GQAP) is stated as the problem of assigning a set of M facilities to a set of N locations (M > N), without exceeding the capacities of the locations, such that the sum of the... [ view full abstract ]

The generalized quadratic assignment problem (GQAP) is stated as the problem of assigning a set of M facilities to a set of N locations (M > N), without exceeding the capacities of the locations, such that the sum of the assignment and transportation costs is minimized. In this paper, the GQAP with discrete time periods within the planning horizon is considered. This problem is called the dynamic GQAP (DGQAP) and is a generalization of the GQAP. Three formulations are presented for the DGQAP. Also, a problem instance is presented and solved using two of the formulations.