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

We 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.

item.page.dc.description

Indexación: Scopus.

Keywords

Heterogeneous fleet, Location-routing problem, Metaheuristic algorithms, Probabilistic tabu search, Simulated annealing, Variable neighborhood search

Citation

DYNA (Colombia) Volume 84, Issue 200, 2017, Pages 193-201

URI

http://repositorio.unab.cl/xmlui/handle/ria/4890

Collections

FIng - Artículos de Revista

Full item page