The use of UAVs for logistics services has become a highly regarded application in recent years. This paper studies the package pickup and delivery problem with multi-commodity and multi-visits. Due to the limited load, the UAV has to operate within the load limit when performing package delivery services. In addition, we allow the UAV to visit a location multiple times during the mission. Our objective is to minimize the total flying distance of the UAV. Since the problem is NP-hard, we propose a two-phase heuristic algorithm to solve this problem. First, the trajectory of the UAV to pick up or deliver packages is constructed using a greedy algorithm. Second, we optimize the previously built trajectory to obtain a shorter flying distance for the UAV. The simulation results show that the proposed algorithm outperforms the baselines regarding total flight distance and execution time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Planning UAV Trajectory for Multi-Commodity Package Pickup and Delivery


    Contributors:


    Publication date :

    2025-03-24


    Size :

    772245 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Commodity pickup apparatus

    KONISHI SHOTA / HIROI KANYA | European Patent Office | 2024

    Free access

    COMMODITY PICKUP APPARATUS

    KONISHI SHOTA / HIROI MIKIYA | European Patent Office | 2022

    Free access

    Re-Route Package Pickup and Delivery Planning with Random Demands

    Sawadsitang, Suttinee / Niyato, Dusit / Suankaewmanee, Kongrath et al. | IEEE | 2019


    The split-demand one-commodity pickup-and-delivery travelling salesman problem

    Salazar-González, Juan-José | Online Contents | 2015


    Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

    Hernández-Pérez, Hipólito | Online Contents | 2004