کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10348348 699408 2011 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A branch-and-cut algorithm for the partitioning-hub location-routing problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A branch-and-cut algorithm for the partitioning-hub location-routing problem
چکیده انگلیسی
We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol called Intermediate System-Intermediate System (ISIS), and strategic planning of LTL ground freight distribution systems. We present an Integer Programming (IP) model for solving exactly the PHLRP and explore possible valid inequalities to strengthen it. Computational experiments prove the effectiveness of our model which is able to tackle instances of PHLRP containing up to 20 vertices.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 2, February 2011, Pages 539-549
نویسندگان
, , , ,