...
首页> 外文期刊>Applied Mathematical Modelling >Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
【24h】

Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints

机译:有跳跳约束和不跳跳约束的不完整枢纽定位网络设计问题的公式和分解方法

获取原文
获取原文并翻译 | 示例
           

摘要

The incomplete hub location problem with and without hop-constraints is modeled using a Leontief substitution system approach. The Leontief formalism provides a set of important theoretical properties and delivers formulations with tight linear bounds that can explicitly incorporate hop constraints for each origin-destination pair of demands. Furthermore, the proposed formulations are amenable to a Benders decomposition technique which can solve large scale test instances. The performance of the devised algorithm is primarily due to a new general scheme for separating Benders feasibility cuts. The novel cuts render a stabilizing effect that is directly responsible for the solution of instances up to 80 nodes.
机译:使用Leontief替换系统方法对带有跳跳约束和不带有跳跳约束的不完整枢纽定位问题进行建模。 Leontief形式主义提供了一组重要的理论属性,并提供了具有严格线性范围的公式,这些公式可以明确地将跳数约束纳入每个需求-目的地对。此外,提出的配方适合于可以解决大规模测试实例的Benders分解技术。所设计算法的性能主要归因于用于分离Benders可行性削减的新通用方案。新颖的剪切效果带来了稳定效果,直接影响了多达80个节点的实例的求解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号