带固定轴线成本的轴辐式网络设计问题

The Stability of the Solutions of Optimization Hub-and-Spoke Network Design Problem with Fixed Hub Arc Costs

带固定轴线成本的轴辐式网络设计问题广泛应用于第三方物流、邮政和航空运输等领域.现有研究主要考虑了枢纽站的节点成本,本研究则强调合并运输的固定轴线成本.固定轴线成本的必要性在于:轴辐式网络中的轴线运输需要借助更大型的运输工具,因此必须支付固定成本.建立了该问题的混合整数规划模型,探讨了最优解特征,并构造了求解问题的拉格朗日松驰算法,实验显示算法具有非常好的求解效率与求解质量.同时,还讨论了一个重要的扩展问题:增加O-D流的绕道约束,绕道约束常常应用于快递运输和应急物流等领域.在局部修改原算法的基础上提供了扩展问题的求解方案.

Hub-and-Spoke network design problem with fixed hub arc cost has a wide range of applications within the third party logistics, postal services and airline transportation. Current researches concentrated on hub location while this paper em- phasizes the fixed hub arc costs which reflect a fact that the transportation on hub arc must be provided with large-scale vehicles and therefore pay extra fixed costs. This paper constructs a mixed 0-1 integer programming model, and provided a heuristic algorithm based on Lagrangian relaxation. We also extend the problem by adding the route distance constraint which is very important for emergency logistics and express delivery. We solve the extended problem by modifying the original algorithm.