%0 Journal Article %T A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs %+ Czech Technical University in Prague (CTU) %+ Laboratoire d'Optimisation des Systèmes Industriels (LOSI) %A Melechovský, Jan %A Prins, Christian %A Wolfler Calvo, Roberto %< avec comité de lecture %@ 1381-1231 %J Journal of Heuristics %I Springer Verlag %V 11 %N 5-6 %P 375-391 %8 2005-12 %D 2005 %R 10.1007/s10732-005-3601-1 %K location %K location-routing %K tabu search %K Variable Neighborhood Search %Z Computer Science [cs]/Operations Research [cs.RO]Journal articles %X 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. %G English %L hal-02477596 %U https://utt.hal.science/hal-02477596 %~ CNRS %~ UNIV-TROYES %~ UTT %~ LOSI