WO2016023435A1 - Système et procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne - Google Patents

Système et procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne Download PDF

Info

Publication number
WO2016023435A1
WO2016023435A1 PCT/CN2015/086090 CN2015086090W WO2016023435A1 WO 2016023435 A1 WO2016023435 A1 WO 2016023435A1 CN 2015086090 W CN2015086090 W CN 2015086090W WO 2016023435 A1 WO2016023435 A1 WO 2016023435A1
Authority
WO
WIPO (PCT)
Prior art keywords
taxi
server
dispatch
operating area
area
Prior art date
Application number
PCT/CN2015/086090
Other languages
English (en)
Chinese (zh)
Inventor
汤鹏
王柏
Original Assignee
北京东方车云信息技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京东方车云信息技术有限公司 filed Critical 北京东方车云信息技术有限公司
Publication of WO2016023435A1 publication Critical patent/WO2016023435A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling

Definitions

  • the present invention relates to a system and method for dispatching orders in a network rental car, and more particularly to a system and method for dispatching orders according to the familiarity of the taxi operating area.
  • the passenger client sends a request for the taxi to the server, and the server generates the dispatch information according to the request, and pushes the information to the vehicle terminal of the taxi that meets the distance condition (within a certain range from the passenger's starting address) and the empty driving condition.
  • the server When the taxi driver using the vehicle terminal selects the order according to his own operation, an order is generated, the contact information of the taxi is returned to the passenger, and then a specific taxi transaction is completed between the passenger and the taxi.
  • the present invention provides a dispatch system based on the familiarity of the taxi operation area in the network rental car, the system including the vehicle terminal, the passenger client, and the realization A server that dispatches a single ticket, characterized in that
  • the passenger client sends a taxi request message to the server, where the message includes a start address and a destination address of the ride;
  • the server receives a taxi request message from the passenger client, and determines a matching degree between the requested operating area and the familiar operating area of the taxi according to the starting address and the destination address in the request message; afterwards, the server utilizes the Matching and synthesizing other related information to sort the taxis, and sorting out at least one taxi according to the order; then, the server pushes the dispatch message to the at least one taxi by using the taxi request message vehicle terminal;
  • the in-vehicle terminal receives the dispatch message and decides whether to take the order according to the operation situation.
  • the server divides the operating area of the taxi into operating areas of different familiar levels according to the historical operation data of the taxi, according to the frequency of the operation of the taxi in a certain area, and operates in a certain area.
  • the server determines the matching degree of the taxi request with the taxi operating area according to the familiarity level of the taxi in the area where the starting address and the destination address are located, where the starting address and the destination address are located.
  • the server clusters historical data of taxi operations to determine their familiarity with different operating regions.
  • the matching degree of the operating area determined by the server affects its ordering on the received in-vehicle terminal, and the higher the matching degree, the higher the ranking.
  • the present invention provides a method for dispatching a single using the above system, comprising the steps of:
  • the passenger client sends a taxi request message to the server, the message including a ride Start address and destination address;
  • the server receives a taxi request message from the passenger client, and determines a matching degree between the requested operating area and the operating area of the taxi according to the starting address and the destination address in the request message;
  • the server uses the matching degree and integrates other related information to sort the taxis
  • the server filters out at least one taxi according to the order
  • the server sends a dispatch message to an in-vehicle terminal that screens out at least one taxi;
  • the in-vehicle terminal receives the dispatch message and decides whether to take the order.
  • the server performs the following steps before performing the specific dispatch:
  • the server divides the operating area of the taxi into operating areas of different familiar levels according to the historical operation data of the taxi according to the historical operation data of the taxi. The higher the frequency of operation in a certain area, the higher the familiar level.
  • the clustering method is used in the step of determining the region familiarity level to perform the division of the different familiar level operating regions.
  • the server determines the matching degree between the requested operating area and the operating area of the taxi as follows:
  • the matching degree of the taxi request with the taxi operating area is determined according to the familiarity level of the taxi in the area where the starting address and the destination address are located, and the higher the familiarity level of the area where the starting address and the destination address are located, the higher the matching degree.
  • the dispatch system can effectively reduce the driver's idling and unnecessary search caused by unfamiliar starting address or destination address, and reduce the taxi system.
  • Energy consumption and time wastage improve the overall operational efficiency, reduce the abandonment caused by the lack of passengers to get on the train, improve the order execution success rate of the taxi system and the user's taxi experience.
  • Figure 1 shows a dispatch system of one embodiment of the present invention.
  • Figure 2 shows an example of determining the level of familiarity of a taxi to an operational area.
  • Figure 3 shows an example of using a clustering method to determine the level of familiarity of a taxi to an operational area.
  • Figure 4 illustrates the steps of placing a single order in accordance with one embodiment of the method of the present invention.
  • the dispatch ordering system includes the following components:
  • the passenger client 1 sends a taxi request message to the server 3, where the message includes a start address and a destination address.
  • the passenger clients 1, 1' respectively send a taxi request message D1, D1' to the server, wherein
  • Taxi request message D1 starting address: S1; destination address: E1;
  • Taxi request message D1' starting address: S2; destination address: E2;
  • the server 3 receives the taxi request message D1, D1' from the passenger client 1, 1' and determines the requested operating area and based on the starting address and the destination address in the request message D1, D1'.
  • the matching degree of the operation area of the taxis C1, C1', C1" ; afterwards, the server 3 sorts the taxis C1, C1', C1" by using the matching degree and synthesizing other related information, and is sorted by D1 respectively.
  • D1' filters out the taxis C1', C1; then, the server 3 generates a dispatch message D1 to the taxi C1' with the taxi request message D1, and generates a dispatch message D1 with the taxi request message D1' 'Push to taxi C1.
  • the historical operation start destination addresses of the taxis C1, C1', C1" are respectively ⁇ , It is indicated that the operating area is represented by its abscissa and ordinate, respectively, such as 1-B indicating that the horizontal axis is in one segment and the vertical axis is in the segment B region.
  • the server 3 determines the driver by calculating the number of occurrences of the starting destination address of each taxi in each area, that is, dividing the operating area of the taxi into different familiar level operating areas according to the frequency of operation of the taxi in a certain area. The level of familiarity with the area.
  • the familiarity of the taxis C1, C1', C1" to the areas 1-A, 4-D, 1-D, 3-A related to the taxi request messages D1, D1' is as follows, in the table, In parentheses is the frequency with which the taxi operates in the area, and to simplify the discussion, only the familiarity levels are divided into two levels: familiar and unfamiliar:
  • the starting point or the destination address is recorded as 1 in the familiar area, and 0 is entered in the unfamiliar area, but the actual use can be used in a more detailed level of familiarity, for example According to the familiarity, the operating area is divided into 0-4 total 5 levels, and the matching values are 0, 1, 2, 3, 4 according to their respective falling into different levels.
  • the matching degree of the dispatch ticket and the taxi can be calculated as follows:
  • Matching degree familiarity with the starting point + familiarity with the end point
  • the taxis are sorted as C1', C1, C1"; according to the sort, D1 should be dispatched to the taxi C1';
  • the taxis are sorted as C1, C1', C1"; according to this sort, D2 should be dispatched to taxi C1.
  • the familiarity level of the operating areas of the taxis C1, C1', C1" is divided by the clustering method, and the historical operation of the taxis C1, C1', C1" is shown.
  • the starting and destination addresses are respectively ⁇ , It is said that after clustering by algorithm such as k-means, the operating areas familiar to taxi C1 are respectively J1-1, J1-2; the operating areas familiar to taxi C1' are J2-1, J2-2, J2- 3; Taxi C1" familiar operating areas are J3-1, J3-2, J3-3.
  • the matching degree between the dispatch order and the taxi can be calculated as follows:
  • Matching degree familiarity with the starting point + familiarity with the end point
  • the taxis are sorted as C1', C1, C1"; according to the sort, the server 3 filters out the taxi C1' and dispatches D1 to the taxi C1';
  • the server 3 filters out the taxi C1 and dispatches D2 to the taxi C1.
  • the matching value can not only affect the screening of the taxi when the order is dispatched, but also affect the ordering of the dispatching order in the vehicle terminal, that is, on the vehicle terminal, if other conditions are the same
  • the order with the high matching degree is ranked first.
  • another aspect of the present invention provides a method for dispatching a single using the above system, the method comprising the following steps:
  • S1001 The passenger client sends a taxi request message to the server, where the message includes a start address and a destination address of the ride;
  • the server receives a taxi request message from the passenger client, and determines a matching degree between the requested operating area and the familiar operating area of the taxi according to the starting address and the destination address in the request message;
  • S1003 The server uses the matching degree and integrates other related information to sort the taxis
  • S1004 The server filters out at least one taxi according to the order
  • S1005 The server sends a dispatch message to an in-vehicle terminal that screens out at least one taxi;
  • S1006 The in-vehicle terminal receives the dispatch message and determines whether to take the order.
  • step S1002 the server performs the following steps before the above steps are performed:
  • the server divides the operating area of the taxi into different familiar operating areas according to the frequency of the operation of the taxi in a certain area, and the frequency of operation in a certain area is higher. The higher the level.
  • the above steps may use a clustering method to perform division of different familiar level operating areas.
  • the matching degree between the taxi request and the taxi operating area is determined according to the familiarity level of the taxi in the area where the starting address and the destination address are located, and the familiar level of the starting address and the destination address is matched. The higher the degree.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

La présente invention concerne un système et un procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne. Le système comprend un terminal embarqué, un client de passager, et un serveur de mise en œuvre de la répartition. Le client du passager transmet au serveur un message de demande de location de taxi, le message comprenant une adresse d'origine et une adresse de destination d'un passager ; le serveur reçoit le message de demande de location de taxi provenant du client du passager et détermine, sur la base de l'adresse d'origine et de l'adresse de destination dans le message de demande, un degré de correspondance entre une zone de travail de la demande et une zone de travail qu'un taxi connaît ; ensuite, le serveur trie des taxis en utilisant le degré de correspondance et en prenant en considération d'autres informations associées, et extrait par filtrage au moins un taxi en fonction de l'ordre de tri ; ensuite, le serveur génère, à partir du message de demande de location de taxi, un message de répartition et pousse celui-ci vers un terminal embarqué du ou des taxis extraits par filtrage ; et le terminal embarqué reçoit le message de répartition et détermine s'il faut ou non accepter la répartition sur la base des conditions de travail.
PCT/CN2015/086090 2014-08-12 2015-08-05 Système et procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne WO2016023435A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410393733.6 2014-08-12
CN201410393733.6A CN104794553B (zh) 2014-08-12 2014-08-12 网络租车中基于出租车运营区域熟悉程度的派单系统和方法

Publications (1)

Publication Number Publication Date
WO2016023435A1 true WO2016023435A1 (fr) 2016-02-18

Family

ID=53559339

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/086090 WO2016023435A1 (fr) 2014-08-12 2015-08-05 Système et procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne

Country Status (2)

Country Link
CN (1) CN104794553B (fr)
WO (1) WO2016023435A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119883A (zh) * 2019-04-16 2019-08-13 深圳壹账通智能科技有限公司 一种多平台通信方法、装置、计算机系统及可读存储介质
CN112801495A (zh) * 2021-01-22 2021-05-14 长沙市到家悠享家政服务有限公司 家政服务派单方法及服务端设备
CN114266632A (zh) * 2021-12-31 2022-04-01 首约科技(北京)有限公司 一种司机应答策略的保障方法
CN116682254A (zh) * 2023-08-03 2023-09-01 深圳市新乐数码科技有限公司 基于巡游出租车订单和gps数据的司机接单路线规划方法

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104794553B (zh) * 2014-08-12 2018-07-10 北京东方车云信息技术有限公司 网络租车中基于出租车运营区域熟悉程度的派单系统和方法
KR20180013843A (ko) 2015-01-29 2018-02-07 베이징 디디 인피니티 테크놀로지 앤드 디벨럽먼트 컴퍼니 리미티드 오더 할당 시스템 및 방법
CN105139228A (zh) * 2015-08-20 2015-12-09 北京嘀嘀无限科技发展有限公司 一种订单分配的方法及装置
CN106557829B (zh) * 2015-09-30 2021-07-27 百度在线网络技术（北京）有限公司 用车业务中获取需求与运力不匹配区域的方法和装置
CN105631731A (zh) * 2015-12-28 2016-06-01 广东顺德中山大学卡内基梅隆大学国际联合研究院 网络租车平台的车辆匹配系统
CN105701567A (zh) * 2016-01-11 2016-06-22 上海雷腾软件股份有限公司 一种网络调度用车的方法与设备
CN107424022B (zh) * 2016-05-23 2022-02-11 北京嘀嘀无限科技发展有限公司 一种订单的推送方法及系统
CN106327064A (zh) * 2016-08-12 2017-01-11 北京东方车云信息技术有限公司 一种服务端的派单方法及系统
CN106447074A (zh) * 2016-12-30 2017-02-22 北京东方车云信息技术有限公司 一种将订单信息推送给司机客户端的方法、装置及系统
CN107203789B (zh) * 2017-06-23 2020-10-02 北京星选科技有限公司 分配模型建立方法、分配方法以及相关装置
CN109754197A (zh) * 2017-11-01 2019-05-14 菜鸟智能物流控股有限公司 一种物流资源属性确定系统及方法
CN108960555B (zh) * 2018-03-23 2021-09-21 浙江仟和网络科技有限公司 一种无分区外卖派单系统的回程单派单方法
CN110832513B (zh) * 2018-04-04 2023-09-19 北京嘀嘀无限科技发展有限公司 用于按需服务的系统和方法
CN108615120B (zh) * 2018-05-09 2021-02-02 厦门卫星定位应用股份有限公司 一种城际车辆排队派单方法及介质
CN110956351B (zh) * 2018-09-27 2022-05-17 北京嘀嘀无限科技发展有限公司 一种订单分配方法及装置、服务器、计算机可读存储介质
CN109636216A (zh) * 2018-12-19 2019-04-16 义乌市腾飞汽车代驾服务有限公司 一种乘客订单的生成方法和装置
CN111612286B (zh) * 2019-02-25 2023-09-29 北京嘀嘀无限科技发展有限公司 一种订单分配方法、装置、电子设备及存储介质
CN110826889A (zh) * 2019-10-29 2020-02-21 上海钧正网络科技有限公司 车辆管理方法、装置、计算机设备和存储介质
CN115412595B (zh) * 2022-09-21 2023-12-05 南京领行科技股份有限公司 一种请求处理方法、装置、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101819716A (zh) * 2010-04-26 2010-09-01 硕伦控股有限公司 用于联系乘客与交通工具的通信系统
CN102426780A (zh) * 2011-11-16 2012-04-25 深圳欧奇网络技术有限公司 一种用于出租车招车的寻呼系统及寻呼方法
US20130218647A1 (en) * 2012-02-21 2013-08-22 Car Pilots Pty Ltd Systems and methods for booking transport
CN104794553A (zh) * 2014-08-12 2015-07-22 北京东方车云信息技术有限公司 网络租车中基于出租车运营区域熟悉程度的派单系统和方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101246643A (zh) * 2007-02-16 2008-08-20 纪明志 交通工具自动分派方法与系统
US20110313804A1 (en) * 2009-12-04 2011-12-22 Garrett Camp System and method for arranging transport amongst parties through use of mobile devices
CN201918011U (zh) * 2010-08-19 2011-08-03 北京千方科技集团有限公司 一种出租车载客策略生成系统和设备
CN103020284A (zh) * 2012-12-28 2013-04-03 刘建勋 一种基于时空聚类的出租车载客点推荐方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101819716A (zh) * 2010-04-26 2010-09-01 硕伦控股有限公司 用于联系乘客与交通工具的通信系统
CN102426780A (zh) * 2011-11-16 2012-04-25 深圳欧奇网络技术有限公司 一种用于出租车招车的寻呼系统及寻呼方法
US20130218647A1 (en) * 2012-02-21 2013-08-22 Car Pilots Pty Ltd Systems and methods for booking transport
CN104794553A (zh) * 2014-08-12 2015-07-22 北京东方车云信息技术有限公司 网络租车中基于出租车运营区域熟悉程度的派单系统和方法

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110119883A (zh) * 2019-04-16 2019-08-13 深圳壹账通智能科技有限公司 一种多平台通信方法、装置、计算机系统及可读存储介质
CN112801495A (zh) * 2021-01-22 2021-05-14 长沙市到家悠享家政服务有限公司 家政服务派单方法及服务端设备
CN112801495B (zh) * 2021-01-22 2024-04-26 长沙市到家悠享家政服务有限公司 家政服务派单方法及服务端设备
CN114266632A (zh) * 2021-12-31 2022-04-01 首约科技(北京)有限公司 一种司机应答策略的保障方法
CN116682254A (zh) * 2023-08-03 2023-09-01 深圳市新乐数码科技有限公司 基于巡游出租车订单和gps数据的司机接单路线规划方法
CN116682254B (zh) * 2023-08-03 2023-10-20 深圳市新乐数码科技有限公司 基于巡游出租车订单和gps数据的司机接单路线规划方法

Also Published As

Publication number Publication date
CN104794553B (zh) 2018-07-10
CN104794553A (zh) 2015-07-22

Similar Documents

Publication Publication Date Title
WO2016023435A1 (fr) Système et procédé de répartition basée sur la familiarité d'une zone de travail de taxis pour la location de taxis en ligne
US11416795B2 (en) Systems and methods for vehicle resource management
WO2016074538A1 (fr) Système et procédé de classement d'ordre envoyé permettant de réduire le fonctionnement sans passager et le temps d'attente dans la location en ligne de taxis
US11386359B2 (en) Systems and methods for managing a vehicle sharing facility
US9805431B2 (en) Systems and methods for allocating networked vehicle resources in priority environments
CN104464274B (zh) 合乘打车方法及服务器
US11392861B2 (en) Systems and methods for managing a vehicle sharing facility
CN107063285A (zh) 同城出行服务实现方法、装置以及系统
WO2016023433A1 (fr) Système et procédé d'estimation du prix d'une course de taxi dans un système de réservation de taxi en ligne
US20070143012A1 (en) System and method of optimizing a fixed-route transit network
US10021243B2 (en) Telephone call placement
CN109087502B (zh) 基于订单分布的车辆调度方法、调度系统、计算机设备
US20200210905A1 (en) Systems and Methods for Managing Networked Vehicle Resources
US9074904B1 (en) Method for solving carpool matching problem and carpool server using the same
US20180075566A1 (en) System and method of calculating a price for a vehicle journey
CN111126799B (zh) 基于二分图的共享网络司乘匹配方法
CN111950777A (zh) 定制公交线路设计方法及装置
CN110009131A (zh) 一种考虑多因素影响的网约车派单方法
CN111832872A (zh) 一种车辆调度方法、装置、电子设备和存储介质
CN111612493B (zh) 一种用户分群方法及装置
CN116777171A (zh) 一种面向网约车的点对点拼车动态调度方法及装置
CN112990360A (zh) 一种基于K-means的网约车载客特征分析方法
CN107292402B (zh) 基于日程预匹配的时间金额约束拼车方法
CN113888272B (zh) 一种基于稳定匹配理论的通勤网约车派单方法
CN114549079A (zh) 一种基于市场拓展的车辆运营方案的生成方法及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15832261

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15832261

Country of ref document: EP

Kind code of ref document: A1