Publicación:
A GRANULAR VARIABLE TABU NEIGHBORHOOD SEARCH FOR THE CAPACITATED LOCATION-ROUTING PROBLEM

Vista sencilla de ítem
dc.creatorRODRIGO CARLOS EUGENIO LINFATI MEDINA
dc.date2014
dc.date.accessioned2025-01-10T14:29:34Z
dc.date.available2025-01-10T14:29:34Z
dc.date.issued2014
dc.description.abstractTHIS PAPER PROPOSES A NEW HEURISTIC ALGORITHM FOR THE CAPACITATED LOCATION-ROUTING PROBLEM (CLRP), CALLED GRANULAR VARIABLE TABU NEIGHBORHOOD SEARCH (GVTNS). THIS HEURISTIC INCLUDES A GRANULAR TABU SEARCH WITHIN A VARIABLE NEIGHBORHOOD SEARCH ALGORITHM. THE PROPOSED ALGORITHM IS EXPERIMENTALLY COMPARED ON THE BENCHMARK INSTANCES FROM THE LITERATURE WITH SEVERAL OF THE MOST EFFECTIVE HEURISTICS PROPOSED FOR THE SOLUTION OF THE CLRP, BY TAKING INTO ACCOUNT THE CPU TIME AND THE QUALITY OF THE SOLUTIONS OBTAINED. THE COMPUTATIONAL RESULTS SHOW THAT GVTNS IS ABLE TO OBTAIN GOOD AVERAGE SOLUTIONS IN SHORT CPU TIMES, AND TO IMPROVE FIVE BEST KNOWN SOLUTIONS FROM THE LITERATURE. THE MAIN CONTRIBUTION OF THIS PAPER IS TO SHOW A SUCCESSFUL NEW HEURISTIC FOR THE CLRP, COMBINING TWO KNOWN HEURISTIC APPROACHES TO IMPROVE THE GLOBAL PERFORMANCE OF THE PROPOSED ALGORITHM FOR WHAT CONCERNS BOTH THE QUALITY OF THE SOLUTIONS AND THE COMPUTING TIMES REQUIRED TO FIND THEM.
dc.formatapplication/pdf
dc.identifier.doi10.1016/j.trb.2014.05.014
dc.identifier.issn0191-2615
dc.identifier.urihttps://repositorio.ubiobio.cl/handle/123456789/7669
dc.languagespa
dc.publisherTRANSPORTATION RESEARCH PART B-METHODOLOGICAL
dc.relation.uri10.1016/j.trb.2014.05.014
dc.rightsPUBLICADA
dc.subjectVARIABLE NEIGHBORHOOD SEARCH
dc.subjectGRANULAR TABU SEARCH
dc.subjectCAPACITATED LOCATION ROUTING PROBLEM
dc.titleA GRANULAR VARIABLE TABU NEIGHBORHOOD SEARCH FOR THE CAPACITATED LOCATION-ROUTING PROBLEM
dc.typeARTÍCULO
dspace.entity.typePublication
ubb.EstadoPUBLICADA
ubb.Otra ReparticionDEPARTAMENTO DE INGENIERIA INDUSTRIAL
ubb.SedeCONCEPCIÓN
Archivos
Colecciones
Artículos científicos