کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475296 699280 2009 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 12, December 2009, Pages 3088–3096
نویسندگان
, , , ,