{"title":"驾驶员辅助问题:最后一英里配送的协调物流","authors":"S. Raghavan, Rui Zhang","doi":"10.1287/msom.2022.0211","DOIUrl":null,"url":null,"abstract":"Problem definition: Last-mile delivery is a critical component of logistics networks, accounting for approximately 30%–35% of costs. As delivery volumes have increased, truck route times have become unsustainably long. To address this issue, many logistics companies, including FedEx and UPS, have resorted to using a “driver aide” to assist with deliveries. The aide can assist the driver in two ways. As a “jumper,” the aide works with the driver in preparing and delivering packages, thus reducing the service time at a given stop. As a “helper,” the aide can independently work at a location delivering packages, and the driver can leave to deliver packages at other locations and then return. Given a set of delivery locations, travel times, service times, jumper’s savings, and helper’s service times, the goal is to determine both the delivery route and the most effective way to use the aide (e.g., sometimes as a jumper and sometimes as a helper) to minimize the total routing time. Methodology/results: We model this problem as an integer program with an exponential number of variables and an exponential number of constraints and propose a branch-cut-and-price approach for solving it. Our computational experiments are based on simulated instances built on real-world data provided by an industrial partner and a data set released by Amazon. The instances based on the Amazon data set show that this novel operation can lead to, on average, a 35.8% reduction in routing time and 22.0% in cost savings. More importantly, our results characterize the conditions under which this novel operation mode can lead to significant savings in terms of both the routing time and cost. Managerial implications: Our computational results show that the driver aide with both jumper and helper modes is most effective when there are denser service regions and when the truck’s speed is higher (≥10 miles per hour). Coupled with an economic analysis, we come up with rules of thumb (that have close to 100% accuracy) to predict whether to use the aide and in which mode. Empirically, we find that the service delivery routes with greater than 50% of the time devoted to delivery (as opposed to driving) are the ones that provide the greatest benefit. These routes are characterized by a high density of delivery locations. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0211 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"69 1","pages":"0"},"PeriodicalIF":4.8000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery\",\"authors\":\"S. Raghavan, Rui Zhang\",\"doi\":\"10.1287/msom.2022.0211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problem definition: Last-mile delivery is a critical component of logistics networks, accounting for approximately 30%–35% of costs. As delivery volumes have increased, truck route times have become unsustainably long. To address this issue, many logistics companies, including FedEx and UPS, have resorted to using a “driver aide” to assist with deliveries. The aide can assist the driver in two ways. As a “jumper,” the aide works with the driver in preparing and delivering packages, thus reducing the service time at a given stop. As a “helper,” the aide can independently work at a location delivering packages, and the driver can leave to deliver packages at other locations and then return. Given a set of delivery locations, travel times, service times, jumper’s savings, and helper’s service times, the goal is to determine both the delivery route and the most effective way to use the aide (e.g., sometimes as a jumper and sometimes as a helper) to minimize the total routing time. Methodology/results: We model this problem as an integer program with an exponential number of variables and an exponential number of constraints and propose a branch-cut-and-price approach for solving it. Our computational experiments are based on simulated instances built on real-world data provided by an industrial partner and a data set released by Amazon. The instances based on the Amazon data set show that this novel operation can lead to, on average, a 35.8% reduction in routing time and 22.0% in cost savings. More importantly, our results characterize the conditions under which this novel operation mode can lead to significant savings in terms of both the routing time and cost. Managerial implications: Our computational results show that the driver aide with both jumper and helper modes is most effective when there are denser service regions and when the truck’s speed is higher (≥10 miles per hour). Coupled with an economic analysis, we come up with rules of thumb (that have close to 100% accuracy) to predict whether to use the aide and in which mode. Empirically, we find that the service delivery routes with greater than 50% of the time devoted to delivery (as opposed to driving) are the ones that provide the greatest benefit. These routes are characterized by a high density of delivery locations. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0211 .\",\"PeriodicalId\":49901,\"journal\":{\"name\":\"M&som-Manufacturing & Service Operations Management\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2023-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"M&som-Manufacturing & Service Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2022.0211\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"M&som-Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.0211","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
The Driver-Aide Problem: Coordinated Logistics for Last-Mile Delivery
Problem definition: Last-mile delivery is a critical component of logistics networks, accounting for approximately 30%–35% of costs. As delivery volumes have increased, truck route times have become unsustainably long. To address this issue, many logistics companies, including FedEx and UPS, have resorted to using a “driver aide” to assist with deliveries. The aide can assist the driver in two ways. As a “jumper,” the aide works with the driver in preparing and delivering packages, thus reducing the service time at a given stop. As a “helper,” the aide can independently work at a location delivering packages, and the driver can leave to deliver packages at other locations and then return. Given a set of delivery locations, travel times, service times, jumper’s savings, and helper’s service times, the goal is to determine both the delivery route and the most effective way to use the aide (e.g., sometimes as a jumper and sometimes as a helper) to minimize the total routing time. Methodology/results: We model this problem as an integer program with an exponential number of variables and an exponential number of constraints and propose a branch-cut-and-price approach for solving it. Our computational experiments are based on simulated instances built on real-world data provided by an industrial partner and a data set released by Amazon. The instances based on the Amazon data set show that this novel operation can lead to, on average, a 35.8% reduction in routing time and 22.0% in cost savings. More importantly, our results characterize the conditions under which this novel operation mode can lead to significant savings in terms of both the routing time and cost. Managerial implications: Our computational results show that the driver aide with both jumper and helper modes is most effective when there are denser service regions and when the truck’s speed is higher (≥10 miles per hour). Coupled with an economic analysis, we come up with rules of thumb (that have close to 100% accuracy) to predict whether to use the aide and in which mode. Empirically, we find that the service delivery routes with greater than 50% of the time devoted to delivery (as opposed to driving) are the ones that provide the greatest benefit. These routes are characterized by a high density of delivery locations. Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0211 .
期刊介绍:
M&SOM is the INFORMS journal for operations management. The purpose of the journal is to publish high-impact manuscripts that report relevant research on important problems in operations management (OM). The field of OM is the study of the innovative or traditional processes for the design, procurement, production, delivery, and recovery of goods and services. OM research entails the control, planning, design, and improvement of these processes. This research can be prescriptive, descriptive, or predictive; however, the intent of the research is ultimately to develop some form of enduring knowledge that can lead to more efficient or effective processes for the creation and delivery of goods and services.
M&SOM encourages a variety of methodological approaches to OM research; papers may be theoretical or empirical, analytical or computational, and may be based on a range of established research disciplines. M&SOM encourages contributions in OM across the full spectrum of decision making: strategic, tactical, and operational. Furthermore, the journal supports research that examines pertinent issues at the interfaces between OM and other functional areas.