Paper Info
Title
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Abstract
Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin-destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.
Year
DOI
Venue
2009
10.1016/j.cor.2008.11.023
Computers & OR
Keywords
DocType
Volume
travel time,hub location problems deal,incomplete hub network,hub facility,CAB data,efficient heuristic,located hub facility,single allocation hub,hub link,located hub
Journal
36
Issue
ISSN
Citations 
12
Computers and Operations Research
28
PageRank 
References 
Authors
0.97
11
4
Name
Order
Citations
PageRank
Hatice Calik1344.11
Sibel A. Alumur232313.66
Bahar Y. Kara329018.57
Oya E. Karasan4280.97