2026-09-20T16:02:38Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1536692024-03-14T03:10:33Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Jacquillat, Alexandre Robin, Arnaud Massachusetts Institute of Technology. Operations Research Center 2024-03-13T13:25:18Z 2024-03-13T13:25:18Z 2024-02 2024-02-12T01:41:08.859Z https://hdl.handle.net/1721.1/153669 E-commerce retailers need to meet growing demand and rising customer expectations while efficiently managing operating costs across global supply chains. This thesis addresses the tactical problem of inventory induction under demand uncertainty, which involves determining where the position incoming inventory to serve future customer demand. We formulate the problem via two-stage adaptive robust optimization with right-hand side uncertainty. First-stage variables characterize initial induction and positioning and second-stage variables capture subsequent rebalancing and order fulfillment. Demand is modeled via an uncertainty set based on an aggregate forecast---at the nation-wide and monthly level---to protect against spatiotemporal deviations---at the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding strategies---including a novel simplicial relaxation. We also propose a cut-learning strategy from offline instances to warm-start the Benders decomposition scheme. We conduct extensive computational experiments, leveraging an experimental setup build on real-world data and developed in collaboration with a major e-commerce provider. From a computational standpoint, results show the benefits of the acceleration strategies for the subproblem and the master problem which, together, outperform state-of-the-art benchmarks in terms of optimality gaps, solution quality, and computational times. From a practical standpoint, results suggest that the adaptive robust solution can provide significant benefits on average against the deterministic benchmark, by mitigating operating costs by up to 5-10% and improving delivery speeds by up to 1%. S.M. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ Robust Inventory Induction under Demand Uncertainty Thesis application/pdf Master Master of Science in Operations Research Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="d0b3677b-fded-4bde-83a4-9c0706bda66b"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>Robust Inventory Induction under Demand Uncertainty</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2024-02</PublicationDate> <Authors> <Author> <DisplayName>Robin, Arnaud</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>https://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>E-commerce retailers need to meet growing demand and rising customer expectations while efficiently managing operating costs across global supply chains. This thesis addresses the tactical problem of inventory induction under demand uncertainty, which involves determining where the position incoming inventory to serve future customer demand. We formulate the problem via two-stage adaptive robust optimization with right-hand side uncertainty. First-stage variables characterize initial induction and positioning and second-stage variables capture subsequent rebalancing and order fulfillment. Demand is modeled via an uncertainty set based on an aggregate forecast---at the nation-wide and monthly level---to protect against spatiotemporal deviations---at the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding strategies---including a novel simplicial relaxation. We also propose a cut-learning strategy from offline instances to warm-start the Benders decomposition scheme. We conduct extensive computational experiments, leveraging an experimental setup build on real-world data and developed in collaboration with a major e-commerce provider. From a computational standpoint, results show the benefits of the acceleration strategies for the subproblem and the master problem which, together, outperform state-of-the-art benchmarks in terms of optimality gaps, solution quality, and computational times. From a practical standpoint, results suggest that the adaptive robust solution can provide significant benefits on average against the deterministic benchmark, by mitigating operating costs by up to 5-10% and improving delivery speeds by up to 1%.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>