抄録
We have proposed a new metaheuristic method termed Hybrid Tabu Search to solve a p-HUB problem with capacity constraints. The method divides the solution procedure into two levels. Its upper level solves a HUB location problem based on Tabu Search, and the lower a connecting problem by Dijkstra method in the aid of Lagrangean relaxation. Through numerical experiments, we confirmed the proposed method outperformed two commercial software known popularly.
