KARŞILANAMAYAN TALEPLİ ÇOKLU ÜRÜN ENVANTER YERLEŞİM VE ROTALAMA PROBLEMİ

Year 2018, Volume: 23 Issue: 4, 177 - 192, 31.12.2018

Özge Şatır Akpunar Şener Akpınar

https://doi.org/10.17482/uumfd.455229

Abstract

Şirketler, değişen market koşullarına adapte
olmak ve rekabet içinde kalmak için lojistik faaliyetlerini de üretim
faaliyetleri gibi iyi bir şekilde yönetmelidir. Lojistik maliyetleri, şirket
maliyetlerinin büyük bir kısmını oluşturduğu için etkin bir şekilde
yönetilmelidir. Etkin bir lojistik ağı oluşturulurken üretim birimlerinin
yerleşimi ve bu birimlerden talep noktalarına giden araç rotalarına karar
verilmesi karşılaşılan ve çözülmesi gereken optimizasyon problemleridir. Bu
çalışma kapsamında envanter, yerleşim ve rotalama ile ilgili kararlar göz önüne
alınarak bir yerleşim-envanter-rotalama probleminin çözülmesi amaçlanmıştır.
Yerleşim-rotalama problemi ile karşılanamayan talepli ekonomik üretim miktarı
modeli entegre edilerek problemin formülasyonu oluşturulmuştur. Problemin
çözümü için bir büyük komşuluk arama algoritması geliştirilmiştir. Algoritmanın
değerlendirilmesi, literatürden alınan yerleşim-rotalama problem veri setleri
ile yapılan karşılaştırmalı sonuçlar aracılığıyla gerçekleştirilmiştir. Literatürde
her iki problem veri seti için de bilinen en iyi sonuçlar bulunmuş veya en iyi
sonuçlara yaklaşılmıştır.

Keywords

Büyük komşuluk arama algoritması, Envanter yerleşim ve rotalama problemi, Hatalı ürünler, Karşılanamayan Talep

Multi-Product Inventory Location-Routing Problem with Shortages

Abstract

The companies, who wants to adapt to the changed
market conditions and remain competitive, have to manage their storage and
distribution processes in a cost effective manner as well as their production
processes. The logistic costs consume a significant part of the budget of the
companies and therefore these processes must be managed as efficiently as
possible. The design of such an effective logistic network contains two hard
combinatorial optimization problems, to locate facilities, and to determine
vehicle routes supplying demand points from these locations. Within the context
of this study, we deal with the Location Inventory Routing Problem (LIRP),
which is an enriched Location Routing Problem (LRP) with the inventory related
issues and determines inventory, location and transportation related decisions
at the strategic, tactical and operational levels. A mathematical model, a
combination of a location-routing problem and a joint replenishment economic
order quantity (EOQ) model with backorders, is developed to formally describe
the problem. Large neighborhood search algorithm is developed to solve the
problem. Comparative results with the location-routing problem data sets from the
literature is used in order to evaluate solution method. The best known results
in the literature have been found or the best results have been approached for
both problem dataset.

Keywords

Large neighborhood search algorithm, Location inventory and routing problem, Defective items, Shortages

References

• Ambrosino, D. and Scutellà, M. G. (2005) Distribution network design: new problems and related models, European Journal of Operational Research, 165, 610-624. doi: 10.1016/j.ejor.2003.04.009
• Barreto, S. S. (2004), Análise e Modelização de Problemas de localizaçãodistribuição [Analysis and modelling of location-routing problems], Ph.D.Thesis, University of Aveiro, Aveiro, Portugal.
• Daskin, M.S., Coullard, C.R. and Shen, Z.J.M. (2002) An inventory location model: formulation, solution algorithm and computational results, Annals of Operations Research, 110, 83-106. doi: 10.1023/A:1020763400324
• Diabat, A., Richard, J. P. and Codrington, C. W. (2013) A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design, Annals of Operations Research, 203, 55-80. doi: 10.1007/s10479-011-0915-2
• Duhamel, C., Lacomme, P., Prins, C. and Prodhon, C. (2008) A memetic approach for the capacitated location routing problem, In Proceedings of the EU/meeting 2008 Workshop on Metaheuristics for Logistics and Vehicle Routing, University of Technology of Troyes, France.
• Farahani, R. Z., Rashidi Bajgan, H., Fahimnia, B. and Kaviani, M. (2015) Location-inventory problem in supply chains: a modelling review, International Journal of Production Research, 53, 3769-3788. doi: 10.1080/00207543.2014.988889
• Gebennini, E., Gamberini, R. and Manzini, R. (2009) An integrated production–distribution model for the dynamic location and allocation problem with safety stock optimization, International Journal of Production Economics, 122, 286-304. doi: 10.1016/j.ijpe.2009.06.027
• Gholamian, M.R. and Heydari, M. (2017) An inventory model with METRIC approach in location-routing-inventory problem, Advances in Production Engineering and Management, 12(2), 115-126. doi: 10.14743/apem2017.2.244
• Guerrero, W. J., Prodhon, C., Velasco, N. and Amaya, C. A. (2015) A relax and price heuristic for the inventory location routing problem, International Transactions in Operational Research, 22, 129-148. doi: 10.1111/itor.12091
• Hsu, L. F. and Hsu, J. T. (2016) Economic production quantity (EPQ) models under an imperfect production process with shortages backordered, International Journal of Systems Science, 47, 852-867. doi: 10.1080/00207721.2014.906768
• Huang, S. H. and Lin, P. C. (2010) A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty, Transportation Research Part E: Logistics and Transportation Review, 46, 598-611. doi: 10.1016/j.tre.2010.01.006
• Javid, A. A. and Azad, N. (2010) Incorporating location, routing and inventory decisions in supply chain network design, Transportation Research Part E: Logistics and Transportation Review, 46, 582-597. doi: 10.1016/j.tre.2009.06.005
• Jha, A., Somani, K., Tiwari, M. K., Chan, F. T. and Fernandes, K. J. (2012) Minimizing transportation cost of a joint inventory location model using modified adaptive differential evolution algorithm, The International Journal of Advanced Manufacturing Technology, 60, 329-341. doi: 10.1007/s00170-011-3595-9
• Laporte, G., Nobert, Y. and Taillefer, S. (1988) Solving a family of multi-depot vehicle routing and location routing problems, Transportation Science, 22, 161-172. doi: 10.1287/trsc.22.3.161
• Liu, S. C. and Lee, S. B. (2003) A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration, The International Journal of Advanced Manufacturing Technology, 22, 941-950. doi: 10.1007/s00170-003-1639-5
• Lopes, R. B., Ferreira, C., Santos, B. S. and Barreto, S. (2013) A taxonomical analysis, current methods and objectives on location routing problems, International Transactions in Operational Research, 20, 795-822. doi: 10.1111/itor.12032
• Mak, H. Y. and Shen, Z. J. M. (2009) A two-echelon inventory location problem with service considerations, Naval Research Logistics, 56, 730-744. doi: 10.1002/nav.20376
• Miranda, P. A. and Garrido, R. A. (2008) Valid inequalities for Lagrangian relaxation in an inventory location problem with stochastic capacity, Transportation Research Part E: Logistics and Transportation Review, 44, 47-65. doi: 10.1016/j.tre.2006.04.002
• Miranda, P. A. and Garrido, R. A. (2009) Inventory service-level optimization within distribution network design problem, International Journal of Production Economics, 122, 276-285. doi: 10.1016/j.ijpe.2009.06.010
• Moin, N.H. and Salhi, S. (2007) Inventory routing problems: a logistical overwiew, Journal of the Operational Research Society, 58, 1185-1194. doi: 10.1057/palgrave.jors.2602264
• Nagy, G. and Salhi, S. (2007) Location-routing: issues, models and methods, European Journal of Operational Research, 177(2), 649-672. doi: 10.1016/j.ejor.2006.04.004
• Naseraldin, H. and Herer, Y. T. (2011) A location inventory model with lateral transshipments, Naval Research Logistics (NRL), 58, 437-456. doi: 10.1016/j.ejor.2006.04.004
• Prins, C., Prodhon, C. and Wolfler Calvo, R. (2004) Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité, In Proceedings of the MOSIM’ 04 , 1115–1122.
• Prins, C., Prodhon, C. and Wolfler Calvo, R. (2006a) A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem, Lecture Notes in Computer Science, 3906, 183–194. doi: 10.1007/11730095_16
• Prins, C., Prodhon, C. and Wolfler Calvo, R. (2006b) Solving the capacitated location routing problem by a GRASP complemented by a learning process and a path relinking, 4OR, 4(3), 221–238. doi: 10.1007/s10288-006-0001-9
• Prins, C., Prodhon, C., Ruiz, A., Soriano, P. and Wolfler Calvo, R. (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean Relaxation-Granular tabu search heuristic, Transportation Science, 41(4), 470–483. doi: 10.1287/trsc.1060.0187
• Prodhon, C. and Prins, C. (2014) A survey of recent research on location-routing problems, European Journal of Operational Research, 238, 1-17. doi: 10.1016/j.ejor.2014.01.005
• Rayat, F., Musavi, M. and Bozorgi-Amiri, A. (2017) Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: a modified AMOSA approach, Applied Soft Computing, 59, 622-643. doi: 10.1016/j.asoc.2017.06.036
• Sajjadi, S. R. and Cheraghi, S. H. (2011) Multi-products location–routing problem integrated with inventory under stochastic demand, International Journal of Industrial and Systems Engineering, 7, 454-476. doi: 10.1504/IJISE.2011.039670
• Salhi, S. and Rand, G. K. (1989) The effect of ignoring routes when locating depots, European Journal of Operational Research, 39, 150-156. doi: 10.1016/0377-2217(89)90188-4
• Shaw, P., (1997) A new local search algorithm providing high quality solutions to vehicle routing problems, Technical Report, University of Strathclyde, Glasgow.
• Shaw, P., (1998) Using constraint programming and local search methods to solve vehicle routing problems, Fourth International Conference on Principles and Practice of Constraint Programming, 98, 417–431. doi: 10.1007/3-540-49481-2_30
• Yerleşim Rotalama Problemleri için Klasik Örnekler. Erişim Adresi: http://prodhonc.free.fr/Instances/instances_us.htm (Erişim Tarihi: 10.04.2017)