• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >A new formulation and an exact approach for the many-to-many hub location-routing problem
【24h】

A new formulation and an exact approach for the many-to-many hub location-routing problem

机译：解决多对多集线器位置路由问题的新方法和精确方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

An important problem of the freight industry is the parcel delivery network design, where several facilities are responsible for assembling flows from several origins, re-routing them to other facilities where the flows are disassembled and the packages delivered to their final destinations. In order to provide this service, local tours are established for the vehicles assigned to each of the processing facilities, which are then responsible for the pickup and delivery tasks. This application gives rise to the many-to-many hub location routing problem that is the combination of two well known problems: the vehicle routing problem and the single assignment hub location problem. In this work, a new formulation for this important problem is proposed and solved by a specially tailored Benders decomposition algorithm. The proposed method is robust enough to solve instances up to 100 nodes having 4 million integer variables.
机译：货运业的一个重要问题是包裹运送网络的设计，其中几个设施负责组装来自多个起点的货物流，然后将其重新路由到其他设施，在那里这些货物被拆解并将包裹运送到最终目的地。为了提供这项服务，为分配给每个处理设施的车辆建立了本地旅行团，然后负责接送任务。此应用程序引起了多对多的集线器位置路由问题，这是两个众所周知的问题的组合：车辆路由问题和单个分配集线器位置问题。在这项工作中，针对此重要问题的新公式被提出并通过专门定制的Benders分解算法加以解决。所提出的方法足够健壮，可以解决最多100个具有400万个整数变量的节点的实例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号