Globalization and increasing competition in global markets have forced businesses to provide a high level of service to their customers. Time-sensitive transportation systems which are used in transportation of perishable goods, express mail delivery, and emergency services are playing a very important role in this regard. This paper addresses the problem of uncapacitated multiple allocation p-hub center problem (UMApHCP) which is fundamental in proper functioning of time-sensitive transportation systems. A mixed-integer programming formulation is proposed for the problem and a highly efficient Benders decomposition algorithm is developed for solving it. The proposed algorithm is capable of solving large-scale instances of the problem to optimality in order of seconds.