A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Çalık, Hatice; Alumur, Sibel A.; Kara, Bahar Y.; Karaşan, Oya Ekin

doi:10.1016/j.cor.2008.11.023

Cited by 118 publications

(46 citation statements)

References 26 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, ground hub links can be established between all hub nodes via constraints (8) and (9). This distinction is because transportation modes other than ground transportation can only be utilized with specific terminals and/or equipment, whereas ground transportation is available between every hub.…”

Section: Generic Modelmentioning

confidence: 99%

“…In this study by Calik et al [8], the authors developed a tabu search based heuristic for the incomplete hub covering problem. The main challenge in the tabu search implementation was to find feasible solutions for tight service time bounds.…”

Section: A Heuristic Algorithmmentioning

confidence: 99%

“…Similar to the p-hub median version, if we have a single service type and if we set Z [3] and Calik et al [8].…”

Section: Formulations For Some Other Hub Location Problemsmentioning

confidence: 99%

“…Turkish network data set is used in various hub location studies [3,8,41,44] and is available in OR Library [5]. There are 81 demand nodes in this data set corresponding to 81 administrative districts of Turkey.…”

Section: Application In Turkeymentioning

confidence: 99%

“…In the models considering travel time, they showed that, in most of the instances, there is no need to establish a complete hub network to provide a required service quality. Calik et al [8] considered the hub covering version of this network design problem. Alumur and Kara [2] worked on a special case where the hub network has a diameter of three.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Multimodal hub location and hub network design

Alumur

Kara

Karaşan

2012

Omega

Self Cite

172

View full text Add to dashboard Cite

a b s t r a c tThrough 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 origindestination 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.

show abstract

Section: Generic Modelmentioning

confidence: 99%

Section: A Heuristic Algorithmmentioning

confidence: 99%

“…Similar to the p-hub median version, if we have a single service type and if we set Z [3] and Calik et al [8].…”

Section: Formulations For Some Other Hub Location Problemsmentioning

confidence: 99%