Una comparación de algoritmos basados en trayectoria granular para el problema de localización y ruteo con flota heterogénea (LRPH)

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

José Alfonso Bernal-Moyano, John Willme Escobar, Cesar Marín-Moreno, Rodrigo Linfati, Gustavo Gatica

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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.

Translated title of the contributionA comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH)
Original languageSpanish
Pages (from-to)193-201
Number of pages9
JournalDYNA (Colombia)
Volume84
Issue number200
DOIs
Publication statusPublished - 2017

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'A comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH)'. Together they form a unique fingerprint.

Cite this