A hybrid metaheuristic algorithm for the capacitated location routing problem

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.

• Autores: Escobar, John Willmer; Linfati, Rodrigo; Adarme-Jaimes, Wilson
• Tipo de recurso: Article of journal
• Fecha de publicación: 2015
• Institución: Universidad Nacional de Colombia
• Repositorio: Universidad Nacional de Colombia
• Idioma: spa
• OAI Identifier: oai:repositorio.unal.edu.co:unal/60786
• Acceso en línea: https://repositorio.unal.edu.co/handle/unal/60786; http://bdigital.unal.edu.co/59118/
• Palabra clave: 62 Ingeniería y operaciones afines / Engineering; Location Routing Problem (LRP); Iterated Local Search (ILS); Granular Tabu Search (GTS); Metaheuristic Algorithms.
• Rights: openAccess
• License: Atribución-NoComercial 4.0 Internacional