Mixed-Integer Linear Programming Models for the Vehicle Routing Problem with Release Times and Reloading at Mobile Satellites

The Vehicle Routing Problem (VRP) is central to last-mile logistics, yet a gap remains when products have late release times and vehicles can be reloaded en route via mobile satellites that rendezvous with reloading vehicles at customer locations. We propose the VRP with Release Times and Reloading...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics (Basel) Ročník 13; číslo 22; s. 3638
Hlavní autoři: Soto-Concha, Raúl, Morillo-Torres, Daniel, Escobar, John Willmer, Mena-Reyes, Jorge Félix, Linfati, Rodrigo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.11.2025
Témata:
Collaboration
Costs
Customers
Integer programming
Inventory
last-mile logistics
Linear programming
Logistics
Mixed integer
Mobile communication systems
mobile satellites
Orbital rendezvous
release times
route reloading
Satellites
Synchronism
Vehicle routing
vehicle routing problem
Vehicles
Wireless communication systems
Chile
ISSN:2227-7390, 2227-7390
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Vehicle Routing Problem (VRP) is central to last-mile logistics, yet a gap remains when products have late release times and vehicles can be reloaded en route via mobile satellites that rendezvous with reloading vehicles at customer locations. We propose the VRP with Release Times and Reloading at Mobile Satellites (VRP-RT-RMS) and develop two mixed-integer linear programming formulations: a three-index (MILP-3) and a two-index (MILP-2). The objective minimizes total distance subject to capacity, route duration, synchronization, and time constraints. We generated 40 instances from real data (10 per size N∈{10,15,20,25}). En-route reloads simultaneously reduce distance and fleet size and can restore feasibility when the classical VRP is infeasible. To contrast the classical VRP with our VRP-RT-RMS, we analyzed a particular instance with N=10 customers: total distance decreased by 7.26% and the number of vehicles fell from 5 to 3. As instance size grows, MILP-2 shows superior scalability and efficiency compared with MILP-3. Beyond the technical scope, coordinating reloads is pertinent to urban operations with late product releases, lowering kilometers traveled and delivery times.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math13223638