A metaheuristic to solve a location–routing problem with non-linear costs

A metaheuristic to solve a location–routing problem with non-linear costs

0.00 Avg rating0 Votes
Article ID: iaor2006427
Country: Germany
Volume: 11
Issue: 5/6
Start Page Number: 375
End Page Number: 391
Publication Date: Dec 2005
Journal: Journal of Heuristics
Authors: , ,
Keywords: organization, heuristics
Abstract:

The paper deals with a location–routing problem with non-linear cost functions. To the best of our knowledge, a mixed integer linear programming formulation for the addressed problem is proposed here for the first time. Since the problem is NP-hard exact algorithms are able to solve only particular cases, thus to solve more general versions heuristics are needed. The algorithm proposed in this paper is a combination of a p-median approach to find an initial feasible solution and a metaheuristic to improve the solution. It is a hybrid metaheuristic merging Variable Neighborhood Search (VNS) and Tabu Search (TS) principles and exploiting the synergies between the two. Computational results and conclusions close the paper.

Reviews

Required fields are marked *. Your email address will not be published.