In this work, we study an integrated inventory-transportation problem in a supply chain consisting of region-bound warehouses located in different regions. The supply chain deals with multiple items that compete for storage space and transportation capacity with multi-modal transportation considering regional capacity constraint for each mode of transportation. The objective is to determine an optimal storage and transportation plan to satisfy the demand of all regions without shortages for known procurement plan for all items. The problem is formulated as a mixed integer programming (MIP) model for minimizing the total costs over a finite planning horizon. An MIP-based fix-and-optimize (F&O) heuristic with several decomposition schemes is proposed to solve the problem efficiently. The performance of the decomposition schemes is investigated against the structure of the sub-problems obtained. To enhance the performance, F&O is crossbred with two metaheuristics – genetic algorithm (GA) and iterated local search (ILS) separately, which lead to hybrid heuristic approach. Extensive numerical experiments are carried out to analyze the performance of the proposed solution methodology by randomly generating several problem instances built using data collected from the Indian Public Distribution System. The proposed solution approach is found to be computationally efficient and effective, and outperforming state of the art MIP solver Cplex for practical size problem instances. Also, the hybridization of F&O heuristic with GA and ILS boosts its performance although with a justified increase in the computational time.
Mots-clés : inventory-transportation problem, fix-and-optimize, genetic algorithm, iterated local search, public distribution system
@article{RO_2020__54_3_749_0,
author = {Tanksale, Ajinkya and Jha, J.K.},
title = {A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {749--782},
publisher = {EDP-Sciences},
volume = {54},
number = {3},
year = {2020},
doi = {10.1051/ro/2019025},
mrnumber = {4075323},
zbl = {1437.90022},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ro/2019025/}
}
TY - JOUR AU - Tanksale, Ajinkya AU - Jha, J.K. TI - A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2020 SP - 749 EP - 782 VL - 54 IS - 3 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2019025/ DO - 10.1051/ro/2019025 LA - en ID - RO_2020__54_3_749_0 ER -
%0 Journal Article %A Tanksale, Ajinkya %A Jha, J.K. %T A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain %J RAIRO - Operations Research - Recherche Opérationnelle %D 2020 %P 749-782 %V 54 %N 3 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2019025/ %R 10.1051/ro/2019025 %G en %F RO_2020__54_3_749_0
Tanksale, Ajinkya; Jha, J.K. A hybrid fix-and-optimize heuristic for integrated inventory-transportation problem in a multi-region multi-facility supply chain. RAIRO - Operations Research - Recherche Opérationnelle, Tome 54 (2020) no. 3, pp. 749-782. doi : 10.1051/ro/2019025. http://archive.numdam.org/articles/10.1051/ro/2019025/
[1] and , Using truck-inventory-cost to obtain solutions to multi-period logistics models. Int. J. Prod. Econ. 143 (2013) 144–150. | DOI
[2] and , Shipping multiple items by capacitated vehicles: an optimal dynamic programming approach. Trans. Sci. 39 (2005) 233–248. | DOI
[3] and , Algorithms for the multi-item multi-vehicles dynamic lot sizing problem. Nav. Res. Logist. 53 (2006) 157–169. | DOI | MR | Zbl
[4] , , and , Developing model-based software to optimise wheat storage and transportation: a real-world application. Appl. Soft Comput. 13 (2013) 1074–1084. | DOI
[5] , , and , An optimization approach for the lot sizing and scheduling problem in the brewery industry. Comput. Ind. Eng. 72 (2014) 58–71. | DOI
[6] and , An inventory theoretic model of freight transport demand. Manag. Sci. 16 (1970) 413–421. | DOI
[7] and , Freight transportation function in supply chain optimization models: a critical review of recent trends. Expert Syst. App. 40 (2013) 6742–6757. | DOI
[8] , and , Using robust optimization for distribution and inventory planning for a large pulp producer. Comput. Oper. Res. 44 (2014) 214–225. | DOI | Zbl
[9] , Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems. Omega 56 (2015) 25–36. | DOI
[10] . An introduction to genetic algorithms, Sadhana 24 (1999) 293–315. | DOI | MR | Zbl
[11] Department of Food and Public Distribution, Ministry of Consumer Affairs, Food and Public Distribution, G. of I, e-PDS portal of India. Available from http://pdsportal.nic.in/main.aspx (2015)
[12] Department of Food and Public Distribution, Ministry of Consumer Affairs, Food and Public Distribution, G. of I, Foodgrain bulletin. Available from http://dfpd.nic.in/ (2015).
[13] , and , A fix-and-optimize heuristic for the high school timetabling problem. Comput. Oper. Res. 52 (2014) 29–38. | DOI | MR
[14] and , Cooperative lot sizing with transshipments and scarce capacities: solutions and fair cost allocations. Int. J. Prod. Res. 49 (2011) 2643–2668. | DOI
[15] , and , Production and shipment lot sizing in a vendor–buyer supply chain with transportation cost. Eur. J. Oper. Res. 176 (2007) 1592–1606. | DOI | Zbl
[16] , and , Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages. Ann. Oper. Res. 274 (2019) 241–265. | DOI | MR | Zbl
[17] and , BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem. J. Intell. Manuf. 28 (2017) 929–944. | DOI
[18] and , Modeling the budget-constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: a case study of health care. Math. Comput. Model. 57 (2013) 382–400. | DOI | Zbl
[19] and , Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl. Intell. 42 (2015) 805–816. | DOI
[20] , and , A hybrid approach for the capacitated lot sizing problem with setup carryover. Int. J. Prod. Res. 50 (2012) 1582–1597. | DOI
[21] , and , Pricing, relaxing and fixing under lot sizing and scheduling. Eur. J. Oper. Res. 230 (2013) 399–411. | DOI | MR
[22] , , , and , Annual distribution budget in the beverage industry: a case study. Interfaces 44 (2014) 605–626. | DOI
[23] , , and , Gantry crane scheduling in intermodal rail-road container terminals. Int. J. Prod. Res. 56 (2018) 5419–5436. | DOI
[24] and , A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int. J. Prod. Econ. 123 (2010) 247–256. | DOI
[25] , and , Dynamic capacitated lot sizing with random demand and dynamic safety stocks. OR Spect. 35 (2013) 75–105. | DOI | MR | Zbl
[26] , , , and , A hierarchical facility layout planning approach for large and complex hospitals. Flexible Serv. Manuf. J. 28 (2016) 5–29. | DOI
[27] and , An optimal policy for the dynamic transportation-inventory model with deteriorating items. IIE Trans. 17 (1985) 233–241. | DOI
[28] Indian Railways, Freight Operations Information System. Available from https://www.fois.indianrail.gov.in/FoisWebsite/html/Freight_Rates.htm (2015).
[29] and , Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics. Comput. Oper. Res. 38 (2011) 1816–1825. | DOI | Zbl
[30] , and , A dynamic lot-sizing model with multi-mode replenishments: polynomial algorithms for special cases with dual and multiple modes. IIE Trans. 37 (2005) 453–467. | DOI
[31] , and , Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions. Oper. Res. Lett. 35 (2007) 813–822. | DOI | MR | Zbl
[32] and , A genetic algorithm based heuristic to the multi-period fixed charge distribution problem. Appl. Soft Comput. 12 (2012) 682–699. | DOI
[33] and , Single-warehouse multi-retailer inventory systems with full truckload shipments. Nav. Res. Logist. (NRL) 56 (2009) 450–464. | DOI | MR | Zbl
[34] and , Coordination of inventory and transportation managements in a two-level supply chain. Int. J. Prod. Econ. 123 (2010) 137–145. | DOI
[35] and , A Lagrangian relaxation approach to multi-period inventory/distribution planning. J. Oper. Res. Soc. 51 (2000) 364–370. | DOI | Zbl
[36] and , Meta-heuristic algorithms for a multi-product dynamic lot-sizing problem with a freight container cost. Ind. Eng. Manag. Syst. 11 (2012) 288–298.
[37] and , Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. Eur. J. Oper. Res. 214 (2011) 595–605. | DOI | Zbl
[38] , and , A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51 (2003) 735–747. | DOI | MR | Zbl
[39] , and , A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem. Int. J. Prod. Econ. 98 (2005) 204–214. | DOI
[40] , and , Decomposition heuristic to minimize total cost in a multi-level supply chain network. Comput. Ind. Eng. 54 (2008) 945–959. | DOI
[41] and , An optimal model of dynamic lot-sizing with transportation decision and an improved ACO algorithm. Int. J. Ind. Syst. Eng. 22 (2016) 121–144.
[42] , and , Dynamic lot sizing with batch ordering and truckload discounts. Oper. Res. 52 (2004) 639–654. | DOI | MR | Zbl
[43] , Optimal inventory policy with multiple set-up costs. Manag. Sci. 16 (1969) 118–138. | DOI | MR | Zbl
[44] , and , Iterated local search. In: Handbook of Metaheuristics. Springer, Boston, MA (2003) 320–353. | DOI | MR | Zbl
[45] , , and , A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining. Comput. Commun. 102 (2017) 67–77. | DOI
[46] , and , Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics. Comput. Oper. Res. 69 (2016) 79–96. | DOI | MR
[47] and , Production Planning by Mixed Integer Programming. Springer Science and Business Media, Berlin, 2006. | MR | Zbl
[48] , , , and , Developing a new model for dynamic Vendor Managed Inventory with considering time value of money. Int. J. Logist. Syst. Manag. 20 (2015) 411–427.
[49] , and , A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs. Int. J. Prod. Econ. 102 (2006) 344–357. | DOI
[50] , Integration of vendor selection into production and remanufacturing planning subject to emission constraints. Int. J. Prod. Res. 54 (2016) 3822–3836. | DOI
[51] , , and , Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Comput. Oper. Res. 36 (2009) 2546–2553. | DOI | Zbl
[52] and , Multi-item dynamic lot-sizing with delayed transportation policy. Int. J. Prod. Econ. 131 (2011) 595–603. | DOI
[53] , and , Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems. Comput. Oper. Res. 40 (2013) 303–317. | DOI | MR
[54] and , Hybrid simulation and MIP based heuristic algorithm for the production and distribution planning in the soft drink industry. J. Manuf. Syst. 33 (2014) 385–399. | DOI
[55] and , A lot-sizing and scheduling model for multi-stage flow lines with zero lead times. Eur. J. Oper. Res. 225 (2013) 404–419. | DOI | MR | Zbl
[56] and , An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India. INFOR: Info. Syst. Oper. Res. 54 (2016) 355–379. | MR | Zbl
[57] and , Solving multi-region multi-facility inventory allocation and transportation problem: a case of Indian public distribution system. Comput. Ind. Eng. 110 (2017) 175–190. | DOI
[58] and , Capacitated lot sizing with parallel machines, sequence-dependent setups and a common setup operator. OR Spect. 38 (2016) 819–847. | DOI | MR | Zbl
[59] , and , A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Comput. Oper. Res. 40 (2013) 910–919. | DOI | MR
[60] , , , and , A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21 (2015) 687–717. | DOI | Zbl
[61] and , Mixed integer programming based heuristics for the Patient Admission Scheduling problem. Comput. Oper. Res. 80 (2017) 38–49. | DOI | MR
[62] and , Multi-product lot-sizing with a transportation capacity reservation contract. Eur. J. Oper. Res. 165 (2005) 127–138. | DOI | MR | Zbl
[63] and , Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost. Int. J. Prod. Res. 54 (2016) 4087–4103. | DOI
[64] and , Dynamic version of the economic lot size model. Manag. Sci. 5 (1958) 89–96. | DOI | MR | Zbl
[65] , , and , Tactical production and distribution planning with dependency issues on the production process. Omega 67 (2017) 99–114. | DOI
[66] and , Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear. Cent. Eur. J. Oper. Res. 24 (2016) 489–513. | DOI | MR
[67] , , and , MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem. Int. J. Prod. Res. 51 (2013) 5011–5028. | DOI
[68] , , and , Integration of inventory and transportation decisions in a logistics system. Trans. Res. Part E: Logist. Transp. Rev. 46 (2010) 913–925. | DOI
Cité par Sources :
