Resumo

ESCOBAR, John Willmer  e  LINFATI, Rodrigo. A META-HEURISTIC ALGORITHM BASED ON THE SIMULATED ANNEALING WITH GRANULAR SEARCH SPACE FOR THE CAPACITATED LOCATION ROUTING PROBLEM. Rev. ing. univ. Medellín [online]. 2012, vol.11, n.21, pp.139-150. ISSN 1692-3324.

The article deals with the Capacitated Location Routing Problem (CLRP) where the goal is to determine the depots to be opened, the customers to be assigned to each deposit opened, and the routes to be constructed for fulfilling customers' demands. The objective is to minimize the sum of costs resulting from opening depots, costs resulting from used vehicles, and variable costs associated to the distance across the routes. In this paper, a metaheuristic based on simulated annealing with granular search space for solving the CLRP is proposed. Computational experiments on benchmarking instances taken from literature show that the proposed algorithm is able to obtain high-quality solutions within reasonable computational times, thus showing its efficiency.

Palavras-chave : location routing problem; simulated annealing; granular search; metaheuristic algorithms.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )