首页> 外文期刊>Journal of Industrial Engineering and Management >Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm
【24h】

Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm

机译:基于k均值和遗传算法的串联运输网络中卡车无人机的优化。

获取原文
           

摘要

Purpose: The purpose of this paper is to investigate the effectiveness of implementing unmanned aerial delivery vehicles in delivery networks. We investigate the notion of the reduced overall delivery time, energy, and costs for a truck-drone network by comparing the in-tandem system with a stand-alone delivery effort. The objectives are (1) to investigate the time, energy, and costs associated to a truck-drone delivery network compared to standalone truck or drone, (2) to propose an optimization algorithm that determines the optimal number of launch sites and locations given delivery requirements, and drones per truck, (3) to develop mathematical formulations for closed form estimations for the optimal number of launch locations, optimal total time, as well as the associated cost for the system.Design/methodology/approach: The design of the algorithm herein computes the minimal time of delivery utilizing K-means clustering to find launch locations, as well as a genetic algorithm to solve the truck route as a traveling salesmen problem (TSP). The optimal solution is determined by finding the minimum cost associated to the parabolic convex cost function. The optimal min-cost is determined by finding the most efficient launch locations using K-means algorithms to determine launch locations and a genetic algorithm to determine truck route between those launch locations. Findings: Results show improvements with in-tandem delivery efforts as opposed to standalone systems. Further, multiple drones per truck are more optimal and contribute to savings in both energy and time. For this, we sampled various initialization variables to derive closed form mathematical solutions for the problem. Originality/value: Ultimately, this provides the necessary analysis of an integrated truck-drone delivery system which could be implemented by a company in order to maximize deliveries while minimizing time and energy. Closed-form mathematical solutions can be used as close estimators for final costs and time.
机译:目的:本文的目的是研究在交付网络中实施无人空中交付车辆的有效性。通过将串联系统与独立交付工作进行比较,我们研究了减少卡车无人驾驶网络的总体交付时间,能源和成本的想法。目标是(1)研究与独立卡车或无人驾驶飞机相比,卡车-无人驾驶飞机交付网络相关的时间,能源和成本,(2)提出一种优化算法,确定给定交付的最佳发射地点和地点数量需求和每辆卡车的无人驾驶飞机(3),以开发数学公式进行封闭式估算,以得出最佳的发射地点数量,最佳的总时间以及系统的相关成本。设计/方法/方法:本文的算法使用K-means聚类计算发射的最短时间,以找到发射地点,并采用遗传算法解决卡车路线作为旅行商问题(TSP)。通过找到与抛物线凸成本函数相关的最小成本来确定最佳解决方案。通过使用K-means算法确定发射位置并使用遗传算法确定在这些发射位置之间的卡车路线找到最有效的发射位置,可以确定最佳的最小成本。结果:结果表明,与独立系统相比,串联交付方式有所改善。此外,每辆卡车的多架无人机更为理想,有助于节省能源和时间。为此,我们对各种初始化变量进行了采样,以得出该问题的封闭形式数学解。独创性/价值:最终,这提供了公司可以实施的集成卡车无人驾驶运输系统的必要分析,以便在最大程度地减少时间和精力的情况下最大化运输量。封闭式数学解决方案可用作最终成本和时间的近似估计器。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号