Publicación:
MIXED-INTEGER LINEAR PROGRAMMING MODELS FOR THE VEHICLE ROUTING PROBLEM WITH RELEASE TIMES AND RELOADING AT MOBILE SATELLITES

Vista sencilla de ítem
dc.creatorJORGE FELIX MENA REYES
dc.creatorRAUL FERNANDO SOTO CONCHA
dc.creatorRODRIGO CARLOS EUGENIO LINFATI MEDINA
dc.date2025
dc.date.accessioned2026-01-16T13:26:09Z
dc.date.available2026-01-16T13:26:09Z
dc.date.issued2025
dc.description.abstractTHE 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.
dc.formatapplication/pdf
dc.identifier.doi10.3390/math13223638
dc.identifier.issn2227-7390
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/14328
dc.language
dc.publisherMATHEMATICS
dc.relation.uri10.3390/math13223638
dc.rightsOPEN ACCESS
dc.subjectVehicle routing problem
dc.subjectRelease times
dc.subjectMobile satellites
dc.subjectRoute reloading
dc.subjectLast-mile logistics
dc.titleMIXED-INTEGER LINEAR PROGRAMMING MODELS FOR THE VEHICLE ROUTING PROBLEM WITH RELEASE TIMES AND RELOADING AT MOBILE SATELLITES
dc.typeARTÍCULO
dspace.entity.typePublication
oaire.licenseConditionCC BY 4.0
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
ubb.SedeCONCEPCIÓN
ubb.SedeCONCEPCIÓN
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
documento_publicacion_16_01_2026_10_28_55.pdf
Tamaño:
3.62 MB
Formato:
Adobe Portable Document Format
Descripción:
Descargar
Colecciones
Artículos científicos