SciELO - Scientific Electronic Library Online

 
vol.10 número19Un modelo matemático para sistemas de jubilación del seguro social con sistemas dinámicosReubicación óptima de transformadores de distribución usando el algoritmo multiobjetivo de optimización NSGA II índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • No hay articulos similaresSimilares en SciELO
  • En proceso de indezaciónSimilares en Google

Compartir


Ingeniería y Ciencia

versión impresa ISSN 1794-9165

Resumen

LINFATI, Rodrigo; ESCOBAR, John Willmer  y  GATICA, Gustavo. A Metaheuristic Algorithm for the Location Routing Problem with Heterogeneous Fleet. ing.cienc. [online]. 2014, vol.10, n.19, pp.55-76. ISSN 1794-9165.

This paper considers the Location-Routing Problem with Heterogeneous Fleet (LRPH), 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 by considering a heterogeneous fleet with different capacities and associated costs. The objective is to minimize the sum of the cost of the open depots, of the used vehicle costs, and of the variable costs related with the distance traveled by the performed routes. In this paper, it is proposed a metaheuristic algorithm based on a granular tabu search to solve the LRPH. Computational experiments on adapted benchmark instances from the literature show that the proposed approach is able to obtain, within short computing times, high quality solutions illustrating its effectiveness.

Palabras clave : Location Routing Problem; Heterogeneous Fleet; Granular Tabu Search; Metaheuristic Algorithms.

        · resumen en Español     · texto en Español     · Español ( pdf )