Article ID: | iaor20123206 |
Volume: | 40 |
Issue: | 6 |
Start Page Number: | 927 |
End Page Number: | 939 |
Publication Date: | Dec 2012 |
Journal: | Omega |
Authors: | Alumur Sibel A, Kara Bahar Y, Karasan Oya E |
Keywords: | networks, combinatorial optimization, design |
Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In addition to the location and allocation decisions, we also study the decision on how the hub networks with different possible transportation modes must be designed. In this multimodal hub location and hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different transportation modes between hubs and different types of service time promises between origin–destination pairs while designing the hub network in the multimodal problem. We first propose a linear mixed integer programming model for this problem and then derive variants of the problem that might arise in certain applications. The models are enhanced via a set of effective valid inequalities and an efficient heuristic is developed. Computational analyses are presented on the various instances from the Turkish network and CAB data set.