A clustering based simulated annealing approach for solving an un-capacitated single allocation p-hub location problem

Hub location problems play main role in large transportation systems and logistic environments. Its applications in real worlds cause that many researchers continue their attentions on this problem. In this paper clustering is applied as a heuristic method to improve the performance of simulated annealing algorithm for solving an un-capacitated single allocation p-hub location problem (USApHLP). For better illustration of the proposed clustering based Simulated Annealing (CbSA) approach, some numerical examples have been solved and the results have been reported in this paper. The comparisons show that CbSA algorithm outperforms the classic simulated annealing approach for the USApHLP.