This study proposes a multiple-drones-multiple-trucks (MDMT) routing problem to assess infrastructure in the areas of disruption epicenters using multiple drones that operate in synchronicity with multiple trucks. Incorporating the trucks as moving depots enables drones to move across disrupted areas further from their flight range. The MDMT routing problem is formulated as mixed integer linear programming (MILP). This is an NP-Hard (Non-deterministic Polynomial-time Hardness) problem, which is solved by introducing a greedy heuristic algorithm to cluster the disrupted locations and plan each drone’s schedule within each disrupted cluster and between clusters. Both MILP and the greedy heuristic algorithm are tested for small to large test problems extracted from the Minneapolis–St. Paul freeway system with a grid-like network topology. Results show that disrupted locations’ spatial distribution affects the efficient number of active drones and trucks in the system. When direct travel between two nodes takes longer than other alternative paths, increasing the number of trucks accelerates the assessment procedure. Findings also indicate that the spatial distribution of disruptions clustered by the greedy heuristic algorithm is correlated with the routing time and affects drone scheduling. If clusters are scattered, each drone is typically assigned to one cluster for damage assessments. With a dense pocket of clusters in the network, however, a drone moves back and forth between multiple clusters. The proposed framework for disruption assessment provides insights on the optimal deployment of resources to collect information following a network disruption. Practitioners will also benefit from the findings to augment resource management.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multiple-Drones-Multiple-Trucks Routing Problem for Disruption Assessment


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2022-07-07




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones

    Mao, Ni / Wu, Guohua / Luo, Qizhang et al. | Springer Verlag | 2022


    A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones

    Mao, Ni / Wu, Guohua / Luo, Qizhang et al. | British Library Conference Proceedings | 2022


    Multi-trucks-and-drones cooperative pickup and delivery problem

    Gao, Jiajing / Zhen, Lu / Wang, Shuaian | Elsevier | 2023


    Scheduling trucks and drones for cooperative deliveries

    Gao, Jiajing / Zhen, Lu / Laporte, Gilbert et al. | Elsevier | 2023