2026-09-19T15:03:20Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1222562026-06-06T01:04:11Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Milena Janjevic. Rautela, Himanshu. Massachusetts Institute of Technology. Supply Chain Management Program. Massachusetts Institute of Technology. Supply Chain Management Program 2019-09-17T19:50:57Z 2019-09-17T19:50:57Z 2019 2019 https://hdl.handle.net/1721.1/122256 1119538892 Thesis: M. Eng. in Supply Chain Management, Massachusetts Institute of Technology, Supply Chain Management Program, 2019 Cataloged from PDF version of thesis. Includes bibliographical references (pages 72-75). The rapid growth in e-commerce volumes, coupled with customer expectations of faster, flexible and cheaper parcel deliveries is increasing the pressure on retailers to design the most efficient delivery network. Collection-and-delivery points (CDPs) allow for the aggregation of demand and enable reductions in travel time and costs. CDPs also help minimize additional tours arising due to failed deliveries or failed pickups for returns. We formulate an optimization model that integrates CDPs in the design of the overall distribution network, including the location of upstream transshipment facilities. The model accounts for changes in demand density due to the placement of CDPs. It considers demand aggregation at the CDP for both forward and return flows, and the impact of failed deliveries and failed return pickups on the routing cost. The model considers multiple different route options and solves them using extended routing cost approximation formulae thus allowing the implementation of the model on large-scale problems. We then apply the model to solve a real-world case study on the last-mile distribution network of a major Brazilian e-commerce retailer. The results demonstrate that failed deliveries and failed return pickups increase both the last-mile cost and the overall cost of distribution, and CDPs effectively reduce these costs by aggregating the demand and minimizing travel time. by Himanshu Rautela. M.Eng. in Supply Chain Management M.Eng.inSupplyChainManagement Massachusetts Institute of Technology, Supply Chain Management Program 75 pages eng Massachusetts Institute of Technology MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided. http://dspace.mit.edu/handle/1721.1/7582 Supply Chain Management Program. Integrating collection-and-delivery points in the strategic design of last-mile e-commerce distribution networks Thesis application/pdf 2021-01-11T17:19:57Z Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="560c34af-aa7b-4a52-b69a-8fd7cd89e649"> <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>Integrating collection-and-delivery points in the strategic design of last-mile e-commerce distribution networks</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019</PublicationDate> <Authors> <Author> <DisplayName>Rautela, Himanshu.</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>Supply Chain Management Program.</Keyword> <Abstract>The rapid growth in e-commerce volumes, coupled with customer expectations of faster, flexible and cheaper parcel deliveries is increasing the pressure on retailers to design the most efficient delivery network. Collection-and-delivery points (CDPs) allow for the aggregation of demand and enable reductions in travel time and costs. CDPs also help minimize additional tours arising due to failed deliveries or failed pickups for returns. We formulate an optimization model that integrates CDPs in the design of the overall distribution network, including the location of upstream transshipment facilities. The model accounts for changes in demand density due to the placement of CDPs. It considers demand aggregation at the CDP for both forward and return flows, and the impact of failed deliveries and failed return pickups on the routing cost. The model considers multiple different route options and solves them using extended routing cost approximation formulae thus allowing the implementation of the model on large-scale problems. We then apply the model to solve a real-world case study on the last-mile distribution network of a major Brazilian e-commerce retailer. The results demonstrate that failed deliveries and failed return pickups increase both the last-mile cost and the overall cost of distribution, and CDPs effectively reduce these costs by aggregating the demand and minimizing travel time.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>