Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Simulated Annealing Heuristics For The Dynamic Generalized Quadratic Assignment Problem, Yugesh Dhungel
Simulated Annealing Heuristics For The Dynamic Generalized Quadratic Assignment Problem, Yugesh Dhungel
Graduate Theses, Dissertations, and Problem Reports
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 …