exact solution algorithm

Hub location problems have important role in transportation networks and telecommunication systems. These problems have received much attention in the recent decades. In p-hub median problem، hub facilities are located in a network and non-hub nodes are allocated to hub nodes such that the total routing cost is minimized. In this paper، the r-Allocation p-Hub median problem has been studied. In this problem، each node can be allocated to at most r hubs. The purpose of this paper is to study and design of an exact solution approach based on benders decomposition to tackle the proposed problem. Based on problem structure، we proposed some strategies to accelerate the convergence of benders decomposition algorithm. The computational results of the proposed exact algorithm are presented using the Turkish network and USA423 data sets. Computational experiments confirm the effectiveness of the proposed method