{"title":"Emerging optimization problems for distribution in same-day delivery","authors":"Yuanyuan Li , Claudia Archetti , Ivana Ljubić","doi":"10.1016/j.cor.2025.107105","DOIUrl":null,"url":null,"abstract":"<div><div>Same-day delivery (SDD) has become a new standard to satisfy the “instant gratification” of online customers. Despite existing powerful technologies deployed in last-mile delivery, SDD services face new decision-making challenges on the tradeoff between delivery costs and time. In addition, new concerns on environmental issues, customer satisfaction, and fairness arise. Researchers have explored various approaches to face these challenges in SDD, where data uncertainty plays a fundamental role. In this paper, we carefully review the emerging routing problems and solutions proposed in the existing literature for SDD services. We survey papers on how to manage dynamic order arrivals, how to allocate time slots for deliveries, how to select the right delivery options, how to design pickup and delivery routes, and how to partition delivery areas and decide the composition of the fleet. We also propose mathematical formulations for representative problems. Finally, we sketch managerial insights and identify future research directions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107105"},"PeriodicalIF":4.1000,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825001339","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Same-day delivery (SDD) has become a new standard to satisfy the “instant gratification” of online customers. Despite existing powerful technologies deployed in last-mile delivery, SDD services face new decision-making challenges on the tradeoff between delivery costs and time. In addition, new concerns on environmental issues, customer satisfaction, and fairness arise. Researchers have explored various approaches to face these challenges in SDD, where data uncertainty plays a fundamental role. In this paper, we carefully review the emerging routing problems and solutions proposed in the existing literature for SDD services. We survey papers on how to manage dynamic order arrivals, how to allocate time slots for deliveries, how to select the right delivery options, how to design pickup and delivery routes, and how to partition delivery areas and decide the composition of the fleet. We also propose mathematical formulations for representative problems. Finally, we sketch managerial insights and identify future research directions.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.