A matheuristic for solving inventory sharing problems

[en] In this paper, we addressed a two-level supply chain in which a company manufactures products and sells them through its point of sale network. The problem of concern is a multi-product, multi-vehicle inventory sharing routing problem. We formulated it as a mixed-integer linear programming problem. We also designed a two-phase matheuristic that integrates mathematical modelling strengthened with relevant derived valid inequalities and hybridisation of sophisticated metaheuristics: Genetic Algorithm and Simulated Annealing. We tested 660 best known instances designed for the single and multi-vehicle inventory routing problem, and the results showed that the matheuristic outperformed the best known algorithms regarding computational times and enhanced 156 solutions for large instances. Extra experiments were conducted on a set of data specially designed for the multi-product multi-vehicle inventory sharing routing problem. Computational results highlighted the benefits of sharing inventory on the overall supply chain. Finally, a sensitivity analysis was conducted, which revealed the extent to which inventory sharing among different points of sale can be cost-effective by the savings it brings to reduce lost sales and inventory holding.

Disciplines :

Méthodes quantitatives en économie & gestion

Auteur, co-auteur :

Achamrah, Fatima Ezzahra

Riane, Fouad

Di Martinelly, Christine

Limbourg, Sabine ; Université de Liège - ULiège > HEC Liège : UER > UER Opérations : Logistique

Langue du document :

Anglais

Titre :

A matheuristic for solving inventory sharing problems

Date de publication/diffusion :

2022

Titre du périodique :

Computers and Operations Research

ISSN :

0305-0548

eISSN :

1873-765X

Maison d'édition :

Elsevier, Oxford, Royaume-Uni

Peer reviewed :

Peer reviewed vérifié par ORBi

Disponible sur ORBi :

depuis le 22 novembre 2021

Statistiques

Nombre de vues

92 (dont 14 ULiège)

Nombre de téléchargements

6 (dont 6 ULiège)

Voir plus de statistiques

citations Scopus^®

citations Scopus^®
sans auto-citations

OpenCitations

Bibliographie

Abouee-Mehrizi, H., Berman, O., Sharma, S., Optimal joint replenishment and transshipment policies in a multi-period inventory system with lost sales. Oper. Res. 63:2 (2015), 342–350.
Absi, N., Dauzère-Pérès, S., Kedad-Sidhoum, S., Penz, B., Rapine, C., Lot sizing with carbon emission constraints. European J. Oper. Res. 227:1 (2013), 55–61.
Adulyasak, Y., Cordeau, J.-F., Jans, R., Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J. Comput. 26:1 (2014), 103–120.
Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24:1 (2012), 101–116.
Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41:3 (2007), 382–391.
Archetti, C., Christiansen, M., Grazia Speranza, M., Inventory routing with pickups and deliveries. European J. Oper. Res. 268:1 (2018), 314–324.
Archetti, C., Speranza, M.G., Boccia, M., Sforza, A., Sterle, C., A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. European J. Oper. Res. 282:3 (2020), 886–895.
Avella, P., Boccia, M., Wolsey, L.A., Single-period cutting planes for inventory routing problems. Transp. Sci. 52:3 (2018), 497–508.
Axsäter, S., A new decision rule for lateral transshipments in inventory systems. Manage. Sci. 49:9 (2003), 1168–1179.
Azadeh, A., Elahi, S., Farahani, M.H., Nasirian, B., A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput. Ind. Eng. 104 (2017), 124–133.
Banerjee, A., Burton, J., Banerjee, S., A simulation study of lateral shipments in single supplier, multiple buyers supply chain networks. Int. J. Prod. Econ. 81 (2003), 103–114.
Battarra, M., Cordeau, J.-F., Iori, M., Chapter 6: pickup-and-delivery problems for goods transportation. Vehicle Routing: Problems, Methods, and Applications, second ed., 2014, SIAM, 161–191.
Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., Static pickup and delivery problems: A classification scheme and survey. TOP: Off. J. Span. Soc. Stat. Oper. Res. 15 (2007), 1–31.
Burton, J., Banerjee, A., Cost-parametric analysis of lateral transshipment policies in two-echelon supply chains. Int. J. Prod. Econ. 93 (2005), 169–178.
Campbell, A., Clarke, L., Kleywegt, A., Savelsbergh, M., The inventory routing problem. Crainic, T.G., Laporte, G., (eds.) Fleet Management and Logistics, 1998, Springer US, Boston, MA, 95–113.
Cavagnini, R., Bertazzi, L., Maggioni, F., A Two-Stage Stochastic Model for Distribution Logistics with Transshipment and Backordering: Stochastic Versus Deterministic Solutions: ODS, Taormina, Italy, September 10–13, 2018. 2018, 131–140.
Christiansen, M., Fagerholt, K., Chapter 13: Ship routing and scheduling in industrial and tramp shipping. Vehicle Routing, 2014, 381–408.
Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D., Ship routing and scheduling in the new millennium. European J. Oper. Res. 228:3 (2013), 467–483.
Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput. Oper. Res. 39:11 (2012), 2537–2548.
Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transp. Sci. 48:1 (2014), 1–19.
Coelho, L.C., Laporte, G., A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51:23–24 (2013), 7156–7169.
Coelho, L.C., Laporte, G., The exact solution of several classes of inventory-routing problems. Comput. Oper. Res. 40:2 (2013), 558–565.
Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155 (2014), 391–397.
Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155 (2014), 391–397 Celebrating a century of the economic order quantity model.
Dehghani, M., Abbasi, B., Oliveira, F., et al. Proactive transshipment in the blood supply chain. 2019, Elsevier BV.
Grahovac, J., Chakravarty, A., Sharing and lateral transshipment of inventory in a supply chain with expensive low-demand items. Manage. Sci. 47:4 (2001), 579–594.
Guimarães, T.A., Schenekemberg, C.M., Coelho, L.C., Scarpin, C.T., Pécora, J.E. Jr., Mechanisms for Feasibility and Improvement for Inventory-Routing Problems. 2020.
Gunawan, A., Vincent, F.Y., Widjaja, A.T., Vansteenwegen, P., Simulated annealing for the multi-vehicle cyclic inventory routing problem. 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE), 2019, IEEE, 691–696.
Herer, Y., Tzur, M., The dynamic transshipment problem. Nav. Res. Logist. 48 (2001), 386–408.
Iassinovskaia, G., Limbourg, S., Riane, F., The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. Int. J. Prod. Econ. 183 (2017), 570–582 Closed Loop Supply Chain (CLSC): Economics, Modelling, Management and Control.
Group IHL. Retail's $1.1 Trillion inventory distortion problem. 2015.
Karakostas, P., Sifaleras, A., Georgiadis, M., Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. Optim. Lett., 2020.
Kutanoglu, E., Mahajan, M., An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels. European J. Oper. Res. 194:3 (2009), 728–742.
Laporte, G., Fifty years of vehicle routing. Transp. Sci. 43:4 (2009), 408–416.
Lefever, W., Aghezzaf, E.-H., Hadj-Hamou, K., Penz, B., Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment. Comput. Oper. Res. 98 (2018), 137–148.
Li, Y., Guo, H., Wang, L., Fu, J., A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under E-supply chain environment. Sci. World J., 2013, 2013.
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., Stützle, T., The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3 (2016), 43–58.
Mangal, D., Chandna, P., Lateral transshipment–a technique for inventory control in multi retailer supply chain system. Int. J. Inf. Technol. Knowl. Manage. 2:2 (2010), 311–315.
Michel, S., Vanderbeck, F., A column-generation based tactical planning method for inventory routing. Oper. Res. 60:2 (2012), 382–397.
Mirzapour Al-e-hashem, S., Rekik, Y., Multi-product multi-period inventory routing problem with a transshipment option: A green approach. Int. J. Prod. Econ. 157 (2014), 80–88 The International Society for Inventory Research, 2012.
Nananukul, N., Clustering model and algorithm for production inventory and distribution problem. Appl. Math. Model. 37:24 (2013), 9846–9857.
Paterson, C., Kiesmüller, G., Teunter, R., Glazebrook, K., Inventory models with lateral transshipments: A review. European J. Oper. Res. 210:2 (2011), 125–136.
Peres, I.T., Repolho, H.M., Martinelli, R., Monteiro, N.J., Optimization in inventory-routing problem with planned transshipment: A case study in the retail industry. Int. J. Prod. Econ. 193 (2017), 748–756.
Qu, Y., Bard, J.F., A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39:10 (2012), 2439–2456.
Sabba, S., Chikhi, S., Integrating the best 2-opt method to enhance the genetic algorithm execution time in solving the traveler salesman problem. Adv. Intell. Soft Comput. 170 (2012), 195–208.
Shao, J., Krishnan, H., McCormick, S.T., Incentives for transshipment in a supply chain with decentralized retailers. Manuf. Serv. Oper. Manage. 13:3 (2011), 361–372.
Tagaras, G., Vlachos, D., Effectiveness of stock transshipment under various demand distributions and nonnegligible transshipment times. Prod. Oper. Manage. 11:2 (2002), 183–198.
Timajchi, A., Mirzapour Al-e-Hashem, S.M., Rekik, Y., Inventory routing problem for hazardous and deteriorating items in the presence of accident risk with transshipment option. Int. J. Prod. Econ. 209 (2019), 302–315 The Proceedings of the 19th International Symposium on Inventories.
Turan, B., Minner, S., Hartl, R.F., A VNS approach to multi-location inventory redistribution with vehicle routing. Comput. Oper. Res. 78 (2017), 526–536.
van Anholt, R.G., Coelho, L.C., Laporte, G., Vis, I.F.A., An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp. Sci. 50:3 (2016), 1077–1091.
Viu-Roig, M., Alvarez-Palau, E.J., The impact of E-commerce-related last-mile logistics on cities: A systematic literature review. Sustainability 12:16 (2020), 1–19.
Wassan, N., Wassan, N., Nagy, G., Salhi, S., The multiple trip vehicle routing problem with backhauls: Formulation and a two-level variable neighbourhood search. Comput. Oper. Res. 78 (2017), 454–467.
Wong, H., Cattrysse, D., Van Oudheusden, D., Stocking decisions for repairable spare parts pooling in a multi-hub system. Int. J. Prod. Econ. 93 (2005), 309–317.
Wu, W., Zhou, W., Lin, Y., Xie, Y., Jin, W., A hybrid metaheuristic algorithm for location inventory routing problem with time windows and fuel consumption. Expert Syst. Appl., 166, 2021, 114034.
Xu, D., Li, K., Zou, X., Liu, L., An unpaired pickup and delivery vehicle routing problem with multi-visit. Transp. Res. E 103 (2017), 218–247.
Zhang, D., Liu, Y., M'Hallah, R., Leung, S.C., A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. European J. Oper. Res. 203:3 (2010), 550–558.