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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albareda-Sambola, M., J.A. Díaz, and E. Fernández. (2002). “A Compact Model and Tight Bounds for a Combined Location-Routing Problem.” Technical Report 2002-14, Centre de Recherche sur les Transports, Université de Montréal.
Averbakh, A. and O. Berman. (1994). “Routing and Location-Routing p-Delivery Men Problems on a Path.” Transportation Science 28, 162–166.
Bruns, A. and A. Klose. (1995). “An Iterative Heuristic for Location-Routing Problems Based on Clustering.” In Proceedings of the Second International Workshop on Distribution Logistics.
Fischetti, M., J.J. Salazar, and P. Toth. (1995). “The Symmetric Generalized Travelling Salesman Polytope.” Networks 26(2), 113–123.
Ghiani, G. and G. Laporte. (2001). “Location-arc Routing Problems.” OPSEARCH 38, 151–159.
Glover, F. and M. Laguna. (1998). Tabu Search. Netherlands, Dordrecht: Kluwer Academic Publishers.
Hansen, P. and N. Mladenović. (1997). “Variable Neighborhood Search for the p-Median.” Location Science 5(4), 207–226.
Hansen, P. and N. Mladenović. (2001). “Variable Neighborhood Search: Principles and Applications.” European Journal of Operational Research 130, 449–467.
Hansen, P., N. Mladenović, and D. Perez-Brito. (2001). “Variable Neighborhood Decomposition Search.” Journal of Heuristics 7, 335–350.
Lapierre, S.L., A. Ruiz, and P. Soriano. (2004). “Designing Distribution Networks: Formulations and Solution Heuristic.” Transportation Science 38(2), 174–187.
Lin, C.K.Y., C.K. Chow, and A. Chen. (2002). “A Location-Routing-Loading Problem for Bill Delivery Services.” Computers and Industrial Engineering 43, 5–25.
Perl, J. and M. Daskin. (1985). “A Warehouse Location-Routing Problem.” Transportation Research Part B 19(5), 381–396.
Salhi, S. and G. Rand. (1989). “The Effect of Ignoring Routes When Locating Depots.” EJOR 39, 150–156.
Soriano, P. and M. Gendreau. (1993). “Diversification Strategies in Tabu Search Algorithms for the Maximum Clique Problem.” Technical Report 940, Centre de Recherche sur les Transports, Université de Montréal.
Stowers, C. and U. Palekar. (1993). “Location Models with Routing Consideration in a Physical Distribution Design.” Computers and Operations Research 6, 427–435.
Tuzun, D. and L.I. Burke. (1999). “A Two-Phase Tabu Search Approach to the Location Routing Problem.” EJOR 116(1), 87–99.
Wu, T.H., C. Low, and J.W. Bai. (2002). “Heuristic Solutions to Multi-Depot Location-Routing Problems.” Computers and Operations Research 29(10), 1393–1415.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Melechovský, J., Prins, C. & Calvo, R.W. A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs. J Heuristics 11, 375–391 (2005). https://doi.org/10.1007/s10732-005-3601-1
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-3601-1