• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical research letters: MRL >The r-interdiction selective multi-depot vehicle routing problem
【24h】

The r-interdiction selective multi-depot vehicle routing problem

机译：r-interdiction选择性多仓库车辆路由问题

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

摘要

The protection of critical facilities has been attracting increasing attention in the past two decades. Critical facilities involve physical assets such as bridges, railways, power plants, hospitals, and transportation hubs among others. In this study we introduce a bilevel optimization problem for the determination of the most critical depots in a vehicle routing context. The problem is modeled as an attacker-defender game (Stackelberg game) from the perspective of an adversary agent (the attacker) who aims to inflict maximum disruption on a routing network. We refer to this problem as the r-interdiction selective multi-depot vehicle routing problem (RI-SMDVRP). The attacker is the decision maker in the upper level problem (ULP) who chooses r depots to interdict with certainty. The defender is the decision maker in the lower level problem (LLP) who optimizes the vehicle routes in the wake of the attack. The defender has to satisfy all customer demand either using the remaining depots or through outsourcing to a third party logistics service provider. The ULP is solved through exhaustive enumeration, which is viable when the cardinality of interdictions does not exceed five among nine depots. For the LLP we implement a tabu search heuristic adapted to the selective multi-depot VRP. Our results are obtained on a set of RI-SMDVRP instances synthetically constructed from standard MDVRP test instances.
机译：保护关键设施的保护在过去二十年中一直在吸引着越来越长的关注。关键设施涉及桥梁，铁路，电厂，医院等物理资产，以及其他人。在这项研究中，我们介绍了彼此在车辆路由环境中确定最关键的仓库的偏斜优化问题。从对手（攻击者）的角度来说，该问题被建模为攻击者 - 后卫游戏（Stackelberg游戏），旨在对路由网络造成最大中断的攻击者。我们将此问题称为R-Interdiction选择多仓库车辆路由问题（RI-SMDVRP）。攻击者是在上层问题（ULP）中的决策者，他选择R Deplate Containty。辩护人是在攻击后优化车辆路线的下层问题（LLP）中的决策者。后卫必须使用剩​​余的仓库或通过外包给第三方物流服务提供商来满足所有客户需求。通过详尽的枚举来解决ULP，这是可行的，当interdics的基数不超过九个仓库中的五个时是可行的。对于LLP，我们实现了一个适用于选择性多仓库VRP的禁忌搜索启发式。我们的结果是通过标准MDVRP测试实例合成构成的一组RI-SMDVRP实例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号