多卡车与多无人机协同配送路径优化问题研究  

Routing problem of multiple trucks and drones cooperative delivery

作　　者：镇璐[1] 高佳静 谭哲一 ZHEN Lu;GAO Jia-jing;TAN Zhe-yi(School of Management,Shanghai University,Shanghai 200444,China)

机构地区：[1]上海大学管理学院,上海200444

出　　处：《管理科学学报》2024年第7期1-18,共18页Journal of Management Sciences in China

基　　金：国家自然科学基金资助项目(72025103,72361137001,72394362,72394360).

摘　　要：随着智能物流业的飞速发展,卡车和无人机协同运输系统在业界的探索性应用越来越引起学界研究的重视.本文研究了多卡车多无人机协同配送问题,以最小化系统的总成本为优化目标,建立一个混合整数规划模型.为了求解该模型,本研究还设计了一种基于列生成的求解算法,以及基于变邻域搜索算法的加速算法改进策略,进一步缩短求解时间.本研究通过大量数值实验验证了所提模型的有效性和算法的有效性,另外还通过一些敏感性分析实验提出了若干对实践有指导意义的管理启示。The application of collaborative delivery systems based on trucks and drones have attracted more and more attention from the academia.This study investigates a routing problem of multiple trucks and drones cooperative delivery,and formulates a mixed-integer programming model with the objective of minimizing the total cost.A solution method based on column generation is proposed to solve the model.An accelerating tech-nique based on variable neighborhood search is also embedded in the solution method to reduce the computa-tion time.Numerical experiments are also conducted to validate the effectiveness of the proposed model and ef-ficiency of the proposed solution method.Some potentially useful managerial implications are also outlined based on some sensitivity analysis.

关 键 词：协同配送 路径优化 无人机 混合整数规划 列生成 

分 类 号：F252[经济管理—国民经济] U116[交通运输工程] TP18[自动化与计算机技术—控制理论与控制工程]