CN114881692A

CN114881692A - Network appointment scheduling method and device, electronic equipment and storage medium

Info

Publication number: CN114881692A
Application number: CN202210481651.1A
Authority: CN
Inventors: 宋燕
Original assignee: Nanjing Leading Technology Co Ltd
Current assignee: Nanjing Leading Technology Co Ltd
Priority date: 2022-05-05
Filing date: 2022-05-05
Publication date: 2022-08-09

Abstract

The application relates to the technical field of intelligent traffic, and discloses a network taxi appointment scheduling method, device, electronic equipment and storage medium, which are used for solving the problem of difficulty in scheduling taxi appointment of a network taxi in a hot area with a very high congestion index under the condition that a driver faces a scheduling suggestion for going to the hot area but is actually not willing to go to the hot area with the very high congestion index. The regional level of the vehicles and passengers is balanced by subsidizing candidate vehicles which have congested road sections and need to be subsidized in the driving route and/or the order route and mobilizing the enthusiasm of the candidate vehicles in the forward hot area.

Description

Network appointment scheduling method and device, electronic equipment and storage medium

Technical Field

The application relates to the technical field of intelligent transportation, in particular to a network taxi appointment scheduling method and device, electronic equipment and a storage medium.

Background

With the development of science and technology, network car booking has become a common travel mode. The travel mode of the network car booking is adopted, and great convenience can be brought to users who do not want to sit on a subway or a bus, do not own private cars or do not drive when going on a business trip.

However, if the system level is not regulated and controlled when the network car is scheduled to travel, the following scenes are easy to occur: for the situation that passengers in a certain hot area have no vehicles for a long time and a plurality of drivers in a certain cold area complain about no order, in the prior art, a plurality of methods for dispatching vehicles from the cold area to the hot area or platform subsidizing methods for improving the order taking rate of the drivers and reducing the subsidizing cost have been described. However, if the destination recommended by the system to be dispatched is a hot area with a very high congestion index, the driver is unwilling to go, and the situation that the driver cancels an order or unwinds to leave the car is easy to happen at the moment, so that the situation that the driver is difficult to take the car in a rush hour is easy to happen.

Disclosure of Invention

The embodiment of the application provides a network taxi appointment scheduling method, device, electronic equipment and storage medium, which are used for solving the problem that a driver is difficult to take a taxi in a hot area with a very high congestion index when facing a scheduling suggestion for going to the hot area but actually does not want to go to a traffic jam area.

In a first aspect, an embodiment of the present application provides a network taxi appointment scheduling method, including:

receiving an order of a passenger;

screening candidate vehicles based on the order;

if the candidate vehicle has a congested road section in the driving receiving route and/or the order route, judging whether to subsidize the candidate vehicle;

and if the candidate vehicle is subsidized, executing subsidization operation aiming at the candidate vehicle.

In one possible embodiment, the determining whether to subsidize the candidate vehicle includes:

acquiring an order streamline of the order and determining the estimated cost of the order;

judging whether the estimated cost is less than a reference value;

if the estimated cost is less than the reference value, determining to subsidize the candidate vehicle;

and if the estimated cost is not less than the reference value, determining not to subsidize the candidate vehicle.

In a possible implementation, the determining whether the estimated cost is less than a reference value includes:

if the passenger does not add the price, the estimated cost is a first cost, the first cost is the order running, and the reference value is a first reference value obtained based on the specified order running; alternatively, the first and second liquid crystal display panels may be,

if the passenger does not make a premium, the estimated cost is a second cost, the second cost is the driver income in the order flow, and the reference value is a second reference value obtained based on the driver income in the appointed order flow; alternatively, the first and second electrodes may be,

if the passenger carries out the pricing, the estimated cost is a third cost, the third cost is the sum of the order flow and the passenger pricing part, and the reference value is a first reference value obtained based on the appointed order flow; alternatively, the first and second electrodes may be,

the estimated cost is a fourth cost if the passenger is billed, the fourth cost is a sum of the driver income in the order flow and the passenger billed portion, and the reference value is a second reference value obtained based on the driver income in the specified order flow.

In one possible implementation, the specified order pipeline is a first historical average pipeline per unit time of the candidate vehicle, and determining the first reference value includes:

multiplying the total time length required from the current position to the completion of the order by the first historical average running water to obtain a first reference value;

alternatively, the first and second electrodes may be,

the specified order flow is a second historical average flow per unit time of all vehicles in the area of the time period in which the order is located, and determining the first reference value comprises:

multiplying the total time length required from the current position to the completion of the order by the second historical average running water to obtain the first reference value;

alternatively, the first and second electrodes may be,

the designated order flow is a first historical average flow per unit time of the candidate vehicle, and determining the second reference value comprises:

obtaining a second reference value by multiplying the average driver income in the first historical average water by the total time from the current position to the completion of the order;

alternatively, the first and second liquid crystal display panels may be,

the specified order flow is a second historical average flow per unit time of all vehicles in the area of the time period in which the order is located, and determining the second reference value comprises:

and multiplying the average driver income in the second historical average water by the total time from the current position to the completion of the order to obtain the second reference value.

In one possible implementation, before the determining whether to subsidize the candidate vehicle, the method further includes:

if the driving receiving route and/or the order route of the candidate vehicle has a congested road section, pushing a pricing request to the passenger;

receiving feedback information of the passenger on the pricing request.

In one possible embodiment, the performing a subsidy operation for the candidate vehicle includes:

determining a difference between the pre-estimated cost and the reference value;

determining the maximum subsidy amount of the platform based on the preset maximum subsidy rate and the maximum subsidy amount;

and if the maximum subsidy amount is larger than or equal to the difference value, subsidizing the candidate vehicle, and performing an order dispatching operation based on the candidate vehicle.

In one possible embodiment, the method further comprises:

and if the maximum subsidy amount is smaller than the difference value, screening the next candidate vehicle, and returning to execute the step of judging whether to subsidy the candidate vehicle if the driving receiving route and/or the order route of the candidate vehicle has a congested road section.

In one possible embodiment, the method further comprises:

and sending a message for subsidizing the candidate vehicle to the candidate vehicle.

In a possible embodiment, the determining the maximum subsidy of the platform based on the preset maximum subsidy rate and the preset maximum subsidy amount includes:

multiplying the highest subsidy rate by the order flow of the order to obtain a first subsidy value;

if the first subsidy value is greater than the highest subsidy amount, taking the highest subsidy amount as the maximum subsidy amount for the candidate vehicle;

and if the first subsidy value is less than or equal to the highest subsidy amount, taking the first subsidy value as the maximum subsidy amount of the candidate vehicle.

In a second aspect, an embodiment of the present application provides a network appointment scheduling device, where the device includes:

the first receiving module is used for receiving orders of passengers;

a screening module for screening candidate vehicles based on the order;

the judging module is used for judging whether to subsidize the candidate vehicle if the candidate vehicle has a congested road section in the pick-up route and/or the order route;

and the subsidizing module is used for executing subsidizing operation aiming at the candidate vehicle if the candidate vehicle is subsidized.

In a possible implementation manner, the determining module is specifically configured to:

judging whether the estimated cost is less than a reference value;

if the passenger does not add the price, the estimated cost is a first cost, the first cost is the order running, and the reference value is a first reference value obtained based on the specified order running; alternatively, the first and second electrodes may be,

In a possible embodiment, the apparatus further comprises:

the designated order flow is a first historical average flow per unit time of the candidate vehicle, and the first determination module is configured to:

alternatively, the first and second electrodes may be,

the specified order flow is a second historical average flow per unit time of all vehicles in an area of a time period in which the order is located, and the first determination module is configured to:

alternatively, the first and second liquid crystal display panels may be,

alternatively, the first and second electrodes may be,

In a possible implementation manner, the determining module is configured to determine whether to patch the candidate vehicle, and the apparatus further includes:

the first sending module is used for pushing a pricing request to the passenger if a jammed road section exists in the pick-up route and/or the order route of the candidate vehicle;

and the second receiving module is used for receiving the feedback information of the passenger on the pricing request.

In a possible embodiment, the apparatus further comprises:

a second determining module for determining a difference between the pre-estimated cost and the reference value;

the second determining module is further configured to determine the maximum subsidy amount of the platform based on a preset maximum subsidy rate and a preset maximum subsidy amount;

the subsidy module is further used for subsiding the candidate vehicle and performing an order dispatching operation based on the candidate vehicle if the maximum subsidy amount is larger than or equal to the difference value.

In a possible implementation manner, the screening module is further configured to screen a next candidate vehicle if the maximum subsidy amount is smaller than the difference, and return to execute the step of determining whether to subsidize the candidate vehicle if a congested road segment exists in a driving receiving route and/or an order route of the candidate vehicle.

In a possible embodiment, the apparatus further comprises:

and the second sending module is used for sending the message for subsidizing the candidate vehicle to the candidate vehicle.

In a possible implementation manner, the first determining module is specifically configured to:

In a third aspect, an embodiment of the present application provides an electronic device, including:

a processor;

a memory for storing the processor-executable instructions;

wherein the processor is configured to execute the instructions to implement any of the network appointment scheduling methods provided in the first aspect above.

In a fourth aspect, embodiments of the present application further provide a computer-readable storage medium, where instructions of the computer-readable storage medium, when executed by a processor of an electronic device, enable the electronic device to perform any one of the network appointment scheduling methods provided in the first aspect.

In a fifth aspect, the present application provides a computer program product, including a computer program, which is executed by a processor to implement any of the network appointment scheduling methods as provided in the first aspect above.

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

the method comprises the steps of receiving orders of passengers; screening candidate vehicles based on the order; if the candidate vehicle has a congested road section in the driving receiving route and/or the order route, judging whether to subsidize the candidate vehicle; if the candidate vehicle is subsidized, a subsidizing operation for the candidate vehicle is performed. Therefore, candidate vehicles which are congested road sections and need to be subsidized in the driving route and/or the order route are subsidized, the enthusiasm of the candidate vehicles in the forward hot area is mobilized, the area levels of the vehicles and passengers are balanced, the controllable subsidy is used, the rejection feeling of drivers of the candidate vehicles to the congested area is reduced, the liveness of the drivers is improved, and the situation that the drivers are difficult to take the vehicles in the hot area with a very high congestion index under the condition that the drivers face scheduling suggestions in the forward hot area but are actually not willing to go to the congested area is relieved.

Additional features and advantages of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the application. The objectives and other advantages of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the embodiments of the present application will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic flow chart of a network taxi appointment scheduling method according to an embodiment of the present disclosure;

fig. 2 is a schematic flowchart of a method for determining whether to subsidize a candidate vehicle according to an embodiment of the present disclosure;

FIG. 3 is a schematic flow chart illustrating a process for executing a subsidy operation for a candidate vehicle according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of a network appointment scheduling device provided in the embodiment of the present application;

fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.

Hereinafter, some terms in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.

(1) In the embodiments of the present application, the term "plurality" means two or more, and other terms are similar thereto.

(2) "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.

(3) A server serving the terminal, the contents of the service such as providing resources to the terminal, storing terminal data; the server corresponds to the application program installed on the terminal and operates in cooperation with the application program on the terminal.

(4) The terminal may refer to an APP (application) of a software class, or may refer to a client. The system is provided with a visual display interface and can interact with a user; is corresponding to the server, and provides local service for the client. For software applications, except some applications that are only run locally, the software applications are generally installed on a common client terminal and need to be run in cooperation with a server terminal. After the internet has developed, more common applications include e-mail clients for e-mail receiving and sending, and instant messaging clients. For such applications, a corresponding server and a corresponding service program are required in the network to provide corresponding services, such as database services, configuration parameter services, and the like, so that a specific communication connection needs to be established between the client terminal and the server terminal to ensure the normal operation of the application program.

Any number of elements in the drawings are by way of example and not by way of limitation, and any nomenclature is used solely for differentiation and not by way of limitation.

In view of this, embodiments of the present application provide a network taxi appointment scheduling method, apparatus, electronic device and storage medium, which are used to solve the problem of how to schedule a network taxi appointment to solve a taxi taking difficulty in a hot area with a very high congestion index when a driver faces a scheduling suggestion for going to the hot area but is not willing to go to a traffic jam area actually.

The invention conception of the invention is as follows: the method comprises the steps of receiving orders of passengers; screening candidate vehicles based on the order; if the candidate vehicle has a congested road section in the driving receiving route and/or the order route, judging whether to subsidize the candidate vehicle; if the candidate vehicle is subsidized, a subsidizing operation for the candidate vehicle is performed. Therefore, candidate vehicles which are congested road sections and need to be subsidized in the driving route and/or the order route are subsidized, the enthusiasm of the candidate vehicles in the forward hot area is mobilized, the area levels of the vehicles and passengers are balanced, the controllable subsidy is used, the rejection feeling of drivers of the candidate vehicles to the congested area is reduced, the liveness of the drivers is improved, and the situation that the drivers are difficult to take the vehicles in the hot area with a very high congestion index under the condition that the drivers face scheduling suggestions in the forward hot area but are actually not willing to go to the congested area is relieved.

The net car of making an appointment of this application embodiment includes at least one in fuel oil car, the gas car, the electric motor car even hydrogen energy source car, and the net car of making an appointment of any energy consumption all is applicable to this application embodiment certainly.

After the inventive concepts of the embodiments of the present application are introduced, in order to further explain the technical solutions provided by the embodiments of the present application, the following detailed descriptions are made in conjunction with the accompanying drawings and the detailed description. Although the embodiments of the present application provide method steps as shown in the following embodiments or figures, more or fewer steps may be included in the method based on conventional or non-inventive efforts. In steps where no necessary causal relationship exists logically, the order of execution of the steps is not limited to that provided by the embodiments of the present application.

Referring to fig. 1, a schematic flow chart of a network appointment scheduling method according to an embodiment of the present application is provided. As shown in fig. 1, the method comprises the steps of:

in step 101, an order for a passenger is received.

In step 102, candidate vehicles are screened based on the order.

The method comprises the steps that vehicles in a vehicle pool are screened at a terminal device background, candidate vehicles suitable for an order are obtained, relevant information of a driving receiving route when the candidate vehicles carry out driving receiving, such as driving receiving time, driving receiving kilometers and congestion indexes of the driving receiving route, relevant information of the order route of the order, such as an order starting position, an order destination, the order kilometers and the congestion indexes of the order route, is obtained, and whether the candidate vehicles need to be subsidized or not is judged according to the relevant information of the driving receiving route when the candidate vehicles carry out driving receiving and the relevant information of the order route of the order. If the related information of the pick-up route shows that the pick-up route of the candidate vehicle has no congestion road section, and the related information of the order route shows that the order route also has no congestion road section, the candidate vehicle can be directly judged not to need to be subsidized. If the driving receiving route and/or the order route of the candidate vehicle has the congested road section, whether the candidate vehicle is subsidized needs to be further judged according to the actual situation, so in step 103, if the driving receiving route and/or the order route of the candidate vehicle has the congested road section, whether the candidate vehicle is subsidized is judged.

In a possible implementation manner, in the embodiment of the present application, determining whether to subsidize a candidate vehicle is specifically implemented as the steps shown in fig. 2:

in step 201, an order pipeline of the order is obtained, and an estimated cost of the order is determined.

The order flow is the estimated income of the order when the passenger does not add the price and the candidate vehicle is not subsidized, and comprises the estimated income of the driver and the estimated income of the platform. The order flow is the amount of money directly determined by the system according to the departure place and the destination of the passenger at the first time, and the amount of money is a fixed value and is not influenced by other conditions. Even if the passenger adds the price or the platform subsidizes the candidate vehicle, the order flow is still unchanged.

In step 202, it is determined whether the estimated cost is less than a reference value.

In step 203, if the estimated cost is less than the reference value, it is determined to subsidize the candidate vehicle.

In step 204, if the estimated cost is not less than the reference value, it is determined not to subsidize the candidate vehicle.

Thus, the estimated cost of the order may be used to compare with a reference value to determine whether to subsidize the candidate vehicle.

In a possible implementation manner, the estimated cost needs to be compared with a reference value to determine whether to subsidize the candidate vehicle, so in order to obtain the estimated cost of the order in the embodiment of the present application, after receiving the passenger order, the order system may obtain various attributes of the order, such as various attribute parameters of an order starting point, an order ending point, a planned order route mileage cost policy, an order duration policy, and the like; and then calculating the estimated cost of the order according to various attributes of the order and the configuration of the platform corresponding to the region where the order is located. Meanwhile, the estimated cost and the corresponding reference value need to be determined in the embodiment of the application. The estimated cost in the embodiment of the present application can be determined as the following four embodiments:

the first embodiment: if the passenger does not carry out the pricing, the estimated cost is a first cost, the first cost is the order flow, and the reference value is a first reference value obtained based on the specified order flow.

Illustratively, the order pipeline for the order is 40 yuan, and the platform is abstracted to 20%. If the passenger does not make a price increase, the estimated cost of the order is 40 yuan.

The second embodiment: the estimated cost is a second cost if the passenger is not being billed, the second cost is estimated revenue of the driver in the ordered flow, and the reference value is a second reference value based on the estimated revenue of the driver in the specified ordered flow.

Illustratively, the order pipeline for the order is 40 yuan, and the platform is abstracted to 20%. If the passenger is not being charged, the estimated cost of the order is the estimated income of the driver in the order flow, i.e. 40- (40 x 20%) -32 yuan.

Third embodiment: if the passenger carries out the pricing, the estimated cost is a third cost, the third cost is the sum of the order flow and the passenger pricing part, and the reference value is a first reference value obtained based on the specified order flow.

Illustratively, the order pipeline for the order is 40 yuan, and the platform is abstracted to 20%. If the passenger has made a premium and made a premium of 10 dollars, the estimated cost of the order is the running water of the order plus the passenger's premium, i.e., 40+10 dollars to 50 dollars.

Fourth embodiment: the estimated cost is a fourth cost if the passenger is billed, the fourth cost is a sum of the estimated driver revenue in the order stream and the passenger billed portion, and the reference value is a second reference value based on the estimated driver revenue in the specified order stream.

Illustratively, the order pipeline for this order is 40 dollars, and the platform abstracts to 20%. If the passenger has made a premium and has a 10 dollar premium, the estimated cost of the order is the sum of the driver's estimated income in the order flow and the passenger's premium portion, i.e., 40- (40 x 20%) +10 ═ 42 dollars.

Therefore, the estimated cost corresponding to the order under four conditions can be determined.

In one possible implementation, the first reference value in the embodiment of the present application may be determined using the following two methods:

the method comprises the following steps: specifying the running water of the order as a first historical average running water per unit time for the candidate vehicle, then determining the first reference value comprises: and multiplying the total time length from the current position to the order completion by the first historical average running water to obtain a first reference value.

The second method comprises the following steps: designating the order flow as a second historical average flow per unit time of all vehicles in the area of the time period of the order, wherein determining the first reference value comprises: and multiplying the total time length from the current position to the order completion by the second historical average running water to obtain a first reference value.

For example, the total time length T required by the candidate vehicle from the current position to the completion of the order is obtained, that is, the driving receiving time length T1 of the candidate vehicle is added to the order completion time length T2 of the candidate vehicle, so as to obtain the total time length T, and then the first historical average running water M1 of the candidate vehicle in unit time is obtained, where the first historical average running water M1 may be obtained by calculating the historical total running water of the candidate vehicle divided by the vehicle leaving time length, and then the total time length T is multiplied by the first historical average running water M1, so as to obtain the first reference value. Or the second historical average running water M2 in unit time of all vehicles in the area where the order is located in the time period where the order is located, wherein the second historical average running water M2 may be calculated by dividing the running water sum of all vehicles in the time period where the order is located in the area where the candidate vehicle is located by the time length sum, and then multiplying the total time length T by the second historical average running water M2, so as to obtain the first reference value.

In one possible implementation, the second reference value in the embodiment of the present application can be determined using the following two methods:

the method comprises the following steps: assigning the running water of the order as a first historical average running water per unit time of the candidate vehicle, the determining the second reference value comprising: and multiplying the average driver income in the first historical average water by the total time length from the current position to the completion of the order to obtain a second reference value.

The second method comprises the following steps: specifying the order flow as a second historical average flow per unit time for all vehicles in the area of the time period in which the order is located, the determining the second reference value comprising: and multiplying the average driver income in the second historical average water by the total time from the current position to the completion of the order to obtain a second reference value.

For example, the total duration T from the current position to the time when the candidate vehicle completes the order is obtained first, that is, the driving pickup duration T1 of the candidate vehicle is added to the order duration T2 of the completed order, so as to obtain the total duration T. Then, the average driver income M3 in the first historical average water of the candidate vehicle in unit time is obtained, wherein the average driver income M3 in the first historical average water can be calculated by dividing the driver income in the historical total water of the candidate vehicle by the vehicle-out time, and then the total time T is multiplied by the average driver income M3 in the first historical average water, so that the second reference value can be obtained. Or the average driver income M4 in the second historical average flowing water per unit time of all vehicles in the area where the order is located in the time period, wherein the average driver income M4 in the second historical average flowing water can be calculated by dividing the sum of the driver incomes in the flowing water of all vehicles in the time period where the order is located in the area where the candidate vehicle is located by the sum of the time lengths, and then multiplying the total time length T by the average driver income M4 in the second historical average flowing water to obtain the second reference value.

All vehicles in the area of the time period of the order are all vehicles with the start time and/or the end time of the order being coincident with the start time and/or the end time of the current order.

The embodiment of the application does not limit the calculation modes of the first historical average running water, the second historical average running water, the average driver income in the first historical average running water and the average driver income in the second historical average running water.

Thus, the first reference value and the second reference value of the current order may be determined based on different ways.

In specific implementation, when determining whether the estimated cost is smaller than the reference value in step 202, the embodiment of the present application may compare the acquired estimated cost with the corresponding reference value. The correspondence between the estimated cost and the reference value can be summarized as the following 8 correspondences:

the corresponding relation 1: appointing the order flow as a first historical average flow in unit time of the candidate vehicles, and if the passengers do not add the prices, estimating the cost as a first cost, wherein the first cost is the order flow; the corresponding reference value is a first reference value obtained by multiplying the first historical average running water by the total time required from the current position to the completion of the order.

Correspondence relationship 2: appointing the order flow as a second historical average flow in unit time of all vehicles in the area of the time period of the order, and if the passenger does not add the price, estimating the cost as a first cost, wherein the first cost is the order flow; and the corresponding reference value is the first reference value obtained by multiplying the second historical average running water by the total time required by finishing the order from the current position.

Correspondence relationship 3: appointing the order running water as a first historical average running water in unit time of the candidate vehicle, and if the passenger does not carry out the charging, the estimated cost is a second cost which is the income of the driver in the order running water; the corresponding reference value is a second reference value obtained by multiplying the average driver income in the first historical average water by the total time required from the current position to the completion of the order.

Correspondence relationship 4: appointing the order flow as a second historical average flow in unit time of all vehicles in the area of the time period of the order, and if the passenger does not add the price, estimating the cost as a second cost which is the income of the driver in the order flow; the corresponding reference value is a second reference value obtained by multiplying the average driver income in the second historical average water by the total time required from the current position to the completion of the order.

Correspondence relationship 5: appointing the order flow as a first historical average flow in unit time of the candidate vehicle, and if the passenger adds the price, the estimated cost is a third cost, and the third cost is the sum of the order flow and the passenger adding price part; the corresponding reference value is a first reference value obtained by multiplying the first historical average running water by the total time required from the current position to the completion of the order.

Correspondence relationship 6: appointing the order flow as a second historical average flow in unit time of all vehicles in the area of the time period of the order, and if the passenger adds the price, estimating the cost as a third cost, wherein the third cost is the sum of the order flow and the passenger added price; and the corresponding reference value is the first reference value obtained by multiplying the second historical average running water by the total time required by finishing the order from the current position.

The corresponding relation 7: appointing the order running water as the first historical average running water in the unit time of the candidate vehicle, and charging the passenger, wherein the estimated cost is the fourth cost which is the sum of the driver income and the passenger charging part in the order running water; the corresponding reference value is a second reference value obtained by multiplying the average driver income in the first historical average water by the total time required from the current position to the completion of the order.

The corresponding relation 8: appointing the order running water as a second historical average running water in unit time of all vehicles in the area of the time period of the order, and charging passengers, wherein the estimated cost is a fourth cost which is the sum of the driver income and the passenger charging part in the order running water; the corresponding reference value is a second reference value obtained by multiplying the average driver income in the second historical average water by the total time required from the current position to the completion of the order.

Therefore, the reference value of the current order can be calculated, the estimated cost corresponding to the reference value is calculated according to the corresponding relation, and then the calculated reference value of the current order and the estimated cost corresponding to the reference value are compared to judge whether to subsidize the candidate vehicle.

In a possible implementation manner, before determining whether to subsidize the candidate vehicle, in order to determine whether the passenger adds a price, the embodiment of the present application further includes: if the candidate vehicle is in a driving receiving route and/or an order route, a pricing request is pushed to the passenger; receiving feedback information of the passenger on the pricing request.

If the feedback information of the passenger on the pricing request is received, the final estimated cost of the order comprises the pricing part of the passenger and the estimated cost of the order determined by the order system based on the order flow. If the feedback information of the passenger on the pricing request is received, the final estimated cost of the order only comprises the estimated cost of the order, which is determined by the order system based on the order pipelining.

For example, if a congested road segment exists in the pick-up route and/or the order route of the candidate vehicle, a pricing request is pushed to the passenger: "there is a vehicle that can receive a vehicle before but needs to make up for a price difference of X yuan", and X is set to be an integer, for example, the added value is set to be a step value such as 3 yuan, 5 yuan, 8 yuan, 10 yuan, etc., or the added value may be set to be a whole value such as 1 yuan, 2 yuan, 3 yuan … …, etc., or a value such as 5 yuan, 10 yuan, 15 yuan … …, etc., which may be set according to actual conditions. And sets the time for the passenger to perform the pricing operation, for example, by limiting the time for the pricing operation to 10 seconds. And if the passenger agrees to the X-element pricing before the countdown is finished for 10 seconds, the passenger terminal actively updates the pricing part of the passenger of the order information, and the order system takes the sum of the pricing part of the passenger and the estimated cost of the order determined by the order system based on the order flow when the passenger does not yet bid as the final estimated cost of the order and is used for judging whether to subsidize the candidate vehicle. If the passenger does not agree with the X-yuan before the countdown is finished for 10 seconds, or the passenger does not agree with the X-yuan after the countdown is finished for 10 seconds, the order system takes the estimated cost of the order, which is determined by the order system based on the order flow when the passenger does not agree with the price, as the final estimated cost of the order, and is used for judging whether to subsidize the candidate vehicle.

Therefore, more accurate estimated cost of the order can be obtained by receiving the feedback information of the passenger on the pricing request, and whether the candidate vehicle is subsidized or not is further accurately judged.

In step 104, if the candidate vehicle is subsidized, a subsidizing operation for the candidate vehicle is performed.

In a possible implementation manner, in the embodiment of the present application, a subsidy operation for a candidate vehicle is performed, and is specifically implemented as the steps shown in fig. 3:

in step 301, the difference between the estimated cost and the reference value is determined.

The difference between the estimated cost and the reference value can be obtained by subtracting the corresponding estimated cost from the reference value, so as to determine the subsidy value required by the current order.

Specifically, the estimated cost and the reference value in any one of the corresponding relations 1 to 8 in the foregoing may be used to determine the subsidy value required by the current order.

In step 302, the maximum subsidy of the platform is determined based on the preset maximum subsidy rate and the maximum subsidy.

In a possible implementation manner, in this embodiment, determining the maximum subsidy of the platform based on the preset maximum subsidy rate and the preset maximum subsidy includes: multiplying the highest subsidy rate by the order flow of the order to obtain a first subsidy value; if the first subsidy value is greater than the highest subsidy amount, taking the highest subsidy amount as the maximum subsidy amount of the candidate vehicle; and if the first subsidy value is less than or equal to the highest subsidy amount, taking the first subsidy value as the maximum subsidy amount of the candidate vehicle.

Before determining the maximum subsidy of the platform based on the preset maximum subsidy rate and the preset maximum subsidy, the maximum subsidy rate and the maximum subsidy of the platform where the candidate vehicle is located for the order are firstly obtained, for example, the maximum subsidy rate of the platform where the candidate vehicle is located for the order is 25%, and the maximum subsidy is 25 yuan.

In step 303, if the maximum subsidy is greater than or equal to the difference, the candidate vehicle is subsidized and an order dispatching operation is performed based on the candidate vehicle.

In a possible implementation manner, in the embodiment of the application, if the maximum subsidy amount is smaller than the difference, the next candidate vehicle is screened, and the step of judging whether to subsidy the candidate vehicle is returned to be executed if a congested road section exists in a driving receiving route and/or an order route of the candidate vehicle.

In one possible implementation, in the embodiment of the present application, a message for subsidizing the candidate vehicle may be sent to the candidate vehicle.

Therefore, the candidate vehicles can know that the platform subsidizes the candidate vehicles, the probability of canceling orders by the candidate vehicles is reduced, the enthusiasm of the candidate vehicles in the forward hot area is mobilized, the rejection sense of drivers of the candidate vehicles to the congestion area is reduced by controllable subsidizing, and the activity of the drivers is improved.

If the driving receiving route and/or the order route of the candidate vehicle has a congested road section, but the estimated cost is judged to be not less than the reference value, determining not to subsidize the candidate vehicle, and if the subsidizing is not performed on the candidate vehicle, performing order dispatching operation based on the candidate vehicle.

In order to further understand the network appointment scheduling method provided in the embodiment of the present application and the subsidy operation for the candidate vehicle in the present application, the subsidy operation for the candidate vehicle is described below with an example.

Illustratively, the average hourly reference value for a certain late peak time period is 60 yuan, wherein after 20% of the platform draw, the average hourly income of the driver is 48 yuan. The first reference value is 60-ary and the second reference value is 48-ary.

Assuming there is currently an order from the hot zone, the estimated pickup time is 30 minutes, and the order time is 30 minutes so that the driver takes 1 hour to complete the task of the order. Assuming that the order flow for the system to obtain the order is 40 yuan, the scheme for subsidizing the candidate vehicles can be divided into the following two cases according to whether the reference value is before or after the drawing:

the first condition is as follows: the first reference value is the designated order pipeline, which is 60-tuple.

Scheme 1: if the passenger does not add the price, the estimated cost of the order is 40 yuan, and the estimated cost is less than 60 yuan of the reference value, so the driver needs to be subsidized to dispatch the order. At this time, if the platform is subsidized by 20 yuan, the candidate vehicles can be dispatched.

Scheme 2: if the passenger carries out the price adding of 10 yuan, the estimated cost of the order is order running water + the price adding amount, and is 50 yuan for 40+10, and the estimated cost is less than 60 yuan of the reference value, so that the driver needs to be subsidized to dispatch the order. The platform can dispatch the candidate vehicle only by subsidizing 10 yuan.

Scheme 3: if the passenger does not add the price, the estimated cost of the order is 40 yuan, and the estimated cost is less than 60 yuan of the reference value, so the driver needs to be subsidized to dispatch the order. At this time, if the highest subsidy rate allowed by the platform is within 25% of the order running water and the highest subsidy amount is 25 yuan, the highest subsidy rate is multiplied by the order running water of the order to obtain a first subsidy value which is 10 yuan and is smaller than the highest subsidy amount by 25 yuan, the first subsidy value of 10 yuan is used as the maximum subsidy amount of the candidate vehicle, the difference value between the estimated cost and the reference value is 20 yuan, and the maximum subsidy amount of the candidate vehicle is smaller than the difference value, so that the candidate vehicle cannot be dispatched.

The rest schemes are calculated by referring to the 3 schemes, and redundant description is omitted herein.

Case two: the second reference value is 48 dollars for driver revenue in a given order of water.

Scheme 1: if the passenger does not add the price, the estimated cost of the order is that the order flow is multiplied by (1-20%), namely 40 x (1-20%), is 32 yuan, and the estimated cost is less than 48 yuan of a reference value, so that the driver needs to be subsidized to be dispatched. At this time, if the platform is subsidized by 16 yuan, the candidate vehicles can be dispatched.

Scheme 2: if the passenger adds 10 yuan, the estimated cost of the order is that the order flow is multiplied by (1-20%) + added amount, 40 x (1-20%) +10 ═ 42 yuan, and the estimated cost is less than 48 yuan, so that the driver needs to be subsidized to be assigned the order. The platform can dispatch the candidate vehicle only by subsidizing 6 yuan.

Scheme 3: if the passenger does not add the price, the estimated cost of the order is that the order flow is multiplied by (1-20%), namely 40 x (1-20%), is 32 yuan, and the estimated cost is less than 48 yuan of a reference value, so that the driver needs to be subsidized to be dispatched. At this time, if the highest subsidy rate allowed by the platform is within 25% of the order running water and the highest subsidy amount is 25 yuan, the highest subsidy rate is multiplied by the order running water of the order to obtain a first subsidy value which is 10 yuan and is smaller than the highest subsidy amount by 25 yuan, the first subsidy value of 10 yuan is used as the maximum subsidy amount of the candidate vehicle, the difference value between the estimated cost and the reference value is 16 yuan, and the maximum subsidy amount of the candidate vehicle is smaller than the difference value, so that the candidate vehicle cannot be dispatched.

Thus, the operation of subsidizing candidate vehicles in the embodiment of the present application is described in detail with the above-described example.

It should be noted that, when suggesting a candidate vehicle to go to a certain hot zone, extra subsidy rules of the platform due to congestion may be first expressed to the driver of the candidate vehicle, so as to reduce the concern that the driver goes to the congestion hot zone, and further reduce the difficulty of queuing and waiting for passengers. The net appointment vehicle has three elements of a driver, a vehicle and a passenger, and a general platform subsidy scheme is oriented to the passenger, but the net appointment vehicle scheduling method provided by the embodiment of the application is to perform appropriate dynamic subsidy for the driver, so that the activeness of the driver is improved. In practical situations, the maximum subsidy amount of the platform may be greater than or equal to the difference between the estimated cost and the reference value, such as adding an extra scheduling base cost or increasing a scheduling bonus, which may further increase the activity of the driver.

Based on the foregoing description, the present application discloses a network taxi appointment scheduling method, by receiving an order of a passenger; screening candidate vehicles based on the order; if the candidate vehicle has a congested road section in the driving receiving route and/or the order route, judging whether to subsidize the candidate vehicle; if the candidate vehicle is subsidized, executing subsidization operation aiming at the candidate vehicle; and if the candidate vehicle is not subsidized, performing an order dispatching operation based on the candidate vehicle. Therefore, candidate vehicles which are congested road sections and need to be subsidized in the driving route and/or the order route are subsidized, the enthusiasm of the candidate vehicles in the forward hot area is mobilized, the area levels of the vehicles and passengers are balanced, the controllable subsidy is used, the rejection feeling of drivers of the candidate vehicles to the congested area is reduced, the liveness of the drivers is improved, and the situation that the drivers are difficult to take the vehicles in the hot area with a very high congestion index under the condition that the drivers face scheduling suggestions in the forward hot area but are actually not willing to go to the congested area is relieved.

As shown in fig. 4, based on the same inventive concept as the network car booking and scheduling method, an embodiment of the present application further provides a network car booking and scheduling device, including: a first receiving module 401, a screening module 402, a determining module 403, and a subsidizing module 404, wherein:

a first receiving module 401, configured to receive an order of a passenger;

a screening module 402 for screening candidate vehicles based on the order;

the judging module 403 is configured to judge whether to subsidize the candidate vehicle if a congested road segment exists in a pickup route and/or an order route of the candidate vehicle;

a patching module 404, configured to perform a patching operation for the candidate vehicle if the candidate vehicle is patched.

In a possible implementation manner, the determining module 403 is specifically configured to:

judging whether the estimated cost is less than a reference value;

In a possible embodiment, the apparatus further comprises:

alternatively, the first and second electrodes may be,

In a possible implementation manner, the determining module 403 is configured to determine whether to patch the candidate vehicle, and the apparatus further includes:

the first sending module is used for pushing a pricing request to the passenger if a congested road section exists in the pick-up route or the order route of the candidate vehicle;

In a possible embodiment, the apparatus further comprises:

the second determining module is further configured to determine the maximum subsidy of the platform based on a preset maximum subsidy rate and a preset maximum subsidy amount;

the subsidy module 404 is further configured to subsidy the candidate vehicle and perform an order dispatching operation based on the candidate vehicle if the maximum subsidy amount is greater than or equal to the difference.

In a possible implementation manner, the screening module 402 is further configured to screen a next candidate vehicle if the maximum subsidy amount is smaller than the difference, and return to execute the step of determining whether to subsidize the candidate vehicle if a congested road segment exists in a driving receiving route and/or an order route of the candidate vehicle.

In a possible embodiment, the apparatus further comprises:

The network appointment scheduling device and the network appointment scheduling method provided by the embodiment of the application adopt the same inventive concept, can obtain the same beneficial effects, and are not repeated herein.

Based on the same inventive concept as the network appointment scheduling method, the embodiment of the application also provides the electronic equipment. The electronic device 110 according to this embodiment of the present application is described below with reference to fig. 5. The electronic device 110 shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.

As shown in fig. 5, the electronic device 110 is represented in the form of a general electronic device. The components of the electronic device 110 may include, but are not limited to: the at least one processor 111, the at least one memory 112, and a bus 113 that connects the various system components (including the memory 112 and the processor 111).

Bus 113 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, or a local bus using any of a variety of bus architectures.

The memory 112 may include readable media in the form of volatile memory, such as Random Access Memory (RAM)1121 and/or cache memory 1122, and may further include Read Only Memory (ROM) 1123.

Memory 112 may also include a program/utility 1125 having a set (at least one) of program modules 1124, such program modules 1124 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Electronic device 110 may also communicate with one or more external devices 114 (e.g., keyboard, pointing device, etc.), with one or more devices that enable a user to interact with electronic device 110, and/or with any devices (e.g., router, modem, etc.) that enable electronic device 110 to communicate with one or more other electronic devices. Such communication may be through an input/output (I/O) interface 115. Also, the electronic device 110 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 116. As shown, the network adapter 116 communicates with other modules for the electronic device 110 over the bus 113. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with electronic device 110, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

In an exemplary embodiment, a computer-readable storage medium comprising instructions, such as the memory 112 comprising instructions, executable by the processor 111 to perform the network appointment scheduling method is also provided. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

In an exemplary embodiment, there is also provided a computer program product comprising a computer program which, when executed by the processor 111, implements any of the network appointment scheduling methods as provided herein.

In an exemplary embodiment, the various aspects of a network appointment scheduling method provided in the present application may also be implemented in the form of a program product, which includes program code for causing a computer device to perform the steps of the network appointment scheduling method according to various exemplary embodiments of the present application described above in this specification, when the program product is run on the computer device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The program product for the network appointment scheduling method of the embodiment of the application can adopt a portable compact disc read only memory (CD-ROM) and comprises program codes, and can be run on an electronic device. However, the program product of the present application is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the consumer electronic device, partly on the consumer electronic device, as a stand-alone software package, partly on the consumer electronic device and partly on a remote electronic device, or entirely on the remote electronic device or server. In the case of remote electronic devices, the remote electronic devices may be connected to the consumer electronic device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external electronic device (e.g., through the internet using an internet service provider).

It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functions of two or more units described above may be embodied in one unit, according to embodiments of the application. Conversely, the features and functions of one unit described above may be further divided into embodiments by a plurality of units.

Further, while the operations of the methods of the present application are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable image scaling apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable image scaling apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable image scaling apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable image scaling device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer implemented process such that the instructions which execute on the computer or other programmable device provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A network appointment scheduling method is characterized by comprising the following steps:

receiving an order of a passenger;

screening candidate vehicles based on the orders;

2. The method of claim 1, wherein the determining whether to subsidize the candidate vehicle comprises:

judging whether the estimated cost is less than a reference value;

3. The method of claim 1, wherein said determining whether the estimated cost is less than a reference value comprises:

4. The method of claim 3,

the designated order flow is a first historical average flow per unit time of the candidate vehicle, and determining the first reference value comprises:

alternatively, the first and second electrodes may be,

the specified order flow is a second historical average flow per unit time of all vehicles in an area of a time period in which the order is located, and determining the first reference value comprises:

alternatively, the first and second electrodes may be,

5. The method of claim 1, wherein prior to determining whether to subsidize the candidate vehicle, the method further comprises:

receiving feedback information of the passenger on the pricing request.

6. The method of claim 2, wherein the performing a subsidy operation for the candidate vehicle comprises:

and if the maximum subsidy amount is larger than or equal to the difference value, subsiding the candidate vehicle, and performing order dispatching operation based on the candidate vehicle.

7. The method of claim 6, further comprising:

and if the maximum subsidy amount is smaller than the difference value, screening the next candidate vehicle, and returning to execute the step of judging whether to subsidize the candidate vehicle if a driving receiving route and/or an order route of the candidate vehicle has a congested road section.

8. The method of claim 6, wherein determining the maximum subsidy for the platform based on the preset maximum subsidy rate and the preset maximum subsidy comprises:

9. A network appointment scheduling apparatus, the apparatus comprising:

the first receiving module is used for receiving orders of passengers;

a screening module for screening candidate vehicles based on the order;

a subsidy module for executing a subsidy operation for the candidate vehicle if the candidate vehicle is subsidized;

the subsidy module is further used for performing a dispatching operation based on the candidate vehicle if the candidate vehicle is not subsidized.

10. An electronic device, comprising:

a processor;

a memory for storing the processor-executable instructions;

wherein the processor is configured to execute the instructions to implement the network appointment scheduling method of any one of claims 1-8.

11. A computer-readable storage medium having instructions thereon, which, when executed by a processor of an electronic device, enable the electronic device to perform the network appointment scheduling method of any one of claims 1-8.