WO2016023435A1

WO2016023435A1 - Taxi operating area familiarity-based dispatching system and method in online taxi hiring

Info

Publication number: WO2016023435A1
Application number: PCT/CN2015/086090
Authority: WO
Inventors: 汤鹏; 王柏
Original assignee: 北京东方车云信息技术有限公司
Priority date: 2014-08-12
Filing date: 2015-08-05
Publication date: 2016-02-18
Also published as: CN104794553A; CN104794553B

Abstract

Taxi operating area familiarity-based dispatching system and method in online taxi hiring. The system comprises an onboard terminal, a passenger client, and a dispatch-implementing server. The passenger client transmits to the server a taxi hiring request message, where the message comprises an origin address and a destination address of a passenger; the server receives the taxi hiring request message coming from the passenger client and determines, on the basis of the origin address and the destination address in the request message, a degree of match between an operating area of the request and an operating area with which a taxi is familiar; then, the server sorts taxis by utilizing the degree of match and considering other related information and filters out at least one taxi according to the sorted order; then, the server generates from the taxi hiring request message a dispatch message and pushes same to an onboard terminal of the at least one taxi filtered out; and, the onboard terminal receives the dispatch message and determines whether or not to accept the dispatch on the basis of operating conditions.

Description

System and method for dispatching a car based on the familiarity of the taxi operating area in the network rental car

Technical field

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.

Background technique

In the current densely populated cities, due to the complexity of traffic conditions, the following situations often occur: a large number of taxis are continually searching for passengers who need to take a taxi. On the other hand, passengers with taxi needs are difficult to get near the starting point. Waiting for the empty vehicles, the asymmetry of the taxi information has caused the problem of difficult city taxis, and also wastes limited public resources, energy resources and time resources of passengers and taxi drivers. In order to solve this problem, it is constantly Many applications based on handheld smart terminals have emerged, such as taxi software. These taxi software are installed on the passenger's handheld smart terminal (hereinafter referred to as the passenger client). The process of providing taxi service is as follows:

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. 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.

However, in the above-mentioned taxi trading process, whether the taxi driver is familiar with the starting and destination addresses of the taxi has a great relationship with the quality of the operation. On the one hand, the taxi driver often prefers the familiar operating area, which can reduce the unfamiliarity of the search. The energy consumption and time wasted by the location. On the other hand, if you are familiar with the driver who is familiar with the operation area, it can bring a lot of convenience to the passengers, thus improving the passenger satisfaction.

Summary of the invention

In view of the above-mentioned need for a taxi driver to be familiar with the operation area of the waybill, on the one hand, 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.

Preferably, in the above-mentioned dispatching system, 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 higher the frequency, the higher the familiar level.

Preferably, in the above-mentioned dispatching system, 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 higher the familiarity level of the area, the higher the matching degree.

Preferably, in the above dispatching system, for the taxi request, the server comprehensively considers the matching degree of the taxi request with the taxi operating area and other related factors to sort the taxis, and the higher the matching degree, the higher the ranking. Moreover, the server sorts out the top N taxis to push the dispatch message according to the sorting, wherein N>=1.

Preferably, in the above-described dispatch system, the server clusters historical data of taxi operations to determine their familiarity with different operating regions.

Preferably, in the above-mentioned dispatching system, 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.

In another aspect, 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.

Preferably, in the above-mentioned dispatch method, 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.

Preferably, in the above-described dispatch method, 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.

Preferably, in the above-mentioned dispatching method, 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 above system and method for ordering a car brings the following technical effects: 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.

DRAWINGS

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.

detailed description

The dispatching ordering system and method based on the taxi operating area in the network rental car will be described below with reference to the accompanying drawings.

Referring to FIG. 1, in accordance with an embodiment of the present invention, the dispatch ordering system includes the following components:

A plurality of passenger clients 1, 1', a plurality of in-

vehicle terminals

2, 2', 2", and a server 3 that implements a dispatch.

The passenger client 1 sends a taxi request message to the server 3, where the message includes a start address and a destination address.

For example, 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;

In one embodiment, 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.

Referring to FIG. 2, specifically, in one embodiment, 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.

For example, in FIG. 2, 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:

	1-A1-A	4-D4-D	1-D1-D	3-A3-A
	1-A1-A	4-D4-D	1-D1-D	3-A3-A	C1C1	不熟悉(1)Unfamiliar (1)	不熟悉(0)Unfamiliar (0)	熟悉(5)Familiar with (5)	熟悉(7)Familiar with (7)
C1’C1’	熟悉(7)Familiar with (7)	熟悉(7)Familiar with (7)	不熟悉(1)Unfamiliar (1)	不熟悉(0)Unfamiliar (0)	C1C1	不熟悉(1)Unfamiliar (1)	不熟悉(0)Unfamiliar (0)	熟悉(5)Familiar with (5)	熟悉(7)Familiar with (7)
C1’C1’	熟悉(7)Familiar with (7)	熟悉(7)Familiar with (7)	不熟悉(1)Unfamiliar (1)	不熟悉(0)Unfamiliar (0)	C1”C1"	不熟悉(0)Unfamiliar (0)	不熟悉(0)Unfamiliar (0)	不熟悉(0)Unfamiliar (0)	不熟悉(1)Unfamiliar (1)

When calculating the matching degree between the dispatch order and the taxi, 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.

According to the familiarity level given in the above embodiment, and the area where the starting destination address of the taxi request D1, D1' is located, 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

It can be calculated that the matching degrees of the taxis C1, C1', C1" and the taxi requests D1, D1' are:

	D1D1	D2D2
	D1D1	D2D2	C1C1	00	22
C1’C1’	22	00	C1C1	00	22
C1’C1’	22	00	C1”C1"	00	00

Thus, for the dispatch with D1, the taxis are sorted as C1', C1, C1"; according to the sort, D1 should be dispatched to the taxi C1';

Similarly, for a dispatch with D2, the taxis are sorted as C1, C1', C1"; according to this sort, D2 should be dispatched to taxi C1.

Referring to FIG. 3, in another embodiment, 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.

For the sake of simplicity, only two familiar levels are divided, and the starting or destination address is recorded as 1 in the familiar area, and 0 is not in the familiar area, but it should be understood that more Add a number of familiar familiar levels, for example, divide the operating area into 0-4 total familiar levels according to the familiarity, and record the matching values in the different familiar levels respectively to 0, 1, 2, 3, 4.

By examining the relationship between the starting destination address of D1 and D1' and the familiar area of each taxi, the matching degree between the dispatch order and the taxi can be calculated as follows:

It can be calculated that the degree of matching between D1, D1' and each taxi is:

Thus, for the dispatch with D1, 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';

Similarly, for the dispatch with D2, the taxis are sorted as C1, C1', C1"; according to the sort, the server 3 filters out the taxi C1 and dispatches D2 to the taxi C1.

Moreover, in another embodiment, 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.

As shown in FIG. 4, 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;

S1002: 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.

And in order to calculate the matching degree in step S1002, the server performs the following steps before the above steps are performed:

As described above, according to the historical operation data of the taxi, 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.

Moreover, in another embodiment, as described above, the above steps may use a clustering method to perform division of different familiar level operating areas.

In the above step S1002, 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.

The present invention has been described in connection with the specific embodiments thereof, and the present invention is described with reference to the accompanying drawings. The scope of the present invention is defined by the claims, and modifications and combinations of equivalents to those skilled in the art are intended to be included within the scope of the invention.

Claims

A dispatching system based on the familiarity of a taxi operating area in a network rental car, the system comprising an in-vehicle terminal, a passenger client, and a server implementing a dispatch, 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 dispatch system according to claim 1, wherein the server divides the operating area of the taxi into different familiar operating areas according to the historical operating data of the taxi according to the frequency of operation of the taxi in a certain area. The higher the frequency of operations in a certain area, the higher the familiarity level.
The dispatch system according to claim 2, wherein said server determines the matching degree of the taxi request with the taxi operating area based on the familiarity level of the taxi in the area where the start address and the destination address are located, starting The higher the familiarity level of the area where the address and destination address are located, the higher the matching degree.
The dispatch system according to claim 3, wherein for the taxi request, the server comprehensively considers the matching degree of the taxi request with the taxi operating area and other related factors to sort the taxi, and the matching degree is higher. The higher the ranking, and the server sorts out the top N taxis to push the dispatch message according to the sorting, where N>=1.
The dispatch system of claim 2 wherein said server clusters historical data of taxi operations to determine their level of familiarity with different operational areas.
The dispatch system according to claim 1, wherein 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.
A method for dispatching a system using the system of claim 1, comprising the steps of:

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 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 method of dispatching a ticket according to claim 7, wherein 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 method of dispatching a bill according to claim 8, wherein the clustering method is used in the step of determining the familiarity level of the region to perform division of the different familiar level operating regions.
The method according to claim 8, wherein the server determines the degree of matching 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.