m setak - Department of Industrial Engineering, K.N.Toosi University of Technology, Tehran, Iran
h karimi - Department of Industrial Engineering, K.N.Toosi University of Technology, Tehran, Iran
s ratani - Department of Industrial Engineering, K.N.Toosi University of Technology, Tehran, Iran

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on the backbone (i.e. Network between hub nodes) andtributary networks (i.e. Networks which connect non-hub nodes to hub nodes). This model is applied inpublic transportation, telecommunication and banking networks. In this model locating and routing is considered simultaneously and it has a multiple allocation strategy to allocate non-hub nodes to hub nodes. In addition, non-hub nodes can connect directly to each other. The objective of the proposedmodel is minimizing costs of establishing a network and transferring flows. To expedite solving the proposed model and improve the lower bound, which gain from linear relaxation, a number of preprocessing tests and valid inequalities are presented which have relatively good performance in theproposed model. Their performance is analyzed by implementing them on the test problems. Results show that using all preprocessing tests and valid inequalities is the best approach to solve the problem among all proposed approaches in this paper

Hub Location,Multiple Allocation,Valid Inequalities,Transportation Network,Routing