Abstract
The split-order fulfillment problem has been a new key issue for online supermarkets. Multi-item orders to be fulfilled by multiple warehouses are split into several suborders and delivered with multiple shipments, increasing transportation cost. This paper presents a powerful order fulfillment method—package consolidation—in which two or more stock-keeping units (SKUs) in the suborders of one order will be packed into fewer packages through lateral transshipment. We propose a consolidation model and a packing model to determine which SKUs in suborders should be transshipped for package consolidation. In addition, we develop a modified first fit decreasing (FFD) algorithm to solve the packing model and a heuristic algorithm based on the breadth-first search strategy with cutting, long-sight and suborder rules to generate near optimal order fulfillment schemes in a reasonable time. The computation results verify the superiority of the package consolidation approach in solving split-order fulfillment problem. Moreover, our sensitivity analyses provide managerial insights for online supermarkets.
Similar content being viewed by others
References
Acimovic J and Graves SC (2015). Making better fulfillment decisions on the fly in an online retail environment. Manufacturing and Service Operations Management 17(1):34–51.
Ahmadi G, Torabi SA and Tavakkoli-Moghaddam R (2016). A bi-objective location-inventory model with capacitated transportation and lateral transshipments. International Journal of Production Research 54(7):2035–2056.
Archibald TW (2007). Modelling replenishment and transshipment decisions in periodic review multilocation inventory systems. Journal of the Operational Research Society 58(7):948–956.
Axsäter S (1990). Modelling emergency lateral transshipments in inventory systems. Management Science 36(11):1329–1338.
Catalán A and Fisher M (2012). Assortment allocation to distribution centers to minimize split customer orders. SSRN Electronic Journal. doi:10.2139/ssrn.2166687.
Chakravarty AK, Orlin JB and Rothblum UG (1982). Technical note—a partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. Operations Research 30(5):1018–1022.
Co HC, Miller RH and Xu X (2007). Clustering of skus to reduce split delivery cost and improve on-time delivery in online merchandising. California Journal of Operations Management 6(1):45–51.
De Carvalho MAM and Soma NY (2014). A breadth-first search applied to the minimization of the open stacks. Journal of the Operational Research Society 66(6):936–946.
Gallien J and Weber T (2010). To wave or not to wave? Order release policies for warehouses with an automated sorter. Manufacturing and Service Operations Management 12(4):642–662.
Garey MR and Johnson DS (1979). Computers and intractability: A guide to the theory of NP-Completeness. Bedford, W. H. Freeman.
Gendreau M, Laporte G and Semet F (2004). Heuristics and lower bounds for the bin packing problem with conflicts. Computers and Operations Research 31(3):347–358.
Glazebrook K, Paterson C, Rauscher S and Archibald T (2015). Benefits of hybrid lateral transshipments in multi-item inventory systems under periodic replenishment. Production and Operations Management 24(2):311–324.
Gurevsky E, Hazır Ö, Battaïa O and Dolgui A (2012). Robust balancing of straight assembly lines with interval task times. Journal of the Operational Research Society 64(11):1607–1613.
Howard C, Marklund J, Tan T and Reijnen I (2015). Inventory control in a spare parts distribution system with emergency stocks and pipeline information. Manufacturing and Service Operations Management 17(2):142–156.
Jasin S and Sinha A (2015). An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. Operations Research 63(6):1336–1351.
Keha AB, de Farias IR Jr and Nemhauser GL (2006). A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Operations Research 54(5):847–858.
Kranenburg AA and Van Houtum GJ (2009). A new partial pooling structure for spare parts networks. European Journal of Operational Research 199(3):908–921.
Lee HL (1987). A multi-echelon inventory model for repairable items with emergency lateral transshipments. Management Science 33(10):1302–1316.
Letchford AN, Lysgaard J and Eglese RW (2007). A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society 58(12):1642–1651.
Mitchell JE (2002). Branch-and-cut algorithms for combinatorial optimization problems. Handbook of applied optimization. London, Oxford University Press.
Olsson F (2010). An inventory model with unidirectional lateral transshipments. European Journal of Operational Research 200(3):725–732.
Parikh PJ and Meller RD (2008). Selecting between batch and zone order picking strategies in a distribution center. Transportation Research Part E: Logistics and Transportation Review 44(5):696–719.
Paterson C, Kiesmüller G, Teunter R and Glazebrook K (2011). Inventory models with lateral transshipments: A review. European Journal of Operational Research 210(2):125–136.
Paterson C, Teunter R and Glazebrook K (2012). Enhanced lateral transshipments in a multi-location inventory system. European Journal of Operational Research 221(2):317–327.
Ramakrishna KS, Sharafali M and Lim YF (2015). A two-item two-warehouse periodic review inventory model with transshipment. Annals of Operations Research 233(1):365–381.
Sadykov R and Vanderbeck F (2013). Bin packing with conflicts: A generic branch-and-price algorithm. INFORMS Journal on Computing 25(2):244–255.
Sinha A and Weitzel P (2015). ECommerce supply chain insights in groceries and consumer packaged goods in the united states. http://www.tauber.umich.edu/file/933/download?token=t9Zrq2i9. Accessed 8 August 2016.
Torabi SA and Moghaddam M (2012). Multi-site integrated production-distribution planning with trans-shipment: A fuzzy goal programming approach. International Journal of Production Research 50(6):1726–1748.
Torabi SA, Hassini E and Jeihoonian M (2015). Fulfillment source allocation, inventory transshipment, and customer order transfer in e-tailing. Transportation Research Part E: Logistics and Transportation Review 79:128–144.
Van Utterbeeck F, Wong H, Van Oudheusden D and Cattrysse D (2009). The effects of resupply flexibility on the design of service parts supply systems. Transportation Research Part E: Logistics and Transportation Review 45(1):72–85.
Wong H, van Houtum G, Cattrysse D and Van Oudheusden D (2005). Simple, efficient heuristics for multi-item multi-location spare parts systems with lateral transshipments and waiting time constraints. Journal of the Operational Research Society 56(12):1419–1430.
Xinhua (2015). China Focus: China e-commerce targeting rural, foreign markets. http://news.xinhuanet.com/english/indepth/2015-01/31/c_133960884.htm. Accessed 7 Aug 2015.
Xu P J, Allgor R and Graves S C (2009). Benefits of reevaluating real-time order fulfillment decisions. Manufacturing and Service Operations Management 11(2):340–355.
Zhou R and Hansen E A (2006). Breadth-first heuristic search. Artificial Intelligence 170(4):385–408.
Zhu W, Zhang Z, Oon W and Lim A (2012). Space defragmentation for packing problems. European Journal of Operational Research 222(3):452–463.
Acknowledgements
We sincerely thank the editor and the referees for their constructive comments. This research was supported by program of the National Natural Science Foundation of China (71571067; 71201014; 71201055), the innovative research group program of the National Natural Science Foundation of China (71421001).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Y., Huang, M., Hu, X. et al. Package consolidation approach to the split-order fulfillment problem of online supermarkets. J Oper Res Soc (2017). https://doi.org/10.1057/s41274-017-0230-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1057/s41274-017-0230-7