CN111563638A

CN111563638A - Network car booking request processing method and device, server and storage medium

Info

Publication number: CN111563638A
Application number: CN201910113113.5A
Authority: CN
Inventors: 杨宝通
Original assignee: Beijing Didi Infinity Technology and Development Co Ltd
Current assignee: Beijing Didi Infinity Technology and Development Co Ltd
Priority date: 2019-02-13
Filing date: 2019-02-13
Publication date: 2020-08-21

Abstract

The invention provides a method and a device for processing a network car booking request, a server and a storage medium. The method comprises the following steps: receiving a car sharing request from a passenger end, and matching car sharing vehicles for the car sharing request; determining the departure time of the car sharing vehicles and the target number of the car sharing people; if at least one of the departure time and the target carpooling number is reached, determining that a departure condition is reached; and if the departure condition is met, outputting departure prompt information to a driver end corresponding to the carpooling vehicle and a passenger end currently in the boarding state. The method improves the vehicle utilization rate to a certain extent.

Description

Network car booking request processing method and device, server and storage medium

Technical Field

The invention relates to the internet technology, in particular to a method and a device for processing a network car booking request, a server and a storage medium.

Background

With the continuous popularization and development of intelligent traffic and the increasing congestion of urban traffic environment, how to improve the utilization rate of vehicles becomes more critical.

In the prior art, the vehicle can carry more passengers by means of carpooling, so that the vehicle utilization rate is improved. In the existing car sharing mode, car sharing requests are initiated actively aiming at passengers, and the passengers with two single car sharing requests with the same or similar routes are matched into one car sharing vehicle, namely, one car sharing vehicle can be matched to obtain two single car sharing orders.

The existing car pooling scheme is used for car pooling according to the number of orders, when the number of passengers carried in a car pooling request is small, at most half of car seat resources in a car pooling vehicle are wasted, and the utilization rate of the vehicle is low.

Disclosure of Invention

The invention provides a method and a device for processing a network car booking request, a server and a storage medium, which are used for improving the utilization rate of a vehicle to a certain extent.

In a first aspect, the present invention provides a method for processing a vehicle appointment request, including:

receiving a car sharing request from a passenger end, and matching car sharing vehicles for the car sharing request;

determining the departure time of the car sharing vehicles and the target number of the car sharing people;

if at least one of the departure time and the target carpooling number is reached, determining that a departure condition is reached;

and if the departure condition is met, outputting departure prompt information to a driver end corresponding to the carpooling vehicle and a passenger end currently in the boarding state.

In a second aspect, the present invention provides a network appointment request processing apparatus, including:

the matching module is used for receiving a car sharing request from a passenger end and matching car sharing vehicles for the car sharing request;

the determining module is used for determining the departure time of the car sharing vehicles and the target number of the car sharing people;

the first judgment module is used for determining that the departure condition is reached if at least one of the departure time and the target number of the carpools is reached;

and the output module is used for outputting departure prompt information to a driver end corresponding to the carpool vehicle and a passenger end currently in the boarding state if the departure condition is met.

In a third aspect, the present invention provides a server, comprising:

a memory;

a processor; and

a computer program;

wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of any of the first aspects.

In a fourth aspect, the invention provides a computer-readable storage medium having stored thereon a computer program,

the computer program is executed by a processor to implement the method according to any of the first aspect.

According to the technical scheme provided by the invention, the carpooling vehicles are matched through the carpooling request sent by the passenger terminal, so that if at least one factor of the departure time of the carpooling vehicle and the target carpooling number can be reached in the carpooling process, the carpooling vehicle is determined to reach the departure condition, and if the factor is met, the departure is prompted. Therefore, when the number of passengers reaches the target number of car sharing, the car can be dispatched quickly; or if the number of the people getting on the train is insufficient, the departure is prompted when the departure time is reached in view of improving the travel efficiency; therefore, on one hand, the number of the passengers getting on the car sharing vehicle is controlled according to the target number of the car sharing passengers, and the more the target number of the car sharing passengers is, the more the waste of seat resources in the car sharing vehicle can be avoided, and the more the vehicle utilization rate can be improved; on the other hand, the waiting time of the passengers is controlled at the departure time, so that the travel efficiency is improved as much as possible. Therefore, the technical scheme provided by the embodiment of the invention can improve the vehicle utilization rate on the basis of considering the travel efficiency.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure.

Fig. 1 is a schematic flow chart illustrating a method for processing a network taxi appointment request according to an embodiment of the present invention;

fig. 2 is a schematic flow chart illustrating another method for processing a network taxi appointment request according to an embodiment of the present invention;

fig. 3 is a schematic flow chart illustrating another method for processing a network taxi appointment request according to an embodiment of the present invention;

fig. 4 is a schematic view of a page displayed when a passenger terminal executes a network appointment request processing method according to an embodiment of the present invention;

fig. 5 is a schematic diagram of a page displayed when another passenger executes a network appointment request processing method according to an embodiment of the present invention;

fig. 6 is a schematic diagram of a page displayed when another passenger executes a network appointment request processing method according to an embodiment of the present invention;

fig. 7 is a schematic view of a page display when a driver executes a network appointment request processing method according to an embodiment of the present invention;

fig. 8 is a schematic view of a page display when another driver end executes a network appointment request processing method according to an embodiment of the present invention;

fig. 9 is a schematic view of a page display when another driver end executes a network appointment request processing method according to an embodiment of the present invention;

fig. 10 is a schematic view of a page displayed when another driver executes a network taxi appointment request processing method according to an embodiment of the present invention;

fig. 11 is a schematic view of a page display when another driver end executes a network appointment request processing method according to an embodiment of the present invention;

fig. 12 is a schematic view of a page displayed when another driver executes a network appointment request processing method according to another embodiment of the present invention;

fig. 13 is a functional block diagram of a network appointment request processing device according to an embodiment of the present invention;

fig. 14 is a schematic entity structure diagram of a server according to an embodiment of the present invention.

With the foregoing drawings in mind, certain embodiments of the disclosure have been shown and described in more detail below. These drawings and written description are not intended to limit the scope of the disclosed concepts in any way, but rather to illustrate the concepts of the disclosure to those skilled in the art by reference to specific embodiments.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.

The terms to which the present invention relates will be explained first:

carpooling: the method is a riding mode that at least two orders with the same or similar routes are matched into the same car sharing vehicle, and passengers are conveyed to the destination by the car sharing vehicle.

A passenger end; the system is an application program for taxi taking on a passenger side line, and is mainly used for inputting travel information and sending out a taxi taking request, and sending out passenger instructions, such as canceling orders, changing places, confirming information and the like.

A driver end: the system is an application program for taxi taking on a driver side line, and is mainly used for receiving a menu of a system or sending a request to a menu server to realize the menu.

Car sharing residual force: the car sharing method is characterized in that the car sharing vehicle still has the capacity of continuing car sharing on the premise of finishing the current car sharing task, and can be embodied in the way that one or more vehicle seats can be used for car sharing.

The terminal equipment related to the invention can be a wireless terminal or a wired terminal. A wireless terminal may refer to a device that provides voice and/or other traffic data connectivity to a user, a handheld device having wireless connection capability, or other processing device connected to a wireless modem. A wireless terminal, which may be a mobile terminal such as a mobile telephone (or "cellular" telephone) and a computer having a mobile terminal, for example, a portable, pocket, hand-held, computer-included, or vehicle-mounted mobile device, may communicate with one or more core Network devices via a Radio Access Network (RAN), and may exchange language and/or data with the RAN. For another example, the Wireless terminal may also be a Personal Communication Service (PCS) phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), and other devices. A wireless Terminal may also be referred to as a system, a Subscriber Unit (Subscriber Unit), a Subscriber Station (Subscriber Station), a Mobile Station (Mobile), a Remote Station (Remote Station), a Remote Terminal (Remote Terminal), an Access Terminal (Access Terminal), a User Terminal (User Terminal), a User agent (User agent), and a User Device or User Equipment, which are not limited herein. Optionally, the terminal device may also be a smart watch, a tablet computer, or the like.

Aiming at the problem of low vehicle utilization rate of the existing car pooling method, the network car booking request processing method provided by the invention aims to solve the technical problems in the prior art and provides the following solving ideas: the method aims at the carpooling vehicles in the carpooling order, the departure of the carpooling vehicles is limited from the aspect of the target carpooling number and the departure time, so that the carpooling vehicles can only be departed when the target carpooling number is reached and/or the departure time is reached, and thus, on the basis of not influencing the travel efficiency as much as possible, the waste of saddle resources is avoided as much as possible, and the vehicle utilization rate is improved.

The following describes the technical solutions of the present invention and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present invention will be described below with reference to the accompanying drawings.

Example one

The embodiment of the invention provides a method for processing a network taxi appointment request. Referring to fig. 1, the method includes the following steps:

s102, receiving a car sharing request from a passenger end, and matching car sharing vehicles for the car sharing request.

And S104, determining the departure time of the carpooling vehicle and the target carpooling number.

In consideration of the implementation scenario of car sharing, the car sharing system specifically includes at least two passengers initiating car sharing requests, and therefore the target number x of car sharing people is in the range of [2, M-1], where M is the total seat number in the car sharing vehicle. For example, when a conventional 5-seat taxi is used as a car pool car, the number of target car pool persons may be [2,4 ].

And S106, determining that the departure condition is reached if at least one of the departure time and the target carpooling number is reached.

And S108, if the departure condition is met, outputting departure prompt information to a driver end corresponding to the carpooling vehicle and a passenger end currently in the boarding state.

The following describes a specific implementation of each of the above steps.

In a car pooling implementation scenario, one car pooling request can generate one passenger-side order, and in the car pooling scenario, one driver-side order can correspond to at least two passenger-side orders.

When the step S102 is implemented, matching is mainly performed on the car pool vehicles according to the travel information carried in the car pool request. The travel information related to the embodiment of the invention at least comprises: getting-on position, getting-off position, departure time and number of passengers. In addition, at least one of the following information can be included in the carpool request, but not limited to: the passenger side identification information and other remark information, such as invoice information, piggyback information, etc., for uniquely determining a passenger are not particularly limited in the embodiments of the present invention.

The matching method may include, but is not limited to: an order mode or a menu mode. The order assigning mode is that the car sharing order is assigned to a car sharing vehicle within a preset range according to the getting-on position in the travel information. The menu mode is a mode of sending the car sharing request order to a menu hall, and enabling a driver to freely select the order, so that the car sharing request is matched with the car sharing vehicle through free order grabbing of the driver.

In addition, in the embodiment of the invention, the matching of the car sharing vehicles is executed aiming at any passenger end. In a specific matching scenario, the passenger side may be preferentially matched with an empty car (an empty car capable of undertaking a car sharing task is not matched with other passengers temporarily), or the passenger side may be preferentially matched with a car sharing that is matched with other passengers but is not full and does not reach a departure condition. In addition, the matching result of the matching process is not particularly limited in the embodiment of the present invention, and the matched vehicle matched in this step may be an empty vehicle, or a car pool matched with other passengers but not full or not meeting the departure condition.

In terms of departure conditions, the technical scheme provided by the embodiment of the invention relates to the following two aspects:

in one aspect, the number of passengers of the carpool vehicle is controlled by the target carpooling number. Therefore, in concrete implementation, the target number of carpools can be set as high as possible so as to improve the utilization rate of the saddle resources as much as possible.

In one implementation scenario, the target car sharing number may be configured in advance. The configuration mode can include but is not limited to the following modes: the target car pool number of all driver-side orders is configured to be x, for example, considering that the number of passengers when a car pool request is initiated by passengers is generally 1-2, the target car pool number can be configured to be 3. In addition, or, the driver terminals are classified according to preset rules, for example, different x values are respectively set for various driver terminals according to the favorable rating of the driver terminals and the like; or classifying the driver-side orders according to another preset rule, for example, classifying the driver-side orders according to the longest route length between the starting point and the ending point in the orders, and setting different x values for various driver-side orders respectively. In particular, other embodiments are possible, which are not listed here.

In another implementation scenario, the target car pool size may be determined based on instructions from the driver side and/or the passenger side. For example, the target car sharing number can be carried in a car sharing request initiated by a passenger end; or, for another example, the target car sharing number may be the number of people that the driver initiates and sets to be carried by the host vehicle.

Alternatively, in another implementation scenario, the target car pool number may be self-configured according to current traffic conditions. For example, in consideration of the traffic conditions in the hot areas such as airports during the hot hours, the target car pool number in the hot areas during the hot hours may be determined to be a high value, whereas the target car pool number in the normal uncongested routes in the general areas may be determined to be a low value.

In addition, the passenger terminal in the "boarding state" referred to in the embodiment of the present invention refers to a client terminal of a passenger who has converged with the car pool vehicle and is in a departure waiting state. Specifically, whether the riding state of the passenger end is the "getting-on state" or not can be realized by identifying or processing the riding state of the passenger by the passenger end and/or the driver end. The passenger riding state identification means that the riding state of the passenger end is identified by the driver and/or the passenger, and the identification can be recorded in real time. Alternatively, the confirmation of the passenger getting on the vehicle can be realized by receiving a notification message sent by the passenger side and/or the driver side and indicating that the passenger side has got on the vehicle.

Therefore, when the number of the passengers who get on the bus (namely the number of the passengers who get on the bus at present) reaches the target number of the carpools, the departure condition can be met.

On the other hand, the waiting time of the passengers is limited by the departure time, so that the situation that the passengers cannot go out due to long-term waiting for car sharing of other people is avoided, and the traveling efficiency of the passengers is improved.

In the embodiment of the present invention, the determining the departure time of the car pool vehicle may include the following steps:

acquiring the initiation moment of the carpooling request when the carpooling vehicle is successfully matched for the first time;

and acquiring the sum of the initiation time and a preset waiting time to obtain the departure time of the carpooling vehicle.

This is based on the fact that the passenger is determined on the basis of the longest waiting time for the passenger to initiate the carpool request for which the first matching is successful. At this time, the departure time of the carpool vehicle is the same as the departure time of the passengers getting on the bus at each head station. In addition, the waiting time of the passenger who initiates the carpooling request successfully matched for the first time is also the time period from the current time to the departure time; and the waiting time of other passengers matched with the carpooling vehicle is the time period from the matching success time to the departure time.

In addition, there is also a case of a half-way car pool for passengers, that is, when a certain passenger gets on the car at a point in the middle of the traveling route of another passenger, which is not the starting point of the first departure of the route, the getting-on time of the passenger on the half-way differs from the departure time of the car pool, and the getting-on time is: the departure time and the time of the sum of the consumed time of the intermediate distance. The intermediate distance is a distance between the departure starting point and the intermediate boarding point, and the duration of the intermediate distance is generally an estimated value and depends on uncertain factors such as road conditions, weather conditions and the like.

For example, if the preset waiting time is 25min, the initiation time of the car sharing request (initiated by the passenger a) with the car sharing vehicle successfully matched for the first time is 12:00, the passenger a and the passenger B get on at the same starting station 1, the passenger C gets on at the intermediate station 2, and the estimated time consumed by the starting station 1 and the intermediate station 2 is 10 min. Then, the departure time of the passenger A and the passenger B is the same as the departure time of the carpooling vehicle, and both are 12: 25; and, the waiting time of the passenger a is 25 min; when the passenger B is successfully matched with the carpooling vehicle in the ratio of 12:05, the waiting time of the passenger B is 20 min; passenger C at 12: and 20, successfully matching with the carpooling vehicle, wherein the departure time is 12:35, and the waiting time is 15 min.

Based on the above manner, the departure time and the target number of the carpools of the carpooling vehicle can be determined, and based on this, when the step S106 is executed, referring to fig. 2, the method specifically includes the following steps:

S1062A, determines whether the current time reaches the departure time. If yes, go to S1064; if not, go to S110.

And the number of the first and second groups,

and S1062B, judging whether the current number of the carpooling vehicles is equal to the target number of the carpooling vehicles. If yes, go to S1064; if not, go to S110.

When this step is implemented, the current number of people getting on the car sharing vehicle needs to be determined.

In a particular determination of the number of persons currently boarding the vehicle, driver-side and/or passenger-side feedback may be used. For example, if receiving the prompt information of confirming the getting-on of a certain passenger from the driver, the current number of the people getting-on of the carpool vehicle is added with N, where N is the number of the passengers carried by the passenger when the carpool request is initiated. Or, in another specific process of determining the current number of people getting on the car, the determination may be performed according to geographic locations of the driver end and the passenger end, and if the geographic locations of the driver end and the passenger end are completely the same, it is determined that the passenger has got on the car, and then the current number of people getting on the car of the car sharing vehicle is added with N.

In the embodiment of the present invention, the execution order of S1062A and S1062B is not particularly limited, and they may be executed in parallel or may be executed alternately.

Thus, there are two results:

and S1064, determining that the departure condition is reached.

That is, if the current time reaches the departure time, and/or if the number of people on the carpool vehicle is greater than or equal to the target number of carpools currently, it is determined that the departure condition is reached.

At this time, S108 is sequentially executed, that is, the departure flow is entered.

On the contrary, the method can be used for carrying out the following steps,

and S110, if the current time does not reach the departure time, and if the current number of the passengers getting on the car sharing vehicle is less than the target number of the passengers, determining that the departure condition is not reached.

At this time, the process returns to the determinations in S1062A and S1062B until the determination result goes to S1064, and the process ends.

In addition, in order to further achieve the purpose of controlling departure, blocking prompt information can be output to the driver end when the departure condition is not met, and the blocking prompt information is used for preventing the carpool vehicle from departing.

Referring to fig. 3, the method may further include the following steps:

and S1061, outputting blocking prompt information to the driver end.

In this implementation scenario, if the determination results of S1062A and S1062B are both negative, the process proceeds to S110 to determine that the departure condition is not met, and then returns to S1061 to continuously output the blocking prompt message. And (4) entering S1064 until at least one of the judgment results of S1062A and S1062B is yes, stopping outputting the blocking prompt information, and executing the departure prompt step in S108.

For convenience of understanding, the embodiment of the present invention provides a specific implementation manner for outputting blocking prompt information: and outputting countdown information from the current time to the departure time until the departure condition is reached. Wherein, in the process of outputting the countdown information, the driver end cannot normally send the vehicle.

In addition, in another implementation scenario, considering that the car sharing vehicle can still participate in matching passengers in the waiting process before reaching the departure condition so as to improve the vehicle utilization rate, the method further comprises the following steps:

when the departure condition is not met, judging whether the car sharing vehicle has car sharing remaining power;

if the car sharing vehicle has the car sharing residual force, detecting whether other car sharing requests matched with the car sharing vehicle exist or not;

and if the other car sharing requests matched with the car sharing vehicles are detected, outputting car sharing success prompt information to the driver end and the passenger end initiating the other car sharing requests.

The implementation manner of judging whether a certain car sharing vehicle has car sharing remaining power can be as follows:

acquiring the total number of passengers at the passenger end matched with the car sharing vehicle;

judging whether the total number of passengers is smaller than the target car sharing number;

if the total number of the passengers is smaller than the target car sharing number, determining that the car sharing vehicle has the car sharing remaining power; or if the total number of the passengers is equal to the target car sharing number, determining that the car sharing vehicle does not have the car sharing residual force.

That is, if the car pool vehicle does not have car pool remaining power, it indicates that the car pool vehicle is full of the car seat, and the vehicle utilization rate of the car pool vehicle reaches the highest value in the trip, and does not participate in the process of matching passengers.

Or if the car sharing vehicle still has the car sharing capacity but does not detect other car sharing requests matched with the car sharing vehicle, continuing to execute the detection step until the departure condition is reached.

In the process, in order to stimulate the driver end to participate in passenger matching, the following method can be further included:

not reach the condition of dispatching a car just the car pooling vehicle possesses when the car pooling complementary power, the output waits for reward information extremely the driver end that the car pooling vehicle corresponds, it is used for the suggestion to wait for reward information the driver end increases to wait for a long time in order to improve the success rate of sharing a car once more.

Wherein, waiting for the reward information can be pre-configured, and the reward mode thereof includes but is not limited to: the present invention is not limited to this, and the vehicle money reward, the credit reward or other mode reward may be used.

In addition, the embodiment of the invention also considers an extreme case: and if the departure condition is met and the non-boarding passenger end exists, outputting a carpooling failure prompt message to the non-boarding passenger end. This can avoid not getting on the bus the condition that passenger end blindly arrived the place of departure and take place to, to special circumstances, like the delay getting on the bus that weather reason caused, still can carry out the compensatory action for this passenger end, no longer give consideration to repeatedly.

For convenience of understanding, the following briefly describes a method for processing a network appointment request executed by each of the driver side and the passenger side, with reference to page display diagrams shown in fig. 4 to 12.

Fig. 4 to 6 show schematic views of display interfaces of the passenger side.

First, when a passenger wants to initiate an express request, the passenger terminal may output a display interface as shown in fig. 4 on the passenger terminal after the passenger inputs a start point and an end point, since the start point of the order is an airport and belongs to a hot area, that is, an entrance of "airport sharing" is provided in addition to displaying a normal express interface. In the interface shown in fig. 4, the airport carpooling entrance can be preferentially defaulted, and the carpooling scene of the hot area, such as airport carpooling, can have higher preferential car resources, for example, the car resources are shown in a price-one manner. In addition, as shown in fig. 4, in the default scenario of airport carpooling, the latest departure time of the airport carpooling order and the target number of carpooling people N can be further output. Wherein figure 4 defaults to 1 passenger, i.e. occupies one seat by default.

If the passenger selects and confirms the airport carpooling, an interface as shown in fig. 5 is output, and the passenger selects the number of seats required by the passenger on the interface. In a specific implementation, the seat number required by the user can be determined by sliding selection in the interface in the manner shown in fig. 5. If the passenger chooses to cancel, the passenger takes the bus by default for 1 shown in FIG. 4; and if the passenger selects and clicks to confirm, taking the bus according to the number of the passengers. The number of passengers is equivalent to the number of seats occupied by the carpool order in the carpool vehicle.

If the passenger clicks the confirmation in fig. 5, the passenger end may output a display interface as shown in fig. 6, that is, the display interface includes: the latest departure time information of the car sharing vehicles (namely the departure time in the embodiment of the invention) and the prompt information that N persons can depart in advance (N is the target number of the car sharing persons in the embodiment of the invention). Thus, if the passenger clicks the confirmation call, the passenger end sends the car pooling order to a server (a device for executing the car booking request processing method in the embodiment of the invention).

In contrast, the server (the apparatus for executing the network car booking request processing method in the embodiment of the present invention) executes the network car booking request processing method according to any one of the above implementations.

At this time, fig. 7 to 12 show display interface diagrams of the driver side.

As shown in fig. 7, if the driver end currently matched and the passenger end are already in the boarding state, the driver end can continue to wait before reaching the departure time, and can directly confirm and start the journey. As shown in fig. 8, during the period when the driver end waits for the car-sharing passenger, a prompt message is output on the interface: airport environments are complex, waiting to 09: the vehicle can be dispatched 55, and X yuan is awarded when 1 person is pieced together in the waiting period. This can improve the car pooling willingness of the driver end. In addition, a click entrance for directly starting the journey is provided for the driver end, so that the driver end can directly start the journey.

In addition, if the driver end clicks the confirmation and starts the travel button in the case where the departure time is not reached and N persons are not fully present, the driver end can output the blocking prompt information as shown in fig. 9. The blocking prompt message is presented in a countdown mode and is used for indicating the time difference from the current time to the departure time. In addition, the carpooling reward information can also be output on the interface. If the driver clicks on me, then the display interface shown in FIG. 7 is returned.

On the contrary, if the driver does not perform other processing, the display interface shown in fig. 10 may be output when the count-down is 0.

At this time, the device executing the network taxi appointment request processing method determines that the departure time has been reached, and executes a departure prompt process for the device, during which a display interface as shown in fig. 10 may be presented, that is, status display information in loading is displayed.

After the loading is completed, or when the countdown is 0 in fig. 9, a display interface as shown in fig. 11 may be displayed at the driver's end, that is, the driver is prompted to arrive at the departure time and to depart from the driver's end.

At this time, the driver clicks me to know, and further outputs a display interface shown in fig. 12, in which the passenger of the tail number ABCD is in the on-board state, and whether the passenger of the tail number BCDA is on the board is selected and determined by the driver, and if the passenger is on the board, the driver end-point clicks a confirmation on-board button, and clicks a confirmation and starts a trip, and the vehicle can be dispatched. In addition, the driver can also get in touch with the tail number BCDA through the telephone of the passenger, and the boarding information can be confirmed in real time. The driver clicks the confirmation at the driver end point and starts the journey, and then the vehicle can be dispatched.

The technical scheme provided by the embodiment of the invention at least has the following technical effects:

Example two

Based on the method for processing the network taxi appointment request provided by the first embodiment, the embodiment of the invention further provides an embodiment of a device for realizing the steps and the method in the embodiment of the method.

An embodiment of the present invention provides a network car booking request processing apparatus, please refer to fig. 13, where the network car booking request processing apparatus 400 includes:

a matching module 41, configured to receive a car pooling request from a passenger end, and match a car pooling vehicle for the car pooling request;

the determining module 42 is used for determining the departure time of the car pooling vehicle and the target number of the car pooling persons;

a first judging module 43, configured to determine that a departure condition is reached if at least one of the departure time and the target number of car pooling persons is reached;

and the output module 44 is used for outputting departure prompt information to a driver end corresponding to the carpooling vehicle and a passenger end currently in the boarding state if the departure condition is met.

The first determining module 43 is specifically configured to:

judging whether the current time reaches the departure time or not, and judging whether the current number of passengers getting on the car sharing vehicle is equal to the target number of passengers sharing the car;

and if the current time reaches the departure time and/or if the number of the current boarding persons of the car sharing vehicles is more than or equal to the target number of the car sharing persons, determining that the departure condition is reached.

In this embodiment of the present invention, the output module 44 is further configured to:

and when the departure condition is not met, outputting blocking prompt information to a driver end, wherein the blocking prompt information is used for preventing the carpooling vehicle from departing.

In an implementation scenario, the output module 44 is specifically configured to:

and outputting countdown information from the current time to the departure time until the departure condition is reached.

In addition, the apparatus 400 further comprises:

a second judging module (not shown in fig. 13) for judging whether the carpool vehicle has the carpool remaining power or not when the departure condition is not reached;

a detection module (not shown in fig. 13) for detecting whether there are other car sharing requests matched with the car sharing vehicle if the car sharing vehicle has car sharing remaining power;

the output module 44 is further configured to output a carpooling success prompt message to the driver side and the passenger side initiating the other carpooling request if other carpooling requests matched with the carpooling vehicle are detected.

The second judging module is specifically configured to:

acquiring the total number of passengers at a passenger end matched with a car sharing vehicle;

judging whether the total number of passengers is less than the target car sharing number;

if the total number of the passengers is less than the target car sharing number, determining that the car sharing vehicle has car sharing remaining power; or if the total number of the passengers is equal to the target car sharing number, determining that the car sharing vehicle does not have car sharing remaining power.

In another specific implementation scenario, the output module 44 is further configured to:

when the taxi sharing condition is not met and the taxi sharing vehicle has the taxi sharing remaining power, outputting waiting reward information to a driver end corresponding to the taxi sharing vehicle, wherein the waiting reward information is used for prompting the driver end to increase the waiting time so as to improve the success rate of taxi sharing again.

Furthermore, the output module 44 is further configured to:

and when the departure condition is met and the non-boarding passenger end exists, outputting a carpooling failure prompt message to the non-boarding passenger end.

In the embodiment of the present invention, the determining module 42 is specifically configured to:

acquiring the initiation moment of a carpooling request when the carpooling vehicles are successfully matched for the first time;

and acquiring the sum of the initiation time and the preset waiting time to obtain the departure time of the car pooling vehicle.

Also, an embodiment of the present invention provides a server, please refer to fig. 14, where the server 500 includes:

a memory 510;

a processor 520; and

a computer program;

wherein the computer program is stored in the memory 510 and configured to be executed by the processor 520 to implement the methods as described in the above embodiments.

In addition, as shown in fig. 5, a transmitter 530 and a receiver 540 are further disposed in the server 500 for data transmission or communication with other devices, which is not described herein again.

Furthermore, an embodiment of the present invention provides a readable storage medium, on which a computer program is stored,

the computer program is executed by a processor to implement the method according to the first embodiment.

Since each module in this embodiment can execute the method shown in the first embodiment, reference may be made to the related description of the first embodiment for a part of this embodiment that is not described in detail.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A network taxi appointment request processing method is characterized by comprising the following steps:

2. The method of claim 1, wherein determining that the departure condition is met if at least one of the departure time and the target car pool number is met comprises:

and if the current time reaches the departure time and/or if the number of current boarding persons of the car sharing vehicles is more than or equal to the target number of car sharing persons, determining that the departure condition is reached.

3. The method according to claim 1 or 2, characterized in that the method further comprises:

and when the departure condition is not met, outputting blocking prompt information to the driver end, wherein the blocking prompt information is used for preventing the carpooling vehicle from departing.

4. The method of claim 3, wherein outputting the blocking prompt comprises:

outputting countdown information from the current time to the departure time to the driver end until the departure condition is reached; and in the process of outputting the countdown information by the driver end, the driver end cannot send the vehicle in advance.

5. The method according to claim 1 or 2, characterized in that the method further comprises:

6. The method of claim 5, wherein the determining whether the ride share vehicle has a ride share capacity comprises:

7. The method of claim 5, further comprising:

8. The method according to claim 1 or 2, characterized in that the method further comprises:

and when the departure condition is met and a passenger end which does not get on the bus exists, outputting a carpooling failure prompt message to the passenger end which does not get on the bus.

9. The method according to claim 1 or 2, wherein the determining the departure time of the ride share vehicle comprises:

10. A network reservation request processing device, comprising:

11. The apparatus of claim 10, wherein the first determining module is specifically configured to:

12. The apparatus of claim 10 or 11, wherein the output module is further configured to:

13. The apparatus of claim 12, wherein the output module is specifically configured to:

14. The apparatus of claim 10 or 11, further comprising:

the second judgment module is used for judging whether the car pooling vehicle has car pooling remaining capacity or not when the car pooling condition is not met;

the detection module is used for detecting whether other car sharing requests matched with the car sharing vehicle exist or not if the car sharing vehicle has the car sharing remaining power;

the output module is further used for outputting a carpooling success prompt message to the driver end and a passenger end initiating the other carpooling requests if the other carpooling requests matched with the carpooling vehicles are detected.

15. The apparatus of claim 14, wherein the second determining module is specifically configured to:

16. The apparatus of claim 14, wherein the output module is further configured to:

17. The apparatus of claim 10 or 11, wherein the output module is further configured to:

18. The apparatus according to claim 10 or 11, wherein the determining module is specifically configured to:

19. A server, comprising:

a memory;

a processor; and

a computer program;

wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of any of claims 1 to 9.

20. A computer-readable storage medium, having stored thereon a computer program,

the computer program is executed by a processor to implement the method of any one of claims 1 to 9.