TY - JOUR
T1 - An empirical comparison of simulated annealing and iterated local search for the hierarchical single allocation hub median location problem
AU - Fazel Zarandi, Mohammad Hossein
AU - Davari, Soheil
AU - Haddad Sisakht, Ali
N1 - cited By 11
PY - 2015
Y1 - 2015
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84959376596
M3 - Article
VL - 22
SP - 1203
EP - 1217
JO - Scientia Iranica
JF - Scientia Iranica
IS - 3
ER -