The repository is currently being upgraded to DSpace 7. Temporarily, only admins can login. Submission of items and changes to existing items is prohibited until the completion of this upgrade process.
A hybrid heuristic for the uncapacitated hub location problem
Sue Abdinnour-Helm, A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, Volume 106, Issues 2–3, 16 April 1998, Pages 489-499, ISSN 0377-2217, http://dx.doi.org/10.1016/S0377-2217(97)00286-5
Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single hub. A new heuristic method is developed based on a hybrid of Genetic Algorithms (GAs) and Tabu Search (TS). The new heuristic yields much improved results when compared to applying GAs alone. In all but one of the cases tested, the results matched the best solutions found in the literature so far.
Click on the DOI link to access this article (may not be free)