Modeling and planning a novel logistic transport system: Several drone pickups for each delivery
Archivos
Fecha
2026
Nota de Acceso
Fecha de embargo
Profe guía
Perfil ORCID
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier
ISBN
ISSN
0377-2217
ISSNe
Resumen
This paper presents the Delivery Drone Routing Problem with Limited Inventory (DDRPI), an extension of the Pickup-to-Delivery Drone Routing Problem (PDDRP). In the PDDRP, each customer may order multiple products, and each facility is assumed to hold unlimited inventory of all products. In the DDRPI, this assumption is removed: not all products are necessarily available at a single facility, which may require drones to visit multiple facilities to fulfill a customer’s order. A mixed integer linear programming model is formulated to solve the problem. However, due to the high computational complexity of the DDRPI, CPLEX can only solve small instances. Therefore, a hybrid metaheuristic combining GRASP with a VND procedure is employed to address larger instances. Computational experiments are conducted to assess the limitations of the exact approach, the effectiveness of the proposed metaheuristic, the impact of drone battery constraints on the objective function, and the influence of different demand and inventory distribution patterns.
Descripción
Lugar de Publicación
Netherlands
Sponsorship
Citación
European Journal of Operational Research, Vo. 334 (2026) pp. 858-881
Palabras clave
Routing Drone delivery, Limited Inventory, Metaheuristics, Traveling Purchaser Problem
Licencia
Atribución-NoComercial-CompartirIgual 3.0 Chile (CC BY-NC-SA 3.0 CL)