This paper introduces a multimodal hub network design problem with flexible routes. Routes are flexible in the sense that they may contain a mix of hub and non-hub nodes. Nonetheless, commodity transfers can only occur at hubs, while transportation costs are flow-dependent, i.e., scale economies stem from the transport technology chosen to operate the routes. We propose a mixed integer mathematical program, and two metaheuristics based on the adaptive large neighborhood search paradigm to solve the problem. Extensive computational experiments show the performance of the formulation and of the devised algorithms in solving benchmark instances with up to 50 nodes.

本文介绍了一种具有灵活路由的多峰集线器网络设计问题。从包含混合集线器节点和非集线器节点的角度来看，路由是灵活的。尽管如此，商品转移只能发生在枢纽，而运输成本却依赖于流量，即规模经济源自选择经营路线的运输技术。我们提出了一个混合整数数学程序，并基于自适应大邻域搜索范式来解决两个元启发式问题。大量的计算实验表明，该公式和所设计算法在求解具有多达50个节点的基准实例方面的性能。