Alumur, S.Kara, B. Y.2016-02-082016-02-0820090160-5682http://hdl.handle.net/11693/22604Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location problem. Through observations from the Turkish cargo sector, we propose a new mathematical model for the hub location problem that relaxes the complete hub network assumption. Our model minimizes the cost of establishing hubs and hub links, while designing a network that services each origin-destination pair within a time bound. We formulate a single-allocation hub covering model that permits visiting at most three hubs on a route. The model is then applied to the realistic instances of the Turkish network and to the Civil Aeronautics Board data set.EnglishHub locationHub coverCargo applicationsLocationLogisticsArticle10.1057/jors.2008.921476-9360