A comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH)

Vista sencilla de ítem
dc.contributor.authorBernal-Moyano, J.A.
dc.contributor.authorEscobar, J.W.
dc.contributor.authorMarín-Moreno, C.
dc.contributor.authorLinfati, R.
dc.contributor.authorGatica, G.
dc.date.accessioned2017-12-13T20:46:19Z
dc.date.available2017-12-13T20:46:19Z
dc.date.issued2017
dc.descriptionIndexación: Scopus.es_CL
dc.description.abstractWe consider the Location-Routing Problem with Heterogeneous Fleet (LRPH) in which the goal is to determine the depots to be opened, the customers to be assigned to each open depot, and the corresponding routes fulfilling the demand of the customers and by considering a heterogeneous fleet. We propose a comparison of granular approaches of Simulated Annealing (GSA), of Variable Neighborhood Search (GVNS) and of a probabilistic Tabu Search (pGTS) for the LRPH. Thus, the proposed approaches consider a subset of the search space in which non-favorable movements are discarded regarding a granularity factor. The proposed algorithms are experimentally compared for the solution of the LRPH, by taking into account the CPU time and the quality of the solutions obtained on the instances adapted from the literature. The computational results show that algorithm GSA is able to obtain high quality solutions within short CPU times, improving the results obtained by the other proposed approaches.es_CL
dc.description.urihttps://revistas.unal.edu.co/index.php/dyna/article/view/55533/58961
dc.identifier.citationDYNA (Colombia) Volume 84, Issue 200, 2017, Pages 193-201es_CL
dc.identifier.issn0012-7353
dc.identifier.otherDOI: 10.15446/dyna.v84n200.55533
dc.identifier.urihttp://repositorio.unab.cl/xmlui/handle/ria/4890
dc.language.isoenes_CL
dc.publisherUniversidad Nacional de Colombiaes_CL
dc.subjectHeterogeneous fleetes_CL
dc.subjectLocation-routing problemes_CL
dc.subjectMetaheuristic algorithmses_CL
dc.subjectProbabilistic tabu searches_CL
dc.subjectSimulated annealinges_CL
dc.subjectVariable neighborhood searches_CL
dc.titleA comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH)es_CL
dc.title.alternativeUna comparación de algoritmos basados en trayectoria granular para el problema de localización y ruteo con flota heterogénea (LRPH)es_CL
dc.typeArtículoes_CL
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Bernal-Moyano_A_comparison_of_trajectory.pdf
Tamaño:
775.81 KB
Formato:
Adobe Portable Document Format
Descripción:
TEXTO COMPLETO EN INGLES
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar
Colecciones
FIng - Artículos de Revista