Smart Parcel Consolidation at Cainiao
Published Online:8 Oct 2024https://doi.org/10.1287/inte.2024.0124
References
- (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
- (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
- (2020) Online resource allocation with limited flexibility. Management Sci. 66(2):642–666.Link, Google Scholar
- (2020) Dual mirror descent for online allocation problems. Daumé H, Singh A, eds. Proc. 37th Internat. Conf. Machine Learning (JMLR.org), 613–628.Google Scholar
- Cassandras CG, Lafortune S, eds. (2007) Introduction to Discrete-Event Simulation (Springer, Boston), 557–615.Google Scholar
- (2005) Coordination of Inventory and Shipment Consolidation Decisions: A Review of Premises, Models, and Justification (Springer, Boston).Google Scholar
- (2002a) On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures. Oper. Res. 50(6):1058–1067.Link, Google Scholar
- (2002b) Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. 48(11):1446–1460.Link, Google Scholar
- (2023) A branch-and-repair method for three-dimensional bin selection and packing in e-commerce. Oper. Res. 71(1):273–288.Link, Google Scholar
- (2023) Exploring the right logistics strategy for China-U.S. B2C cross-border e-commerce. Technical report, Stanford Graduate School of Business, Stanford, CA.Google Scholar
- (1995) Markovian decision processes in shipment consolidation. Transportation Sci. 29(3):242–255.Link, Google Scholar
- (2015) Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63(4):909–915.Link, Google Scholar
- (2014) Primal beats dual on online packing LPs in the random-order model. Proc. 46th Ann. ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 303–312.Google Scholar
- (2003) A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Oper. Res. 51(5):735–747.Link, Google Scholar
- (2021) Online linear programming: Dual convergence, new algorithms, and regret bounds. Oper. Res. 70(5):2948–2966.Link, Google Scholar
- (2023) Simple and fast algorithm for binary integer and online linear programming. Math. Programming 200(2):831–875.Google Scholar
- (2020) Production and transportation integration for commit-to-delivery mode with general shipping costs. INFORMS J. Comput. 32(4):1012–1029.Abstract, Google Scholar
- (2022) Real-time delivery time forecasting and promising in online retailing: When will your package arrive? Manufacturing Service Oper. Management 24(3):1421–1436.Link, Google Scholar
- (2012) Dare to care: Shipment consolidation reduces not only costs, but also environmental damage. Internat. J. Production Econom. 139(2):438–446.Google Scholar
- (2023) Non-stationary online convex optimization with arbitrary delays. Accessed January 29, 2024, https://arxiv.org/pdf/2305.12131v1.pdf.Google Scholar
- (2021) Shipping consolidation across two warehouses with delivery deadline and expedited options for e-commerce and omni-channel retailers. Manufacturing Service Oper. Management 23(6):1634–1650.Link, Google Scholar
- (2023) Shipment consolidation with multiple shipping methods under nonlinear cost structures. Management Sci., ePub ahead of print June 12, https://doi.org/10.1287/mnsc.2023.4835.Google Scholar
- (2019) Order consolidation for the last-mile split delivery in online retailing. Transportation Res. Part E Logist. Transportation Rev. 122(February):309–327.Google Scholar

