一种考虑乘客等待耐心不确定性的网约车实时派单方法及系统

By extracting data features and constructing parameters for real-time ride-hailing dispatch methods, and combining global optimal matching distribution planning and cyclic probabilistic matching decision-making, the problems of short-sightedness, slow response, and strong data dependence in ride-hailing dispatch systems are solved. This achieves efficient resource allocation and passenger patience management, and improves the robustness and profitability of the system.

CN121998301BActive Publication Date: 2026-07-17BEIJING JIAOTONG UNIV

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
BEIJING JIAOTONG UNIV
Filing Date
2025-12-26
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing ride-hailing dispatching technologies suffer from suboptimal greedy matching strategies, slow response times with batch matching strategies, and strong data dependence with reinforcement learning or stochastic optimization strategies. Furthermore, they ignore the uncertainty of passenger patience, leading to misallocation of transportation resources and passenger anxiety while waiting.

Method used

By employing data feature extraction and parameter construction, and performing spatiotemporal gridded classification based on historical operational data, a resource allocation model is constructed. Combining global optimal matching distribution planning and cyclic probabilistic matching decision-making, patience period verification and supply and demand adjustment factors are introduced to achieve real-time order response and resource reservation.

Benefits of technology

It improves the system's robustness and global benefits, takes into account real-time performance, adapts to the randomness of passenger patience, and reduces order loss rate and short-sightedness issues when capacity is scarce.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121998301B_ABST
    Figure CN121998301B_ABST
Patent Text Reader

Abstract

本发明提供一种考虑乘客等待耐心不确定性的网约车实时派单方法及系统。方法包括基于历史运营数据对司机与订单进行时空网格化分类,得到供给与需求类别,计算各类订单的到达率、平均行程收益、平均服务占用时长、平均等待耐心时长及各类司机的运力供给数量;基于上述参数构建资源分配模型并求解,生成基准匹配概率;实时订单经耐心期校验后加入动态候补队列,剔除超时失效订单;针对有效订单,检索周边空闲司机并按类别生成随机遍历序列,结合基准匹配概率与实时供需调节因子计算派单阈值并进行随机判定;若判定通过则派单并移除订单,否则将其保留至队列中等待下一周期优先匹配,实现跨周期资源预留。本发明有效降低因等待超时导致的订单流失率。
Need to check novelty before this filing date? Find Prior Art