Publicación:
A HYBRID METAHEURISTIC ALGORITHM FOR THE CAPACITATED LOCATION ROUTING PROBLEM

dc.creatorRODRIGO CARLOS EUGENIO LINFATI MEDINA
dc.date2015
dc.date.accessioned2025-01-10T14:29:36Z
dc.date.available2025-01-10T14:29:36Z
dc.date.issued2015
dc.description.abstractTHIS PAPER ADDRESSES THE CAPACITATED LOCATION-ROUTING PROBLEM (CLRP) IN WHICH THE AIM IS TO DETERMINE THE DEPOTS TO BE OPENED, THE CUSTOMERS TO BE ASSIGNED TO EACH OPEN DEPOT, AND THE ROUTES TO BE PERFORMED TO FULFILL THE DEMAND OF THE CUSTOMERS. THE OBJECTIVE IS TO MINIMIZE THE SUM OF THE COST OF THE OPEN DEPOTS, OF THE USED VEHICLE COSTS, AND OF THE VARIABLE COSTS ASSOCIATED WITH THE DISTANCE TRAVELED BY THE PERFORMED ROUTES. IN THIS PAPER, A GRANULAR TABU SEARCH (GTS) WITH DIFFERENT DIVERSIFICATION STRATEGIES WITHIN A ITERATED LOCAL SEARCH (ILS) IS PROPOSED TO SOLVE THE CLRP. A SHAKING PROCEDURE IS APPLIED WHENEVER THE BEST SOLUTION FOUND SO FAR IS NOT IMPROVED FOR A GIVEN NUMBER OF ITERATIONS. COMPUTATIONAL EXPERIMENTS ON BENCHMARK INSTANCES TAKEN FROM THE LITERATURE SHOW THAT THE PROPOSED APPROACH IS ABLE TO OBTAIN, WITHIN SHORT COMPUTING TIMES, HIGH QUALITY SOLUTIONS ILLUSTRATING ITS EFFECTIVENESS.
dc.formatapplication/pdf
dc.identifier.doi10.15446/dyna.v82n189.48552
dc.identifier.issn0012-7361
dc.identifier.issn1989-1490
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/7671
dc.languagespa
dc.publisherDYNA
dc.relation.uri10.15446/dyna.v82n189.48552
dc.rightsPUBLICADA
dc.subjectMETAHEURISTIC ALGORITHMS.
dc.subjectLOCATION ROUTING PROBLEM (LRP)
dc.subjectITERATED LOCAL SEARCH (ILS)
dc.subjectGRANULAR TABU SEARCH (GTS)
dc.titleA HYBRID METAHEURISTIC ALGORITHM FOR THE CAPACITATED LOCATION ROUTING PROBLEM
dc.title.alternativeUN ALGORITMO METAHEURÍSTICO HÍBRIDO PARA EL PROBLEMA DE LOCALIZACIÓN Y RUTEO CON RESTRICCIONES DE CAPACIDAD
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos