Skip to Main content Skip to Navigation
Journal articles

A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02477596
Contributor : Daniel Gavrysiak <>
Submitted on : Thursday, February 13, 2020 - 2:50:11 PM
Last modification on : Wednesday, May 20, 2020 - 11:58:04 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Jan Melechovský, Christian Prins, Roberto Wolfler Calvo. A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs. Journal of Heuristics, Springer Verlag, 2005, 11 (5-6), pp.375-391. ⟨10.1007/s10732-005-3601-1⟩. ⟨hal-02477596⟩

Share

Metrics

Record views

36