Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics

Saswata Jana; Partha Sarathi Mandal

Home/Archive/arXiv

arXiv · 2604.23015

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics

Saswata Jana·Partha Sarathi Mandal

View original source ↗Read source document ↗Export metadata ↓

Abstract

Collaboration between drones and trucks in a last-mile delivery system offers numerous benefits and reduces many challenges of the traditional delivery system. Here, we introduce Drone-Delivery Packing Problem, where a set of parcels, associated with delivery intervals and cost, should be delivered to customer locations. The system comprises a set of identical drones and battery stations along truck's route, where drones swap depleted batteries or recharge them. The objective is to find assignment for all parcels by using the minimum number of drones, subject to the battery budget and compatibility of each drone's assignment. We consider three variants of the problem, based on conflicting characteristics and existence of battery service stations. All are NP-hard, and we have proposed approximation algorithms for each. When there are no battery stations, we propose a constant factor approximation algorithm using first fit decreasing bin packing algorithm. When the intervals are non-conflicting, we design a $(2+ \psi)$-approximation algorithm. In the presence of both battery stations and conflicting intervals, we present a $(4+\psi)$-approximation algorithm. The algorithm is later modified into a $(3+\psi)$-approximation algorithm when the battery service stations act as swapping stations. Here $\psi$ is a function of battery budget, minimum and maximum cost of the deliveries. Finally, we validate our results and compare the performance with the optimum on different instances.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Saswata Jana, Partha Sarathi Mandal. 2026-04-24. Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics. https://arxiv.org/abs/2604.23015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗