{"title":"异构无人机-卡车路径问题的精确算法","authors":"Munjeong Kang, Chungmok Lee","doi":"10.1287/trsc.2021.1055","DOIUrl":null,"url":null,"abstract":"Recently, there are attempts to utilize drones in the logistic application. We consider the case in which there are multiple drones with different characteristics, such as speed and battery capacity. The truck and drone collaborate the delivery to serve all customers, while the drones are carried by and dispatched from the truck. The multiple drones can be deployed simultaneously; however, the truck must wait until all drones return. Therefore, the goal is to minimize the total sum of truck travel and waiting times for drones to return after deliveries. We call the proposed model a heterogeneous drone-truck routing problem (HDTRP), and a mixed-integer programming formulation for the problem is presented. We develop an exact algorithm based on the logic-based Benders decomposition approach, which outperforms the state-of-the-art solvers.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"33 1","pages":"1088-1112"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem\",\"authors\":\"Munjeong Kang, Chungmok Lee\",\"doi\":\"10.1287/trsc.2021.1055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, there are attempts to utilize drones in the logistic application. We consider the case in which there are multiple drones with different characteristics, such as speed and battery capacity. The truck and drone collaborate the delivery to serve all customers, while the drones are carried by and dispatched from the truck. The multiple drones can be deployed simultaneously; however, the truck must wait until all drones return. Therefore, the goal is to minimize the total sum of truck travel and waiting times for drones to return after deliveries. We call the proposed model a heterogeneous drone-truck routing problem (HDTRP), and a mixed-integer programming formulation for the problem is presented. We develop an exact algorithm based on the logic-based Benders decomposition approach, which outperforms the state-of-the-art solvers.\",\"PeriodicalId\":23247,\"journal\":{\"name\":\"Transp. Sci.\",\"volume\":\"33 1\",\"pages\":\"1088-1112\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transp. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2021.1055\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transp. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2021.1055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem
Recently, there are attempts to utilize drones in the logistic application. We consider the case in which there are multiple drones with different characteristics, such as speed and battery capacity. The truck and drone collaborate the delivery to serve all customers, while the drones are carried by and dispatched from the truck. The multiple drones can be deployed simultaneously; however, the truck must wait until all drones return. Therefore, the goal is to minimize the total sum of truck travel and waiting times for drones to return after deliveries. We call the proposed model a heterogeneous drone-truck routing problem (HDTRP), and a mixed-integer programming formulation for the problem is presented. We develop an exact algorithm based on the logic-based Benders decomposition approach, which outperforms the state-of-the-art solvers.