Research on the non-strict uncapacitated multiple allocation p-hub median problem based on tuba search

The problem of locating hub facilities arises in the design of transportation and telecommunications networks. In this paper we consider the non-strict uncapacitated multiple allocation p-hub median problem which belongs to a class of discrete location-allocation problems. A mixed integer linear programming model of the non-strict uncapacitated multiple allocation p-hub median problem is proposed and a new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the non-strict uncapacitated multiple allocation p-hub median problem. Our algorithm is benchmarked on a Chinese data. Computational results demonstrate that the algorithm can find the best solution of all the problems within 0.14 seconds, so the heuristic algorithm has strong ability and quick efficiency in finding optimal solutions.