A Metaheuristic Algorithm for the Location Routing Problem with Heterogeneous Fleet

Ingeniería y Ciencia

Gatica, Gustavo²  Linfati, Rodrigo¹  Escobar, John Willmer² 

[1] Universidad del Bío-Bío, [e-mail], Chile;Pontificia Universidad Javeriana, Cali, Colombia

关键词: Problema de Localizació;    n y Ruteo;    Flota Heterogé;    nea;    Bú;    squeda Tabú;    Granular;    Algoritmos Metaheurí;    sticos;   

DOI  :  

学科分类：工程和技术（综合）

来源: Universidad E A F I T

【 摘 要 】

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.

【 授权许可】

Unknown