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

Authors:
Hatice Calık;Sibel A. Alumur;Bahar Y. Kara;Oya E. Karasan
Affiliations:
Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 6

Avoiding local optima in the p-hub location problem using tabu search and grasp

Annals of Operations Research - Special issue on locational decisions
An efficient procedure for designing single allocation hub and spoke systems

Management Science
A hub covering model for cargo delivery systems

Networks - Special Issue on Multicommodity Flows and Network Design
Hub Arc Location Problems: Part I-Introduction and Results

Management Science
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms

Management Science

A mixed integer linear program and tabu search approach for the complementary edge covering problem

Advances in Engineering Software
LTL logistics networks with differentiated services

Computers and Operations Research
Twenty-Five Years of Hub Location Research

Transportation Science
Uncapacitated single allocation p-hub maximal covering problem

Computers and Industrial Engineering
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem

International Journal of Metaheuristics
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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.