Publicación:
A GRANULAR TABU SEARCH ALGORITHM FOR A REAL CASE STUDY OF A VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS

dc.creatorRODRIGO CARLOS EUGENIO LINFATI MEDINA
dc.date2018
dc.date.accessioned2025-01-10T15:35:17Z
dc.date.available2025-01-10T15:35:17Z
dc.date.issued2018
dc.description.abstractWE CONSIDER A REAL CASE STUDY OF A VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS (HFVRPTW) FOR A FRANCHISE COMPANY BOTTLING COCA-COLA PRODUCTS IN COLOMBIA. THIS STUDY AIMS TO DETERMINE THE ROUTES TO BE PERFORMED TO FULFILL THE DEMAND OF THE CUSTOMERS BY USING A HETEROGENEOUS FLEET AND CONSIDERING SOFT TIME WINDOWS. THE OBJECTIVE IS TO MINIMIZE THE DISTANCE TRAVELED BY THE PERFORMED ROUTES. WE PROPOSE A TWO-PHASE HEURISTIC ALGORITHM. IN THE PROPOSED APPROACH, AFTER AN INITIAL PHASE (FIRST PHASE), A GRANULAR TABU SEARCH IS APPLIED DURING THE IMPROVEMENT PHASE (SECOND PHASE). TWO ADDITIONAL PROCEDURES ARE CONSIDERED TO HELP THAT THE ALGORITHM COULD ESCAPE FROM LOCAL OPTIMUM, GIVEN THAT DURING A GIVEN NUMBER OF ITERATIONS THERE HAS BEEN NO IMPROVEMENT. COMPUTATIONAL EXPERIMENTS ON REAL INSTANCES SHOW THAT THE PROPOSED ALGORITHM IS ABLE TO OBTAIN HIGH-QUALITY SOLUTIONS WITHIN A SHORT COMPUTING TIME COMPARED TO THE RESULTS FOUND BY THE SOFTWARE THAT THE COMPANY CURRENTLY USES TO PLAN THE DAILY ROUTES.
dc.formatapplication/pdf
dc.identifier.issn2169-8767
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/12719
dc.languagespa
dc.publisherPROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT
dc.rightsPUBLICADA
dc.subjectVehicle Routing Problem
dc.subjectTime Windows
dc.subjectReal Case Study
dc.subjectHeterogeneous Fleet
dc.titleA GRANULAR TABU SEARCH ALGORITHM FOR A REAL CASE STUDY OF A VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS
dc.typeACTA DE CONFERENCIA
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones