Hub location problems deal with the location of a set of hub facilities and the design of the network so as to provide the most cost-effective way to route a set of commodities through thenetwork. In this paper we study capacitated p-hub center problem. The p-hub center allocation problem is to minimize maximum travel time in networks by locating p hubs from a set of candidate hub locations and allocating demand and supply nodes to hubs. The capacities of the hubs are given.In this study we use two different metaheuristic, genetic algorithm and biogeography-based optimization (BBO) and compare the results in variety of condition. In the same condition, the minimum cost for GA and BBO algorithm is 3.0974 and 3.9546, respectively