无人机
车辆路径问题
卡车
计算机科学
模拟退火
可变邻域搜索
聚类分析
启发式
布线(电子设计自动化)
整数规划
算法
运筹学
数学优化
元启发式
工程类
计算机网络
数学
人工智能
汽车工程
遗传学
生物
标识
DOI:10.1109/ccdc58219.2023.10327279
摘要
With the rapid development of e-commerce, the logistics industry is confronting the important challenge of catering for the rapidly growing customer demand. As an emerging vehicle, delivery using truck and drones have played an increasing role in satisfying customers demand for fast, flexible and reliable delivery services. Drones and trucks work together to deliver packages cooperatively, a new delivery model that has been proven to reduce overall costs, CO 2 emissions and delivery times. This paper studies the problem of drone-truck cooperative distribution route optimization, establishes a mixed integer programming model, and proposes a two-stage heuristic algorithm including the nearest neighbor algorithm and K-means clustering, as well as the hybridization of variable neighborhood simulated annealing algorithm to solve the drone-vehicle routing problem (Vehicle Routing Problem with Drones, VRP-D). Through the analysis and discussion of the experimental results, the effectiveness of the proposed algorithm is verified.
科研通智能强力驱动
Strongly Powered by AbleSci AI