A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs - Archive ouverte HAL Access content directly
Journal Articles Journal of Heuristics Year : 2005

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

(1) , (2) , (2)
1
2

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.

Dates and versions

hal-02477596 , version 1 (13-02-2020)

Identifiers

Cite

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

Collections

CNRS UTT LOSI
10 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More