{"title":"A Random Restart Local Search Matheuristic for the Flying Sidekick Traveling Salesman Problem","authors":"M. dell’Amico, R. Montemanni, Stefano Novellani","doi":"10.1145/3463858.3463866","DOIUrl":null,"url":null,"abstract":"Drones and unmanned vehicles in general are gaining more and more interest in the logistic sector, due to the potential economic advantages they can provide. In this paper we focus on optimizing the use of a drone in conjunction with a truck for urban deliveries, dealing with what is called the flying sidekick traveling salesman problem. There is a set of customers that it is possible to serve either by a truck or by a drone. The target is to minimize the total time required to complete deliveries to all the customers. In this paper we show how an effective and simple random restart local search heuristic algorithm can be derived from a known mixed integer programming model for the problem.","PeriodicalId":317727,"journal":{"name":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3463858.3463866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Drones and unmanned vehicles in general are gaining more and more interest in the logistic sector, due to the potential economic advantages they can provide. In this paper we focus on optimizing the use of a drone in conjunction with a truck for urban deliveries, dealing with what is called the flying sidekick traveling salesman problem. There is a set of customers that it is possible to serve either by a truck or by a drone. The target is to minimize the total time required to complete deliveries to all the customers. In this paper we show how an effective and simple random restart local search heuristic algorithm can be derived from a known mixed integer programming model for the problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
