Volume 3 Issue 1 pp. 43-52 January, 2013


Modeling a four-layer location-routing problem


Mohsen Hamidi, Kambiz Farahmand, and Seyed Reza Sajjadi


Distribution is an indispensable component of logistics and supply chain management. Location-Routing Problem (LRP) is an NP-hard problem that simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the decisions at multiple layers of a distribution network where multiple products are transported within and between layers of the network. This paper focuses on modeling a complicated four-layer and multi-product LRP which has not been tackled yet. The distribution network consists of plants, central depots, regional depots, and customers. In this study, the structure, assumptions, and limitations of the distribution network are defined and the mathematical optimization programming model that can be used to obtain the optimal solution is developed. Presented by a mixed-integer programming model, the LRP considers the location problem at two layers, the allocation problem at three layers, the vehicle routing problem at three layers, and a transshipment problem. The mathematical model locates central and regional depots, allocates customers to plants, central depots, and regional depots, constructs tours from each plant or open depot to customers, and constructs transshipment paths from plants to depots and from depots to other depots. Considering realistic assumptions and limitations such as producing multiple products, limited production capacity, limited depot and vehicle capacity, and limited traveling distances enables the user to capture the real world situations.


DOI: 10.5267/j.ijiec.2011.08.015

Keywords: Location-routing problem (LRP), Mixed-integer programming

References

Ambrosino, D., & Scutella, M. G. (2005). Distribution network design: New problems and related models. European Journal of Operational Research, 165(3), 610-624.

Balakrishnan, A., Ward, J. E., Wong, R. T. (1987). Integrated facility location and vehicle routing models: Recent work and future prospects. American Journal of Mathematical and Management Sciences, 7(1&2), 35–61.

Bookbinder, J. H., & Reece, K. E. (1988). Vehicle routing considerations in distribution system design. European Journal of Operational Research, 37, 204-213.

Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP×ELS approach for the capacitated location-routing problem. Computers & Operations Research,37(11), 1912-1923.

Hansen, P. H., Hegedahl, B., Hjortkjaer, S., & Obel, B. (1994). A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research, 76(1), 111-127.

Jacobsen, S. K., & Madsen, O. B. G. (1980). A Comparative Study of Heuristics for a Two-Level Routing-Location Problem. European Journal of Operational Research, 5(6), 378-387.

Laporte, G. (1988). Location-routing problems. In: Golden, B. L., & Assad, A. A. (Editors), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam. 163–198.

Lee, J., Moon, I., & Park, J. (2010). Multi-level supply chain network design with routing. International Journal of Production Research, 48(13), 3957-3976.

Lin, J., & Lei, H. (2009). Distribution systems design with two-level routing considerations. Annals of Operations Research, 172(1), 329-347.

Madsen, O. B. G. (1983). Methods for solving combined two level location routing problems of realistic dimensions. European Journal of Operational Research, 12, 295-301.

Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108(1), 1-15.

Nagy, G., & Salhi S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649-672.

Perl, J., & Daskin, M. S. (1985). A warehouse location-routing problem. Transportation Research B, 19B(5), 381-396.

Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Calvo, R. (2007). Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. Transportation Science, 41(4), 470-483.

The VRP Web. http://neo.lcc.uma.es/radi-aeb/WebVRP/index.html. Retrieved April 24, 2010.

Tuzun, D., & Burke, L. I. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116(1), 87-99.

Winston, W. L. (2003). Operations Research: Applications and Algorithms (4th edition). Duxbury Press.

Wu, T., Low, C., & Bai, J. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29(10), 1393–1415.

Yu, V. F., Lin, S., Lee, W., & Ting, C. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288-299.