首页 >

时变网络下多目标空地协同取送货任务分配

王飞,徐浩凡   

  1. 中国民航大学
  • 收稿日期:2025-12-04 修回日期:2026-03-16 出版日期:2026-03-19 发布日期:2026-03-19
  • 通讯作者: 王飞
  • 基金资助:
    国家重点研发计划项目

Multi-Objective Air-Ground Collaborative Pickup and Delivery Task Allocation Under Time-Varying Networks

  • Received:2025-12-04 Revised:2026-03-16 Online:2026-03-19 Published:2026-03-19

摘要: 针对现有车辆-无人机协同配送研究中忽略路网时变性、目标单一及约束整合不足的问题,聚焦多配送中心取送货场景,以“总路径长度最小化、惩罚成本最小化、总能耗最小化”为决策目标,整合时变速度、软时间窗及无人机续航和载重等多重约束,提出基于时段划分的时变速度模型与软时间窗惩罚机制,构建多目标多约束优化模型。在NSGA-II基础上,设计“客户排序-配送中心分配-无人机服务标记”三层染色体编码结构,搭配混合交叉算子和交叉变异、单点变异、位翻转变异三类变异算子,以及锦标赛选择与精英保留的双层选择策略,建立改进NSGA-II算法对模型进行求解。基于4个配送中心、36个客户的算例开展研究,结果显示NSGA-II算法的总路径分布在100.35-291.21km、惩罚成本分布在831.69-12,323.58元、总能耗分布在20.88-66.67kWh,生成的Pareto前沿分布均匀,综合考量HV、IGD和Spacing指标显著优于SPEA2、MOEA/D和NSGA-III等多目标算法。进一步以天津市部分主城区真实路网为场景开展验证,结合高德地图API获取实际道路距离数据,构建真实城市下含多类型客户需求的配送网络,结果表明优化方案可适配城市复杂路网特性与异质需求,兼顾效率、成本与低碳目标。研究证实,所构建的模型和算法可行有效,能为物流企业提供贴合实际场景的决策支持。

关键词: 低空经济, 车辆-无人机协同配送, 任务分配, 时变网络, 软时间窗, 多目标优化, NSGA-II

Abstract: Aiming at the problems of ignoring road network time-variability, single objective, and insufficient constraint integration in existing vehicle-UAV collaborative delivery research, this study focuses on the scenario of pickup and delivery with multiple distribution centers. Taking "minimizing total path length, minimizing penalty cost, and minimizing total energy consumption" as the decision-making objectives, it integrates multiple constraints such as time-varying speed, soft time windows, UAV endurance, and load capacity. A time-varying speed model based on time segment division and a penalty mechanism for soft time windows are proposed, and a multi-objective and multi-constraint optimization model is constructed. On the basis of NSGA-II, a three-layer chromosome coding structure of "customer sequencing - distribution center allocation - UAV service marking" is designed. This structure is combined with a hybrid crossover operator, three types of mutation operators (crossover mutation, single-point mutation, and bit-flipping mutation), and a two-layer selection strategy (tournament selection and elitism preservation), thus establishing an improved NSGA-II algorithm to solve the model. A case study is carried out based on 4 distribution centers and 36 customers. The results show that the total path length of the improved NSGA-II algorithm ranges from 100.35 km to 291.21 km, the penalty cost ranges from 831.69 yuan to 12,323.58 yuan, and the total energy consumption ranges from 20.88 kWh to 66.67 kWh. The generated Pareto frontier has a uniform distribution, and its comprehensive performance in terms of HV, IGD, and Spacing indicators is significantly better than that of other multi-objective algorithms such as SPEA2, MOEA/D, and NSGA-III. Furthermore, verification is conducted using the real road network of some main urban areas in Tianjin as the scenario. Actual road distance data are obtained by integrating the Amap API, and a delivery network with multi-type customer demands under a real city environment is constructed. The results indicate that the optimized scheme can adapt to the characteristics of complex urban road networks and heterogeneous demands, while balancing the objectives of efficiency, cost, and low carbon. The study confirms that the constructed model and algorithm are feasible and effective, and can provide decision support for logistics enterprises that is consistent with practical scenarios.

Key words: Low-altitude economy, Vehicle-drone collaborative delivery, Task assignment, Time-varying network, Soft time window, Multi-objective optimization, NSGA-II