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

Authors:
Jan Melechovský;Christian Prins;Roberto Wolfler Calvo
Affiliations:
Department of Logistics and Transportation Processes, Faculty of Transportation Sciences, Czech Technical University, Prague 2, Czech Republic CZ-128 03;Institut des Sciences et Technologies de l'Information de Troyes (ISTIT), Université de Technologie de Troyes, Troyes, France 10010;Institut des Sciences et Technologies de l'Information de Troyes (ISTIT), Université de Technologie de Troyes, Troyes, France 10010
Venue:
Journal of Heuristics
Year:
2005

Citing 5
Cited 3

Tabu Search

Tabu Search
Variable Neighborhood Decomposition Search

Journal of Heuristics
Heuristic solutions to multi-depot location-routing problems

Computers and Operations Research
A location-routing-loading problem for bill delivery services

Computers and Industrial Engineering - Supply chain management
Designing Distribution Networks: Formulations and Solution Heuristic

Transportation Science

A decision-support tool for a capacitated location-routing problem

Decision Support Systems
A metaheuristic for a two echelon location-routing problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.