On tabu search for the location of interacting hub facilities

A new heuristic method based on tabu search is developed for the problem of locating p interacting hub facilities among n interacting nodes in a network. The method treats equally the problem of locating hub facilities, as well as the problem of allocating the nodes to one and only one hub. The algorithm obtained improved solutions to problems from the standard test set from literature which has been used in this study.