Hub location problems in transportation networks
Hub location problems in transportation networks
复制标题
DOI：
10.1016/j.tre.2011.04.009
复制
发表时间：
2011-11-01
影响因子：
10.6
通讯作者：
Nickel, Stefan
中科院分区：
文献类型：
--
作者：
Gelareh, Shahin;Nickel, Stefan
在本文中，我们提出了一个4指标制定的无容量限制的多分配枢纽选址问题的城市交通和班轮运输网络设计。这个公式非常紧凑，大多数MIP求解器的易处理实例在根节点处都是最佳可解的。虽然现有的最先进的MIP求解器无法解决甚至小尺寸的问题实例，我们的加速和有效的原始（弯曲）分解解决了较大的。此外，一个非常有效的贪婪启发式，被证明是能够获得高质量的解决方案，提出。我们还介绍了澳大利亚邮政（AP）数据集的固定成本值。(C)2011爱思唯尔有限公司保留所有权利。
In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem, our accelerated and efficient primal (Benders) decomposition solves larger ones. In addition, a very efficient greedy heuristic, proven to be capable of obtaining high quality solutions, is proposed. We also introduce fixed cost values for Australian Post (AP) dataset. (C) 2011 Elsevier Ltd. All rights reserved.