• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Advances in Pattern Recognition >A heuristics based approach for optimizing delivery schedule of an Unmanned Aerial Vehicle (Drone) based delivery system
【24h】

A heuristics based approach for optimizing delivery schedule of an Unmanned Aerial Vehicle (Drone) based delivery system

机译：基于启发式的优化无人驾驶飞机（Drone）交付系统的交付计划的方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this work we address the problem of computing a delivery schedule for drones in an Unmanned Aerial Vehicle delivery system. The problem specification consists of a set of orders (each order contains a list of items with quantity) to be delivered to customers whose locations are known, also specified are locations of warehouses and drones. The aim is to minimize the time for completing a batch of order deliveries. The problem has some of the features of the Vehicle Routing Problem (as well as the Travelling Salesman Problem), however the increased number of constraints and dynamic nature of the problem are the distinguishing features in this setting. As most versions of the problem are NP-hard we employ a heuristics based approach since such an approach would be more suitable to solve large scale instances of the problem that might be encountered by a commercial delivery service. The proposed heuristics are compared with regard to the quality of solution and computation overhead.
机译：在这项工作中，我们解决了在无人飞行器交付系统中计算无人机交付时间表的问题。问题规范由一组订单（每个订单包含数量清单）组成，这些订单将交付给位置已知的客户，还指定了仓库和无人机的位置。目的是最大程度地减少完成一批订单交付的时间。该问题具有“车辆路径问题”（以及“旅行推销员问题”）的某些功能，但是约束的数量增加和问题的动态性质是此设置中的显着特征。由于该问题的大多数版本都是NP难题，因此我们采用基于启发式的方法，因为这种方法更适合解决商业交付服务可能遇到的大规模问题实例。比较了所提出的启发式方法的解决方案质量和计算开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号