SearcharxivSearch

arXiv · 2506.10311

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery

Abstract

This paper proposes a novel freight multimodal transport problem with buses and drones, where buses are responsible for transporting parcels to lockers at bus stops for storage, while drones are used to deliver each parcel from the locker to the corresponding customer. The integrated bus-drone system synergistically expands drone service coverage using the bus network to ensure efficient final delivery. Minimizing the total operational costs while satisfying customer demands necessitates the joint optimization of parcel assignments and drone flights. We model the problem into a compact mixed-integer linear programming formulation and propose an integer programming formulation with exponentially many variables. To address real-world scale instances, we propose a Branch-Price-and-Benders-Cut algorithm for this non-deterministic polynomial-time (NP)-hard problem. This algorithm, integrating column generation and Benders decomposition within a Branch-and-Bound framework, is developed to obtain optimal or near-optimal solutions. Additionally, we introduce algorithmic enhancements aimed at accelerating the convergence of the algorithm. Computational experiments on instances generated from real-world bus data demonstrate that the proposed algorithms outperform CPLEX regarding both efficiency and solution quality. Moreover, our approaches can lead to over 6% cost savings compared to situations where we determine parcel assignments and drone flights sequentially. We evaluate the environmental advantages of integrating buses and drones, study the impact of different cost parameters in the system, and investigate the impact of the parcel locker configuration on performance. These findings provide valuable managerial insights for urban logistics managers, highlighting the potential of the integrated bus-drone system to improve traditional last-mile delivery.

Explore related subjects

Keep this discovery

BibTeXRIS

E Su, Hu Qin, Jiliu Li, Rui Zhang. 2025-06-12. The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery. https://arxiv.org/abs/2506.10311

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

KEEP EXPLORING

Related papers

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM