为解决公铁联运网络枢纽选址问题，建立基于总费用最小的多分配 p‐枢纽中位选址模型。模型考虑枢纽间运输费用、枢纽固定运营成本、非枢纽间直接运输费用、枢纽处转运费用以及运输时间限制等影响因素，并应用禁忌搜索元启发式算法对模型进行求解，实现对公铁联运网络路径优化。该算法包括两个阶段：第一阶段通过全局多样化搜索确定枢纽位置；第二阶段通过区域强化搜索进行路径分配，在达到给定的迭代次数后，输出最优解。通过算例分析及算法比较验证了模型和算法可以有效解决公铁联运网络的枢纽选址问题。%In order to solve the problem of hub location of road‐rail intermodal transportation network ,a hub lo‐cation model based on minimum total cost was developed by using the multiple‐allocation p‐hub median ap‐proach .The model took into account the transportation costs of the hub‐to‐hub shipments ,fixed hub operating costs ,direct transportation costs of the shipments between non‐hubs ,transshipment costs and transit time con‐straint .A tabu search meta‐heuristic algorithm was used to solve the mathematic formulation ,to optimize the rail‐road intermodal hub path .The algorithm consisted of two phases ,known as global diversification phase which determined the location of hubs and regional intensification phase which assigned the routing .The tabu search procedure terminated and reported optimal solution when a given number of iterative times was reached . Finally ,the validity of the model and algorithm was verified to solve the hub location problem for the road‐rail intermodal transportation network by both case study and algorithm comparison .
展开▼
