2026-09-19T02:05:24Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1179782022-01-28T17:17:59Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Patrick Jaillet and Georgia Perakis. Foster, Scott Douglas, M.B.A. Sloan School of Management Leaders for Global Operations Program. Leaders for Global Operations Program at MIT Massachusetts Institute of Technology. Department of Civil and Environmental Engineering Sloan School of Management 2018-09-17T15:52:22Z 2018-09-17T15:52:22Z 2018 2018 http://hdl.handle.net/1721.1/117978 1051238287 Thesis: M.B.A., Massachusetts Institute of Technology, Sloan School of Management, in conjunction with the Leaders for Global Operations Program at MIT, 2018. Thesis: S.M., Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, in conjunction with the Leaders for Global Operations Program at MIT, 2018. Cataloged from PDF version of thesis. Includes bibliographical references (pages 46-47). This thesis proposes a novel fulfillment algorithm which maximizes profits and customer experience through optimal distribution in a multi-period setting for a set of shipping locations that includes both stores and online-only warehouses. Myopic methods do not account for the temporal aspects of the problem. For example, a store should not ship an item to an online customer if there is high expected future demand for that item in-store. Instead, that item should be shipped from a store or warehouse where future expected demand is lower. This optimal choice of fulfillment location increases system-wide profits by preventing cannibalization as well as potentially selling the item before it reaches the sales period. The proposed algorithm also considers important variables related to customer experience such as the amount of time the order will take to be delivered. This algorithm was designed and tested at Zara, a subsidiary of Inditex S.A. A mixed integer program with two periods accounting for expected demand now and in the future is shown to optimally solve for how to fulfill any arbitrary order. However, this algorithm is intractable at larger order sizes. In this case, we create an online algorithm based on a heuristic. Use of this algorithm increases the total expected profit from any unit of inventory entering a store or warehouse by minimizing cannibalization and shipping costs. In addition, this algorithm minimizes the need for inventory re-allocation across the network. At Zara this algorithm was shown to improve the objective function by roughly 0.4% on a system-wide basis as compared to a myopic approach. by Scott Douglas Foster. M.B.A. S.M. 47 pages eng Massachusetts Institute of Technology MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 Sloan School of Management. Civil and Environmental Engineering. Leaders for Global Operations Program. Fulfillment algorithm for integrating stock between brick and mortar and E-commerce Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6be2c8ef-8b8e-4816-a4c3-64d2a2ed8ca1"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Fulfillment algorithm for integrating stock between brick and mortar and E-commerce</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018</PublicationDate> <Authors> <Author> <DisplayName>Foster, Scott Douglas, M.B.A. Sloan School of Management</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Sloan School of Management.</Keyword> <Keyword>Civil and Environmental Engineering.</Keyword> <Keyword>Leaders for Global Operations Program.</Keyword> <Abstract>This thesis proposes a novel fulfillment algorithm which maximizes profits and customer experience through optimal distribution in a multi-period setting for a set of shipping locations that includes both stores and online-only warehouses. Myopic methods do not account for the temporal aspects of the problem. For example, a store should not ship an item to an online customer if there is high expected future demand for that item in-store. Instead, that item should be shipped from a store or warehouse where future expected demand is lower. This optimal choice of fulfillment location increases system-wide profits by preventing cannibalization as well as potentially selling the item before it reaches the sales period. The proposed algorithm also considers important variables related to customer experience such as the amount of time the order will take to be delivered. This algorithm was designed and tested at Zara, a subsidiary of Inditex S.A. A mixed integer program with two periods accounting for expected demand now and in the future is shown to optimally solve for how to fulfill any arbitrary order. However, this algorithm is intractable at larger order sizes. In this case, we create an online algorithm based on a heuristic. Use of this algorithm increases the total expected profit from any unit of inventory entering a store or warehouse by minimizing cannibalization and shipping costs. In addition, this algorithm minimizes the need for inventory re-allocation across the network. At Zara this algorithm was shown to improve the objective function by roughly 0.4% on a system-wide basis as compared to a myopic approach.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>