Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
复制标题
使用禁忌搜索的多模态网络中的容量单分配 P-Hub 覆盖问题
DOI：
10.5829/idosi.ije.2016.29.06c.09
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
S. Nickel
中科院分区：
文献类型：
--
作者：
H. Karimi;M. Bashiri;S. Nickel
枢纽位置问题的目标是找到枢纽设施的位置，并确定将非枢纽节点分配给这些已定位的枢纽。本文讨论了全互联集线器网络上的多模态单分配有能力p-hub覆盖问题。因此，我们为此提供一个公式。我们的模型的目的是在每个始发目的地的选定模式组合中找到枢纽的位置和它们之间的枢纽链接。此外，它确定非枢纽节点以每次分配的最佳模式分配到所定位的枢纽，使得任何出发地对之间的旅行时间不大于给定的时间界限。此外，还考虑了集线器节点的容量。给出了紧线性规划下界的六个有效不等式。提出了一种基于禁忌搜索的启发式算法，并在澳大利亚邮政（AP）数据集上对其性能进行了测试。
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the hub links between them at a selected combination of modes for each origin-destination. Furthermore, it determines the allocation of non-hub nodes to the located hubs at the best mode for each allocation such that the travel time between any origin–destination pair is not greater than a given time bound. In addition, the capacity of hub nodes is considered. Six valid inequalities are presented to tight the linear programming lower bound. We present a heuristic based on tabu search algorithm and test the performance of it on the Australian Post (AP) data set.