Processing

Please wait...

PATENTSCOPE will be unavailable a few hours for maintenance reason on Saturday 31.10.2020 at 7:00 AM CET
Settings

Settings

Goto Application

1. WO2019056875 - RIDESHARING ROUTE PLANNING METHOD, CLIENT, SERVER AND SYSTEM

Publication Number WO/2019/056875
Publication Date 28.03.2019
International Application No. PCT/CN2018/098642
International Filing Date 03.08.2018
IPC
G06Q 10/04 2012.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
10Administration; Management
04Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
G06Q 50/30 2012.01
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
50Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
30Transportation; Communications
CPC
G06Q 10/047
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
10Administration; Management
04Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
047Optimisation of routes, e.g. "travelling salesman problem"
G06Q 50/30
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
50Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
30Transportation; Communications
G08G 1/20
GPHYSICS
08SIGNALLING
GTRAFFIC CONTROL SYSTEMS
1Traffic control systems for road vehicles
20Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
Applicants
  • 北京摩拜科技有限公司 BEIJING MOBIKE TECHNOLOGY CO., LTD. [CN]/[CN]
Inventors
  • 夏一平 XIA, Yiping
  • 尹大飞 YIN, Dafei
  • 杨毓杰 YANG, Yujie
  • 朱家辉 ZHU, Jiahui
Agents
  • 北京博雅睿泉专利代理事务所(特殊普通合伙) BEYOND TALENT PATENT AGENT FIRM
Priority Data
201710855190.920.09.2017CN
Publication Language Chinese (ZH)
Filing Language Chinese (ZH)
Designated States
Title
(EN) RIDESHARING ROUTE PLANNING METHOD, CLIENT, SERVER AND SYSTEM
(FR) PROCÉDÉ DE PLANIFICATION D'ITINÉRAIRE DE COVOITURAGE, CLIENT, SERVEUR ET SYSTÈME
(ZH) 共乘路线的规划方法、客户端、服务器及系统
Abstract
(EN)
A ridesharing route planning method, a client, a server and a system. The method comprises: obtaining traffic geographic information and travel parameters of each ridesharing passenger (S2100); selecting corresponding candidate start points according to departure locations of the plurality of ridesharing passengers, and obtaining a candidate start point set comprising the plurality of candidate start points (S2200); constructing a plurality of candidate ridesharing routes according to the traffic geographic information, the travel parameters of the ridesharing passengers and the candidate start point set, and calculating a travel cost of each candidate ridesharing route (S2300); selecting the candidate ridesharing route having the lowest travel cost as a ridesharing route, providing the corresponding ridesharing route to the plurality of ridesharing passengers, and triggering each ridesharing passenger to participate in ridesharing travel via a ridesharing communication device (S2400). The present invention minimises the travel costs for all the ridesharing passengers, and increases the ridesharing travel efficiency.
(FR)
La présente invention concerne un procédé de planification d'itinéraire de covoiturage, un client, un serveur et un système. Le procédé consiste à : obtenir des informations géographiques de trafic et des paramètres de déplacement de chaque passager de covoiturage (S2100) ; sélectionner des points de départ candidats correspondants en fonction des emplacements de départ de la pluralité de passagers de covoiturage, et obtenir un ensemble de points de départ candidats comprenant la pluralité de points de départ candidats (S2200) ; construire une pluralité d'itinéraires de covoiturage candidats en fonction des informations géographiques de trafic, des paramètres de déplacement des passagers de covoiturage et de l'ensemble de points de départ candidats, et calculer un coût de déplacement de chaque itinéraire de covoiturage candidat (S2300) ; sélectionner l'itinéraire de covoiturage candidat ayant le coût de déplacement le plus bas en tant qu'itinéraire de covoiturage, fournir l'itinéraire de covoiturage correspondant à la pluralité de passagers de covoiturage, et inviter chaque passager de covoiturage à participer à un déplacement de covoiturage par l'intermédiaire d'un dispositif de communication de covoiturage (S2400). La présente invention permet de réduire au minimum les coûts de déplacement pour tous les passagers de covoiturage, et d'augmenter l'efficacité de déplacement en covoiturage.
(ZH)
一种共乘路线的规划方法、服务器、客户端及系统。该方法包括:获取交通地理信息以及每个共乘人员的出行参数(S2100);根据多个共乘人员的出发地,选择对应的候选起点,得到包括多个候选起点的候选起点集(S2200);根据交通地理信息、共乘人员的出行参数以及候选起点集,构建多条候选共乘路线,并计算获取每条候选共乘路线的出行成本(S2300);选择出行成本最小的候选共乘路线作为共乘路线,将向多个共乘人员提供对应的共乘路线,触发每个所述共乘人员通过共乘交通设备共乘出行(S2400)。可以实现全体共乘人员的出行成本最小,提高共乘出行效率。
Also published as
Latest bibliographic data on file with the International Bureau