论文标题

解决两座车辆和无人机路由问题的计算方法

Computational Approaches for Solving Two-Echelon Vehicle and UAV Routing Problems for Post-Disaster Humanitarian Operations

论文作者

Faiz, Tasnim Ibn, Vogiatzis, Chrysafis, Noor-E-Alam, Md.

论文摘要

灾难发生后,人道主义物流服务提供者立即承担两个主要责任:找到被困的人并为他们提供路线援助。运输和电信网络中的失败进一步阻碍了这些困难的操作,这些网络通常会因当前的灾难而无法使用。在这项工作中,我们提出了一个两型式车辆的车辆路由框架,用于使用空中未驾驶的自动驾驶汽车(UAVS或无人机)进行这些操作,以解决与这些故障相关的问题。在我们提出的框架中,我们假设地面车辆无法直接到达被困的人口,但是它们只能将无人机从仓库运输到某些中间位置。从这些地点发射的无人机既可以确定对医疗和其他艾滋病的需求(例如Epi-Pens,医疗用品,干粮,水),并进行交付以满足它们。具体而言,我们提出了一个决策框架,其中将产生的优化问题作为卡车作为第一台梯队车辆和第二次梯队车辆的两种eChelon车辆路线问题提出,我们考虑了两种类型的无人机。热点无人机具有提供手机和互​​联网接收的能力,因此用于捕获需求。随后,运输无人机被用来满足观察到的需求。为了处理需求不确定性,我们将决策问题分解为两个阶段:在第一阶段提供电信功能,从而精确地捕获需求,并在第二阶段满足所得需求。为了解决所得模型,我们通过设计具有基于柱生成(CG)的启发式方法的分解算法来提出有效的计算方法,以识别最佳的无人机路线。

Humanitarian logistics service providers have two major responsibilities immediately after a disaster: locating trapped people and routing aid to them. These difficult operations are further hindered by failures in the transportation and telecommunications networks, which are often rendered unusable by the disaster at hand. In this work, we propose a two-echelon vehicle routing framework for performing these operations using aerial uncrewed autonomous vehicles (UAVs or drones) to address the issues associated with these failures. In our proposed framework, we assume that ground vehicles cannot reach the trapped population directly, but they can only transport drones from a depot to some intermediate locations. The drones launched from these locations serve to both identify demands for medical and other aids (e.g., epi-pens, medical supplies, dry food, water) and make deliveries to satisfy them. Specifically, we present a decision framework, in which the resulting optimization problem is formulated as a two-echelon vehicle routing problem with trucks as the first echelon vehicles and for the second echelon vehicles, we consider two types of drones. Hotspot drones have the capability of providing a cell phone and internet reception and hence are used to capture demands. Delivery drones are subsequently employed to satisfy the observed demand. To handle demand uncertainty, we decompose the decision problem into two stages: providing telecommunications capabilities in the first stage thereby capturing demand precisely, and satisfying the resulting demands in the second stage. To solve the resulting models, we propose efficient computational approaches by designing a decomposition algorithm with column generation (CG)-based heuristics to identify optimal drone routes.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源