Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Ingeniería y Ciencia
Print version ISSN 1794-9165
Abstract
LINFATI, Rodrigo; ESCOBAR, John Willmer and 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.
Keywords : Location Routing Problem; Heterogeneous Fleet; Granular Tabu Search; Metaheuristic Algorithms.