Publicación: MIXED-INTEGER LINEAR PROGRAMMING MODELS FOR THE VEHICLE ROUTING PROBLEM WITH RELEASE TIMES AND RELOADING AT MOBILE SATELLITES
Cargando...
Fecha
2025
Título de la revista
ISSN de la revista
Título del volumen
Editor
MATHEMATICS
Resumen
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 E{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.
Descripción
Palabras clave
Vehicle routing problem, Release times, Mobile satellites, Route reloading, Last-mile logistics
