SciELO - Scientific Electronic Library Online

 
vol.82 issue189Freight consolidation as a coordination mechanism in perishable supply chains: A simulation study author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


DYNA

Print version ISSN 0012-7353

Abstract

ESCOBAR, John Willmer; LINFATI, Rodrigo  and  ADARME-JAIMES, Wilson. A hybrid metaheuristic algorithm for the capacitated location routing problem. Dyna rev.fac.nac.minas [online]. 2015, vol.82, n.189, pp.243-251. ISSN 0012-7353.  http://dx.doi.org/10.15446/dyna.v82n189.48552.

This paper addresses the Capacitated Location-Routing Problem (CLRP) 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. The objective is to minimize the sum of the cost of the open depots, of the used vehicle costs, and of the variable costs associated with the distance traveled by the performed routes. In this paper, a Granular Tabu Search (GTS) with different diversification strategies within a Iterated Local Search (ILS) is proposed to solve the CLRP. A shaking procedure is applied whenever the best solution found so far is not improved for a given number of iterations. Computational experiments on benchmark instances taken from the literature show that the proposed approach is able to obtain, within short computing times, high quality solutions illustrating its effectiveness.

Keywords : Location Routing Problem (LRP); Iterated Local Search (ILS); Granular Tabu Search (GTS); Metaheuristic Algorithms.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )