Publicación: A GRANULAR TABU SEARCH ALGORITHM FOR A REAL CASE STUDY OF A VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS
Fecha
2018
Título de la revista
ISSN de la revista
Título del volumen
Editor
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND OPERATIONS MANAGEMENT
Resumen
WE 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.
Descripción
Palabras clave
Vehicle Routing Problem, Time Windows, Real Case Study, Heterogeneous Fleet
