Event
Beihang Team Proposes Rider-Drone Relay Delivery Solution Framework MoE-Pointer, Published at KDD 2026
1 reports · 1 sources
Professor Wang Jingyuan's team from the School of Computer Science at Beihang University, in collaboration with the School of Management at Shanghai University, defined the "Dynamic Multi-Stage Pickup and Delivery Problem" (DM-PDP) for the rider-drone relay delivery scenario and proposed the solution framework MoE-Pointer, which uses a sequence-to-sequence generation framework to achieve end-to-end reinforcement learning joint optimization of a three-tier delivery chain, simultaneously handling order allocation and route planning. The research has been published at the data mining conference KDD 2026. According to the paper, experiments were conducted on synthetic datasets and real urban datasets from Hangzhou, Shanghai, and Chongqing, comparing multiple classes of baseline methods including rolling-horizon OR solvers, metaheuristic algorithms, rule-based heuristics, and reinforcement learning; ablation experiments verified the necessity of each module, and the method maintained robust performance when tested under constraints such as station congestion, drone endurance limits, and travel time fluctuations.
Report timeline
- Beihang KDD 2026 paper proposes MoE-Pointer, using Seq2Seq reinforcement learning to jointly optimize rider-drone relay delivery
Professor Wang Jingyuan's team at Beihang University, together with the School of Management at Shanghai University, published the paper MoE-Pointer at KDD 2026, defining the Dynamic Multi-Stage Pickup and Delivery Problem (DM-PDP) and using a sequence-to-sequence generation framework to achieve end-to-end reinforcement learning joint optimization of a three-stage rider-drone delivery chain.
PaperWeekly · 微信公众号 ·