| Title: | Two-echelon drone–truck collaborative TSP-based routing for humanitarian logistics with time windows and stochastic demand |
|---|
| Authors: | ID Xiao, N. (Author)
ID Lan, H. (Author) |
|---|
| Files: |  APEM20-3_351-368.pdf (975,35 KB)
MD5: 02C1340B0B25CDBFD9C604C1805B9C17
 https://apem-journal.org/Archives/2025/Abstract-APEM20-3_351-368.html
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FS - Faculty of Mechanical Engineering
|
|---|
| Abstract: | In humanitarian logistics emergency material transportation and distribution, trucks offer large load capacity and long driving range, whereas drone transportation is independent of ground road conditions but constrained by battery life and payload capacity. The coordination of the two can therefore provide complementary advantages. In this paper, the traveling salesman problem is formulated for a two-echelon emergency material distribution process, spanning transportation from the central warehouse to the distribution center and then to the demand points. In the first stage, transportation from the central warehouse to the distribution center is performed by trucks. In the second stage, trucks and drones collaboratively carry out material distribution from the distribution center to the demand points. Based on the above scenario, this paper aims to minimize the total cost of completing all distribution tasks. The model considers capacity constraints at distribution centers, time window constraints at demand points, and stochastic demand, and establishes a two-echelon traveling salesman problem for humanitarian logistics with truck–drone collaboration. Based on the particle swarm optimization (PSO) framework, a heuristic algorithm named PSO-VD is proposed, which transforms the discrete traveling salesman problem into a continuous encoding and integrates drone routes into truck routes using the 2-opt method. In small-scale instances, the solutions obtained by PSO-VD are compared with those of commercial solvers, demonstrating that the proposed algorithm achieves high accuracy with low computational time. For instances with up to 12 demand points, the algorithm obtains solutions within 150 seconds, with an accuracy deviation of less than 10 % compared to exact solution methods. The applicability of the algorithm proposed in this paper has been demonstrated through large-scale numerical examples. Sensitivity analyses are conducted on key parameters, including the time window penalty coefficient, drone speed, and drone battery capacity, yielding practical managerial insights. |
|---|
| Keywords: | humanitarian logistics, two-echelon routing, drone–vehicle collaboration, stochastic demand, time windows, capacity constraint, vehicle routing problem, VRP, travelling salesman problem, TSP, heuristic algorithm, particle swarm optimization, PSO |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Submitted for review: | 01.09.2025 |
|---|
| Article acceptance date: | 09.10.2025 |
|---|
| Publication date: | 31.10.2025 |
|---|
| Publisher: | Chair of Production Engineering (CPE), University of Maribor Faculty of Mechanical Engineering |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | str. 351-368 |
|---|
| Numbering: | Vol. 20, no. 3 |
|---|
| PID: | 20.500.12556/DKUM-96682  |
|---|
| UDC: | 658.5 |
|---|
| ISSN on article: | 1854-6250 |
|---|
| COBISS.SI-ID: | 265828611 |
|---|
| DOI: | 10.14743/apem2025.3.545 |
|---|
| Publication date in DKUM: | 23.01.2026 |
|---|
| Views: | 170 |
|---|
| Downloads: | 9 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
