The Hub Location Problem (HLP) has been an attractive area of research for more than four decades. A recently proposed problem in the area of hub location is the hierarchical Single-Allocation Hub Median Problem (SA-H-MP), which is associated with finding the location of a number of hubs and central hubs, so that the total routing cost is minimized. Owing to the problem's complexity and intractability, this paper puts forward two metaheuristics, Simulated Annealing (SA) and Iterated Local Search (ILS), and compares their performances. Results show that while both algorithms are able to reach optimal solutions on the standard CAB dataset, their runtimes are negligible and considerably lower compared to the runtimes of exact methods.
|Number of pages||15|
|Publication status||Published - 2015|