• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Record >Minimal Arc Partitioning Problem: Formulation and Application in Snow Routing with Service Route Continuity
【24h】

Minimal Arc Partitioning Problem: Formulation and Application in Snow Routing with Service Route Continuity

机译：最小弧分割问题：具有服务路径连续性的积雪路线的制定和应用

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

摘要

The present research deals with a special case of emergency truck routing for snow removal or salting (snow routing) in which the objective function is primarily to minimize the number of trucks and secondarily to minimize the number of deadhead miles while the snow network is salted as much as required and the trucks' salting capacity is not violated. An additional constraint requires each truck service route to be a connected network. This route continuity constraint helps avoid confusion for truck drivers. A three-phase approach to the problem is presented: first, minimize the number of trucks; second, balance the workloads; and third, find the best routes to minimize the number of deadhead miles. The minimal arc partitioning problem (MAP) is introduced as an abstraction of the first phase (minimization of the number of trucks). MAP is stated as determination of the minimal arc partitioning of a network so that each partition (subnetwork) constitutes a connected network and so that capacity constraints are satisfied. Balancing the trucks and routing them to each subnetwork are dealt with in the other phases. The approach is applied to a real-world snow emergency network, and the results are discussed. It is demonstrated that the number of trucks can be reduced by up to 15% and the number of deadhead miles can be reduced by up to 70% compared with the number of trucks and the number of deadhead miles with the current plan. In addition, the overall algorithm is quite fast.
机译：本研究涉及一种用于除雪或撒盐（雪地撒雪）的紧急卡车路线的特殊情况，其主要功能是最大程度地减少卡车数量，其次是在雪网被盐化时最小化无人驾驶里程数。充分满足要求，卡车的加盐能力没有受到侵犯。附加的约束要求每个卡车服务路线都必须是连接的网络。此路线连续性约束有助于避免卡车司机感到困惑。提出了解决该问题的三个阶段的方法：第一，减少卡车的数量；第二，减少卡车的数量。第二，平衡工作量；第三，找到最佳路线，以减少空头英里数。引入最小弧划分问题（MAP）作为对第一阶段的抽象（卡车数量的最小化）。 MAP表示为确定网络的最小弧形分区，以便每个分区（子网）构成一个连接的网络，并满足容量约束。在其他阶段中，将卡车平衡并路由到每个子网。该方法被应用于现实世界的雪灾应急网络，并讨论了结果。事实证明，与当前计划的卡车数量和无头里程数相比，卡车的数量最多可减少15％，无头里程数最多可减少70％。另外，整个算法相当快。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号