Publicación:
A SIMULATED ANNEALING-BASED APPROACH FOR A REAL CASE STUDY OF VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS

Imagen por defecto
Fecha
2021
Título de la revista
ISSN de la revista
Título del volumen
Editor
International Journal of Shipping and Transport Logistics
Proyectos de investigación
Unidades organizativas
Número de la revista
Resumen
WE PROPOSE A META-HEURISTIC ALGORITHM FOR ADDRESSING A REAL CASE OF VEHICLE ROUTING PROBLEM WITH A HETEROGENEOUS FLEET AND TIME WINDOWS. OUR PROPOSAL CONSISTS OF GENERATING AN INITIAL FEASIBLE SOLUTION USING THE SOLUTION OF A TRAVELLING SALESMAN PROBLEM AND, SUBSEQUENTLY, REFINING IT THROUGH SIMULATED ANNEALING. IN THIS WORK, WE EVALUATE THE SUITABILITY OF OUR DEVELOPMENT TO PLANNING THE DISTRIBUTION OF A REGIONAL DISTRIBUTION CENTRE OF A FOOD COMPANY TO CUSTOMERS WITHIN THE URBAN PERIMETER OF CALI, COLOMBIA. FOLLOWING THE COMPANY S CUSTOMER SATISFACTION GOALS, OUR PRIMARY AIM IS TO ROUTE TO REACH A SERVICE LEVEL OF 95% WHILE REDUCING OPERATIONAL COSTS. OUR RESULTS ON OUR REAL CASE STUDY SHOW THAT OUR META-HEURISTIC ALGORITHM FINDS BETTER ROUTES THAN CURRENT ONES, IN TERMS OF COSTS AND SERVICE LEVELS, IN A RELATIVELY SHORT TIME.
Descripción
Palabras clave
Citación