Date of Graduation
Statler College of Engineering and Mineral Resources
Industrial and Managements Systems Engineering
The Dynamic Generalized Quadratic Assignment Problem (DGQAP) is the task of assigning a set of facilities to a set of locations in a multi-period planning horizon such that the sum of the transportation and assignment/reassignment costs is minimized. The facilities may have different space requirements, and the capacities of locations may vary during the multiple-period planning horizon. Also, multiple facilities may be assigned to each location without violating the space capacity of the location. This research presents a formulation and applications of DGQAP in various layout and assignment problems encountered in the literature. Two Simulated Annealing (SA) metaheuristics named SA I and SA II are proposed for solving the DGQAP problem. The SA I heuristic is a direct adaptation of SA to DGQAP. The SA II heuristic is same as SA I heuristic with a look-ahead/look-back strategy and with a modified construction algorithm. A set of 28 test problems are generated following the procedure available in the literature for the Generalized Quadratic Assignment Problem. The performance of the heuristics are tested with respect to solution quality and computation time. The results shows that the proposed heuristics performed well on the set of test problems.
Dhungel, Yugesh, "Simulated Annealing Heuristics for the Dynamic Generalized Quadratic Assignment Problem" (2022). Graduate Theses, Dissertations, and Problem Reports. 11162.