View in EDS

A branch-and-price-and-cut algorithm for the unmanned aerial vehicle delivery with battery swapping.

Saved in:
Bibliographic Details
Title: A branch-and-price-and-cut algorithm for the unmanned aerial vehicle delivery with battery swapping.
Authors: Pei, Zhi, Pan, Wuhao, Weng, Kebiao, Fang, Tao
Source: International Journal of Production Research; Oct2024, Vol. 62 Issue 19, p7030-7055, 26p
Subject Terms: MIXED integer linear programming, AIRLINE routes, DRONE aircraft delivery, DRONE aircraft, LITHIUM cells
Abstract: In the UAV-based urban delivery setting, the battery capacity serves as one of the key factors affecting the delivery range of drones. For a typical multi-rotor unmanned aerial vehicle (UAV), the maximum effective working range of a lithium battery for a single flight leg is approximately 20 km. In practice, the lithium battery is replaced each time the UAV completes a delivery, even though the remaining power of the replaced lithium battery is still capable of supporting the following flight legs. Therefore, the one-order-one-swapping strategy significantly brings down the battery utilisation as well as the efficiency of the delivery system. In the present paper, the UAV-based delivery problem with battery swapping decision is considered, where multiple en route pickup and deliveries are allowed. To obtain optimal decisions in terms of flight route, time and location of each battery swapping, a branch-and-price-and-cut algorithm is introduced. First we formulate this problem as a mixed integer linear programming (MILP) model, and then decompose it into a master problem and a pricing sub-problem, where the master problem is considered as a set covering model, and the sub-problem as an elementary shortest path problem with resource constraints (ESPPRC). To speed up the process of column generation, efficient heuristics are also integrated to provide basic feasible solutions. In the pricing sub-problem, a combination of heuristic algorithm and dynamic programming is implemented to improve the computational efficiency. In the numerical experiments, the proposed algorithm is tested on various scales of UAV-based urban delivery instances, the performance of which is analysed and compared with the off-the-shelf commercial solver. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:In the UAV-based urban delivery setting, the battery capacity serves as one of the key factors affecting the delivery range of drones. For a typical multi-rotor unmanned aerial vehicle (UAV), the maximum effective working range of a lithium battery for a single flight leg is approximately 20 km. In practice, the lithium battery is replaced each time the UAV completes a delivery, even though the remaining power of the replaced lithium battery is still capable of supporting the following flight legs. Therefore, the one-order-one-swapping strategy significantly brings down the battery utilisation as well as the efficiency of the delivery system. In the present paper, the UAV-based delivery problem with battery swapping decision is considered, where multiple en route pickup and deliveries are allowed. To obtain optimal decisions in terms of flight route, time and location of each battery swapping, a branch-and-price-and-cut algorithm is introduced. First we formulate this problem as a mixed integer linear programming (MILP) model, and then decompose it into a master problem and a pricing sub-problem, where the master problem is considered as a set covering model, and the sub-problem as an elementary shortest path problem with resource constraints (ESPPRC). To speed up the process of column generation, efficient heuristics are also integrated to provide basic feasible solutions. In the pricing sub-problem, a combination of heuristic algorithm and dynamic programming is implemented to improve the computational efficiency. In the numerical experiments, the proposed algorithm is tested on various scales of UAV-based urban delivery instances, the performance of which is analysed and compared with the off-the-shelf commercial solver. [ABSTRACT FROM AUTHOR]
ISSN:00207543
DOI:10.1080/00207543.2024.2318017